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/diamond_1-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-0883e75 [2019-09-05 12:46:25,149 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-05 12:46:25,152 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-05 12:46:25,168 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-05 12:46:25,168 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-05 12:46:25,170 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-05 12:46:25,172 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-05 12:46:25,181 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-05 12:46:25,183 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-05 12:46:25,183 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-05 12:46:25,184 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-05 12:46:25,185 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-05 12:46:25,185 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-05 12:46:25,186 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-05 12:46:25,187 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-05 12:46:25,188 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-05 12:46:25,189 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-05 12:46:25,191 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-05 12:46:25,193 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-05 12:46:25,194 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-05 12:46:25,196 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-05 12:46:25,197 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-05 12:46:25,198 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-05 12:46:25,198 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-05 12:46:25,200 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-05 12:46:25,200 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-05 12:46:25,201 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-05 12:46:25,201 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-05 12:46:25,202 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-05 12:46:25,203 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-05 12:46:25,203 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-05 12:46:25,204 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-05 12:46:25,204 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-05 12:46:25,205 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-05 12:46:25,207 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-05 12:46:25,207 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-05 12:46:25,208 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-05 12:46:25,208 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-05 12:46:25,208 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-05 12:46:25,209 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-05 12:46:25,210 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-05 12:46:25,211 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-05 12:46:25,229 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-05 12:46:25,230 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-05 12:46:25,230 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-05 12:46:25,230 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-05 12:46:25,231 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-05 12:46:25,231 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-05 12:46:25,231 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-05 12:46:25,231 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-05 12:46:25,232 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-05 12:46:25,232 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-05 12:46:25,232 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-05 12:46:25,233 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-05 12:46:25,233 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-05 12:46:25,233 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-05 12:46:25,235 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-05 12:46:25,235 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-05 12:46:25,235 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-05 12:46:25,235 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-05 12:46:25,235 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-05 12:46:25,236 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-05 12:46:25,236 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-05 12:46:25,236 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-05 12:46:25,236 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-05 12:46:25,237 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-05 12:46:25,237 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-05 12:46:25,237 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-05 12:46:25,237 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-05 12:46:25,237 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-05 12:46:25,238 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-05 12:46:25,238 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-05 12:46:25,287 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-05 12:46:25,302 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-05 12:46:25,307 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-05 12:46:25,308 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-05 12:46:25,309 INFO L275 PluginConnector]: CDTParser initialized [2019-09-05 12:46:25,310 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/diamond_1-2.c [2019-09-05 12:46:25,383 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01b54e1ab/e6f9934afd83408e92776a460661e400/FLAG47e0efe4c [2019-09-05 12:46:25,797 INFO L306 CDTParser]: Found 1 translation units. [2019-09-05 12:46:25,798 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/diamond_1-2.c [2019-09-05 12:46:25,802 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01b54e1ab/e6f9934afd83408e92776a460661e400/FLAG47e0efe4c [2019-09-05 12:46:26,182 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01b54e1ab/e6f9934afd83408e92776a460661e400 [2019-09-05 12:46:26,190 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-05 12:46:26,192 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-05 12:46:26,193 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-05 12:46:26,193 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-05 12:46:26,196 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-05 12:46:26,197 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 12:46:26" (1/1) ... [2019-09-05 12:46:26,200 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c68dd03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:46:26, skipping insertion in model container [2019-09-05 12:46:26,200 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 12:46:26" (1/1) ... [2019-09-05 12:46:26,208 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-05 12:46:26,224 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-05 12:46:26,418 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 12:46:26,428 INFO L188 MainTranslator]: Completed pre-run [2019-09-05 12:46:26,451 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 12:46:26,463 INFO L192 MainTranslator]: Completed translation [2019-09-05 12:46:26,463 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:46:26 WrapperNode [2019-09-05 12:46:26,464 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-05 12:46:26,464 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-05 12:46:26,464 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-05 12:46:26,464 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-05 12:46:26,561 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:46:26" (1/1) ... [2019-09-05 12:46:26,563 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:46:26" (1/1) ... [2019-09-05 12:46:26,568 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:46:26" (1/1) ... [2019-09-05 12:46:26,569 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:46:26" (1/1) ... [2019-09-05 12:46:26,577 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:46:26" (1/1) ... [2019-09-05 12:46:26,582 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:46:26" (1/1) ... [2019-09-05 12:46:26,583 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:46:26" (1/1) ... [2019-09-05 12:46:26,586 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-05 12:46:26,587 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-05 12:46:26,587 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-05 12:46:26,587 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-05 12:46:26,588 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:46:26" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-05 12:46:26,640 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-05 12:46:26,641 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-05 12:46:26,641 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-05 12:46:26,641 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-05 12:46:26,641 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-05 12:46:26,641 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2019-09-05 12:46:26,641 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-05 12:46:26,641 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-05 12:46:26,642 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-05 12:46:26,642 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-05 12:46:26,815 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-05 12:46:26,815 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-05 12:46:26,816 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 12:46:26 BoogieIcfgContainer [2019-09-05 12:46:26,817 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-05 12:46:26,818 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-05 12:46:26,818 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-05 12:46:26,821 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-05 12:46:26,821 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.09 12:46:26" (1/3) ... [2019-09-05 12:46:26,822 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12a0f87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 12:46:26, skipping insertion in model container [2019-09-05 12:46:26,822 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:46:26" (2/3) ... [2019-09-05 12:46:26,822 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12a0f87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 12:46:26, skipping insertion in model container [2019-09-05 12:46:26,823 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 12:46:26" (3/3) ... [2019-09-05 12:46:26,824 INFO L109 eAbstractionObserver]: Analyzing ICFG diamond_1-2.c [2019-09-05 12:46:26,833 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-05 12:46:26,841 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-05 12:46:26,857 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-05 12:46:26,879 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-05 12:46:26,879 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-05 12:46:26,879 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-05 12:46:26,880 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-05 12:46:26,880 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-05 12:46:26,880 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-05 12:46:26,880 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-05 12:46:26,880 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-05 12:46:26,893 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2019-09-05 12:46:26,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-05 12:46:26,900 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:46:26,901 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:46:26,903 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:46:26,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:46:26,907 INFO L82 PathProgramCache]: Analyzing trace with hash -721501374, now seen corresponding path program 1 times [2019-09-05 12:46:26,909 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:46:26,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:26,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:46:26,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:26,949 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:46:26,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:26,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:46:27,001 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 12:46:27,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-05 12:46:27,001 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 12:46:27,004 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-05 12:46:27,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-05 12:46:27,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-05 12:46:27,017 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2019-09-05 12:46:27,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:46:27,029 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2019-09-05 12:46:27,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-05 12:46:27,030 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-09-05 12:46:27,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:46:27,039 INFO L225 Difference]: With dead ends: 18 [2019-09-05 12:46:27,039 INFO L226 Difference]: Without dead ends: 12 [2019-09-05 12:46:27,041 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-05 12:46:27,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-09-05 12:46:27,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-09-05 12:46:27,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-09-05 12:46:27,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2019-09-05 12:46:27,075 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 10 [2019-09-05 12:46:27,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:46:27,075 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2019-09-05 12:46:27,075 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-05 12:46:27,075 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2019-09-05 12:46:27,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-05 12:46:27,076 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:46:27,076 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:46:27,077 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:46:27,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:46:27,077 INFO L82 PathProgramCache]: Analyzing trace with hash -730736584, now seen corresponding path program 1 times [2019-09-05 12:46:27,077 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:46:27,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:27,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:46:27,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:27,079 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:46:27,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:27,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:46:27,197 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 12:46:27,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-05 12:46:27,197 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 12:46:27,199 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-05 12:46:27,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-05 12:46:27,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-05 12:46:27,201 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand 3 states. [2019-09-05 12:46:27,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:46:27,287 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2019-09-05 12:46:27,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-05 12:46:27,288 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-09-05 12:46:27,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:46:27,291 INFO L225 Difference]: With dead ends: 14 [2019-09-05 12:46:27,291 INFO L226 Difference]: Without dead ends: 14 [2019-09-05 12:46:27,292 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-05 12:46:27,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-09-05 12:46:27,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-09-05 12:46:27,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-09-05 12:46:27,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-09-05 12:46:27,297 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2019-09-05 12:46:27,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:46:27,298 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-09-05 12:46:27,298 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-05 12:46:27,298 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-09-05 12:46:27,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-05 12:46:27,299 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:46:27,299 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:46:27,299 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:46:27,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:46:27,300 INFO L82 PathProgramCache]: Analyzing trace with hash -1082855947, now seen corresponding path program 1 times [2019-09-05 12:46:27,300 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:46:27,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:27,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:46:27,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:27,302 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:46:27,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:27,484 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:46:27,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:46:27,485 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:46:27,486 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 13 with the following transitions: [2019-09-05 12:46:27,488 INFO L207 CegarAbsIntRunner]: [0], [4], [11], [13], [16], [25], [28], [30], [36], [37], [38], [40] [2019-09-05 12:46:27,519 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-05 12:46:27,519 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-05 12:46:27,574 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-05 12:46:27,997 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-05 12:46:28,000 INFO L272 AbstractInterpreter]: Visited 12 different actions 47 times. Merged at 3 different actions 15 times. Widened at 1 different actions 3 times. Performed 74 root evaluator evaluations with a maximum evaluation depth of 13. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 13. Found 1 fixpoints after 1 different actions. Largest state had 4 variables. [2019-09-05 12:46:28,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:46:28,005 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-05 12:46:28,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:46:28,005 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:46:28,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:46:28,020 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 12:46:28,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:28,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-05 12:46:28,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:46:28,084 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:46:28,087 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:46:28,129 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:46:28,133 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:46:28,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2019-09-05 12:46:28,133 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:46:28,134 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 12:46:28,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 12:46:28,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-09-05 12:46:28,135 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 5 states. [2019-09-05 12:46:28,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:46:28,206 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2019-09-05 12:46:28,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-05 12:46:28,208 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-09-05 12:46:28,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:46:28,209 INFO L225 Difference]: With dead ends: 16 [2019-09-05 12:46:28,209 INFO L226 Difference]: Without dead ends: 16 [2019-09-05 12:46:28,209 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 21 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-05 12:46:28,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-09-05 12:46:28,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2019-09-05 12:46:28,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-09-05 12:46:28,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2019-09-05 12:46:28,215 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 12 [2019-09-05 12:46:28,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:46:28,215 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-09-05 12:46:28,215 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 12:46:28,216 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2019-09-05 12:46:28,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-05 12:46:28,216 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:46:28,216 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:46:28,217 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:46:28,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:46:28,217 INFO L82 PathProgramCache]: Analyzing trace with hash -1025597645, now seen corresponding path program 1 times [2019-09-05 12:46:28,217 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:46:28,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:28,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:46:28,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:28,219 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:46:28,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:28,344 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:46:28,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:46:28,345 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:46:28,345 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 13 with the following transitions: [2019-09-05 12:46:28,346 INFO L207 CegarAbsIntRunner]: [0], [4], [11], [13], [18], [25], [28], [30], [36], [37], [38], [40] [2019-09-05 12:46:28,347 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-05 12:46:28,347 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-05 12:46:28,349 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-05 12:46:28,582 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-05 12:46:28,583 INFO L272 AbstractInterpreter]: Visited 12 different actions 47 times. Merged at 3 different actions 15 times. Widened at 1 different actions 3 times. Performed 74 root evaluator evaluations with a maximum evaluation depth of 13. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 13. Found 1 fixpoints after 1 different actions. Largest state had 3 variables. [2019-09-05 12:46:28,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:46:28,583 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-05 12:46:28,583 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:46:28,584 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:46:28,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:46:28,605 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 12:46:28,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:28,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-05 12:46:28,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:46:28,634 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:46:28,634 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:46:28,665 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:46:28,668 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:46:28,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2019-09-05 12:46:28,668 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:46:28,669 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 12:46:28,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 12:46:28,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-09-05 12:46:28,670 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand 5 states. [2019-09-05 12:46:28,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:46:28,715 INFO L93 Difference]: Finished difference Result 18 states and 22 transitions. [2019-09-05 12:46:28,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-05 12:46:28,716 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-09-05 12:46:28,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:46:28,717 INFO L225 Difference]: With dead ends: 18 [2019-09-05 12:46:28,717 INFO L226 Difference]: Without dead ends: 18 [2019-09-05 12:46:28,717 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-09-05 12:46:28,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-09-05 12:46:28,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 15. [2019-09-05 12:46:28,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-09-05 12:46:28,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2019-09-05 12:46:28,723 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 12 [2019-09-05 12:46:28,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:46:28,724 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-09-05 12:46:28,724 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 12:46:28,725 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2019-09-05 12:46:28,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-05 12:46:28,726 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:46:28,726 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:46:28,726 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:46:28,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:46:28,727 INFO L82 PathProgramCache]: Analyzing trace with hash -167147406, now seen corresponding path program 2 times [2019-09-05 12:46:28,727 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:46:28,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:28,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:46:28,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:28,729 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:46:28,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:28,869 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:46:28,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:46:28,869 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:46:28,870 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:46:28,870 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:46:28,870 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:46:28,870 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) [2019-09-05 12:46:28,886 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:46:28,886 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:46:28,904 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-05 12:46:28,904 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:46:28,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-05 12:46:28,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:46:28,932 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:46:28,933 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:46:29,028 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:46:29,032 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:46:29,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2019-09-05 12:46:29,032 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:46:29,033 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-05 12:46:29,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-05 12:46:29,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-09-05 12:46:29,034 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand 6 states. [2019-09-05 12:46:29,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:46:29,116 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2019-09-05 12:46:29,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-05 12:46:29,118 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-09-05 12:46:29,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:46:29,118 INFO L225 Difference]: With dead ends: 19 [2019-09-05 12:46:29,118 INFO L226 Difference]: Without dead ends: 19 [2019-09-05 12:46:29,119 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 24 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-05 12:46:29,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-09-05 12:46:29,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2019-09-05 12:46:29,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-09-05 12:46:29,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2019-09-05 12:46:29,128 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 14 [2019-09-05 12:46:29,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:46:29,128 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-09-05 12:46:29,129 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-05 12:46:29,129 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2019-09-05 12:46:29,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-05 12:46:29,129 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:46:29,130 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:46:29,130 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:46:29,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:46:29,133 INFO L82 PathProgramCache]: Analyzing trace with hash -109889104, now seen corresponding path program 1 times [2019-09-05 12:46:29,134 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:46:29,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:29,135 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:46:29,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:29,135 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:46:29,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:29,235 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:46:29,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:46:29,236 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:46:29,236 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 15 with the following transitions: [2019-09-05 12:46:29,236 INFO L207 CegarAbsIntRunner]: [0], [4], [11], [13], [16], [18], [25], [28], [30], [36], [37], [38], [40] [2019-09-05 12:46:29,239 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-05 12:46:29,239 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-05 12:46:29,241 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-05 12:46:29,454 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-05 12:46:29,455 INFO L272 AbstractInterpreter]: Visited 13 different actions 53 times. Merged at 4 different actions 15 times. Widened at 2 different actions 3 times. Performed 101 root evaluator evaluations with a maximum evaluation depth of 13. Performed 101 inverse root evaluator evaluations with a maximum inverse evaluation depth of 13. Found 7 fixpoints after 2 different actions. Largest state had 4 variables. [2019-09-05 12:46:29,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:46:29,455 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-05 12:46:29,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:46:29,455 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:46:29,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:46:29,480 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 12:46:29,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:29,490 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-05 12:46:29,492 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:46:29,516 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:46:29,516 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:46:29,540 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:46:29,546 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-05 12:46:29,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 6 [2019-09-05 12:46:29,546 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 12:46:29,546 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-05 12:46:29,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-05 12:46:29,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-05 12:46:29,547 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand 3 states. [2019-09-05 12:46:29,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:46:29,560 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2019-09-05 12:46:29,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-05 12:46:29,561 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-09-05 12:46:29,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:46:29,563 INFO L225 Difference]: With dead ends: 21 [2019-09-05 12:46:29,563 INFO L226 Difference]: Without dead ends: 21 [2019-09-05 12:46:29,564 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-05 12:46:29,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-09-05 12:46:29,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2019-09-05 12:46:29,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-09-05 12:46:29,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2019-09-05 12:46:29,570 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 14 [2019-09-05 12:46:29,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:46:29,570 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2019-09-05 12:46:29,570 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-05 12:46:29,570 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2019-09-05 12:46:29,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-05 12:46:29,571 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:46:29,571 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:46:29,571 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:46:29,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:46:29,572 INFO L82 PathProgramCache]: Analyzing trace with hash -976494032, now seen corresponding path program 2 times [2019-09-05 12:46:29,572 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:46:29,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:29,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:46:29,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:29,573 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:46:29,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:29,649 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:46:29,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:46:29,650 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:46:29,650 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:46:29,650 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:46:29,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:46:29,650 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 12:46:29,664 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:46:29,664 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-05 12:46:29,678 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-05 12:46:29,678 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:46:29,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-05 12:46:29,680 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:46:29,703 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:46:29,704 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:46:29,723 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:46:29,726 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-05 12:46:29,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 6 [2019-09-05 12:46:29,727 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 12:46:29,727 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-05 12:46:29,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-05 12:46:29,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-05 12:46:29,728 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand 3 states. [2019-09-05 12:46:29,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:46:29,740 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2019-09-05 12:46:29,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-05 12:46:29,743 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-09-05 12:46:29,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:46:29,743 INFO L225 Difference]: With dead ends: 21 [2019-09-05 12:46:29,743 INFO L226 Difference]: Without dead ends: 21 [2019-09-05 12:46:29,744 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-05 12:46:29,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-09-05 12:46:29,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2019-09-05 12:46:29,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-09-05 12:46:29,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2019-09-05 12:46:29,750 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 14 [2019-09-05 12:46:29,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:46:29,750 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2019-09-05 12:46:29,753 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-05 12:46:29,754 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2019-09-05 12:46:29,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-05 12:46:29,754 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:46:29,754 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:46:29,755 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:46:29,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:46:29,755 INFO L82 PathProgramCache]: Analyzing trace with hash -919235730, now seen corresponding path program 2 times [2019-09-05 12:46:29,756 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:46:29,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:29,757 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:46:29,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:29,757 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:46:29,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:29,839 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:46:29,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:46:29,839 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:46:29,840 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:46:29,840 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:46:29,840 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:46:29,840 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:46:29,861 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:46:29,861 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 12:46:29,874 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-05 12:46:29,874 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:46:29,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-05 12:46:29,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:46:29,897 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:46:29,898 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:46:29,937 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (7)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 12:46:29,941 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:46:29,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2019-09-05 12:46:29,941 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:46:29,941 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-05 12:46:29,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-05 12:46:29,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-09-05 12:46:29,942 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand 6 states. [2019-09-05 12:46:29,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:46:29,981 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2019-09-05 12:46:29,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-05 12:46:29,985 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-09-05 12:46:29,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:46:29,986 INFO L225 Difference]: With dead ends: 23 [2019-09-05 12:46:29,986 INFO L226 Difference]: Without dead ends: 23 [2019-09-05 12:46:29,987 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-09-05 12:46:29,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-09-05 12:46:29,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-09-05 12:46:29,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-09-05 12:46:29,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2019-09-05 12:46:29,990 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 14 [2019-09-05 12:46:29,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:46:29,992 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-09-05 12:46:29,992 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-05 12:46:29,992 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2019-09-05 12:46:29,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-05 12:46:29,993 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:46:29,993 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:46:29,993 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:46:29,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:46:29,993 INFO L82 PathProgramCache]: Analyzing trace with hash -639535185, now seen corresponding path program 3 times [2019-09-05 12:46:29,993 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:46:29,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:29,994 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:46:29,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:29,995 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:46:30,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:30,090 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:46:30,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:46:30,091 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:46:30,091 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:46:30,091 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:46:30,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:46:30,091 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 12:46:30,111 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:46:30,112 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:46:30,122 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:46:30,122 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:46:30,123 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-05 12:46:30,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:46:30,170 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:46:30,170 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:46:30,336 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:46:30,342 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:46:30,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2019-09-05 12:46:30,343 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:46:30,343 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-05 12:46:30,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-05 12:46:30,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-09-05 12:46:30,344 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 7 states. [2019-09-05 12:46:30,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:46:30,406 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2019-09-05 12:46:30,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-05 12:46:30,408 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2019-09-05 12:46:30,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:46:30,409 INFO L225 Difference]: With dead ends: 25 [2019-09-05 12:46:30,409 INFO L226 Difference]: Without dead ends: 25 [2019-09-05 12:46:30,409 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-09-05 12:46:30,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-09-05 12:46:30,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2019-09-05 12:46:30,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-09-05 12:46:30,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-09-05 12:46:30,414 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 16 [2019-09-05 12:46:30,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:46:30,414 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-09-05 12:46:30,414 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-05 12:46:30,414 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-09-05 12:46:30,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-05 12:46:30,415 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:46:30,415 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:46:30,415 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:46:30,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:46:30,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1784650519, now seen corresponding path program 3 times [2019-09-05 12:46:30,416 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:46:30,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:30,416 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:46:30,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:30,416 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:46:30,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:30,480 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:46:30,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:46:30,481 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:46:30,481 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:46:30,481 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:46:30,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:46:30,481 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 12:46:30,498 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:46:30,498 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:46:30,511 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:46:30,511 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:46:30,512 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-05 12:46:30,513 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:46:30,544 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:46:30,544 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:46:30,694 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:46:30,699 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:46:30,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2019-09-05 12:46:30,700 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:46:30,700 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-05 12:46:30,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-05 12:46:30,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-09-05 12:46:30,701 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 7 states. [2019-09-05 12:46:30,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:46:30,772 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2019-09-05 12:46:30,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-05 12:46:30,772 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2019-09-05 12:46:30,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:46:30,773 INFO L225 Difference]: With dead ends: 27 [2019-09-05 12:46:30,773 INFO L226 Difference]: Without dead ends: 27 [2019-09-05 12:46:30,774 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-09-05 12:46:30,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-09-05 12:46:30,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2019-09-05 12:46:30,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-09-05 12:46:30,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2019-09-05 12:46:30,777 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 16 [2019-09-05 12:46:30,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:46:30,777 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2019-09-05 12:46:30,777 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-05 12:46:30,777 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2019-09-05 12:46:30,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-05 12:46:30,778 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:46:30,778 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:46:30,778 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:46:30,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:46:30,779 INFO L82 PathProgramCache]: Analyzing trace with hash 662342572, now seen corresponding path program 4 times [2019-09-05 12:46:30,779 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:46:30,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:30,780 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:46:30,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:30,780 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:46:30,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:30,876 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:46:30,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:46:30,876 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:46:30,876 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:46:30,876 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:46:30,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:46:30,877 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 12:46:30,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:46:30,905 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:46:30,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:30,917 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-05 12:46:30,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:46:30,960 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:46:30,960 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:46:31,135 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:46:31,138 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:46:31,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2019-09-05 12:46:31,138 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:46:31,139 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-05 12:46:31,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-05 12:46:31,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-09-05 12:46:31,139 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 8 states. [2019-09-05 12:46:31,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:46:31,231 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2019-09-05 12:46:31,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-05 12:46:31,232 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2019-09-05 12:46:31,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:46:31,232 INFO L225 Difference]: With dead ends: 29 [2019-09-05 12:46:31,233 INFO L226 Difference]: Without dead ends: 29 [2019-09-05 12:46:31,234 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 30 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-05 12:46:31,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-09-05 12:46:31,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-09-05 12:46:31,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-09-05 12:46:31,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2019-09-05 12:46:31,239 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 18 [2019-09-05 12:46:31,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:46:31,242 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2019-09-05 12:46:31,242 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-05 12:46:31,242 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2019-09-05 12:46:31,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-05 12:46:31,243 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:46:31,243 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:46:31,243 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:46:31,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:46:31,243 INFO L82 PathProgramCache]: Analyzing trace with hash -224607324, now seen corresponding path program 4 times [2019-09-05 12:46:31,244 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:46:31,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:31,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:46:31,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:31,245 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:46:31,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:31,339 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:46:31,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:46:31,340 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:46:31,340 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:46:31,340 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:46:31,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:46:31,340 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:46:31,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:46:31,354 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 12:46:31,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:31,363 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-05 12:46:31,364 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:46:31,381 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:46:31,381 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:46:31,641 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:46:31,645 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:46:31,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2019-09-05 12:46:31,645 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:46:31,645 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-05 12:46:31,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-05 12:46:31,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-09-05 12:46:31,646 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 8 states. [2019-09-05 12:46:31,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:46:31,744 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2019-09-05 12:46:31,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-05 12:46:31,745 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2019-09-05 12:46:31,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:46:31,746 INFO L225 Difference]: With dead ends: 31 [2019-09-05 12:46:31,746 INFO L226 Difference]: Without dead ends: 31 [2019-09-05 12:46:31,747 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-09-05 12:46:31,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-09-05 12:46:31,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-09-05 12:46:31,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-05 12:46:31,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2019-09-05 12:46:31,750 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 18 [2019-09-05 12:46:31,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:46:31,750 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2019-09-05 12:46:31,750 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-05 12:46:31,751 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2019-09-05 12:46:31,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-05 12:46:31,751 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:46:31,751 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:46:31,752 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:46:31,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:46:31,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1931383913, now seen corresponding path program 5 times [2019-09-05 12:46:31,752 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:46:31,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:31,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:46:31,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:31,753 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:46:31,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:31,833 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:46:31,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:46:31,834 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:46:31,834 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:46:31,834 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:46:31,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:46:31,834 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:46:31,855 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:46:31,855 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 12:46:31,874 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-09-05 12:46:31,874 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:46:31,875 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-05 12:46:31,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:46:31,896 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:46:31,896 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:46:32,121 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:46:32,124 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:46:32,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2019-09-05 12:46:32,124 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:46:32,125 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-05 12:46:32,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-05 12:46:32,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-09-05 12:46:32,125 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 9 states. [2019-09-05 12:46:32,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:46:32,241 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2019-09-05 12:46:32,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-05 12:46:32,241 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2019-09-05 12:46:32,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:46:32,242 INFO L225 Difference]: With dead ends: 33 [2019-09-05 12:46:32,242 INFO L226 Difference]: Without dead ends: 33 [2019-09-05 12:46:32,242 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 33 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-05 12:46:32,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-09-05 12:46:32,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2019-09-05 12:46:32,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-09-05 12:46:32,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2019-09-05 12:46:32,246 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 20 [2019-09-05 12:46:32,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:46:32,247 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2019-09-05 12:46:32,247 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-05 12:46:32,247 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2019-09-05 12:46:32,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-05 12:46:32,247 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:46:32,248 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:46:32,248 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:46:32,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:46:32,248 INFO L82 PathProgramCache]: Analyzing trace with hash 33316767, now seen corresponding path program 5 times [2019-09-05 12:46:32,248 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:46:32,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:32,249 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:46:32,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:32,249 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:46:32,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:32,336 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:46:32,337 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:46:32,337 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:46:32,337 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:46:32,337 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:46:32,337 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:46:32,338 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:46:32,358 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:46:32,359 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 12:46:32,383 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-09-05 12:46:32,383 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:46:32,384 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-05 12:46:32,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:46:32,417 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:46:32,417 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:46:32,635 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (13)] Exception during sending of exit command (exit): Stream closed [2019-09-05 12:46:32,638 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:46:32,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2019-09-05 12:46:32,639 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:46:32,639 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-05 12:46:32,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-05 12:46:32,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-09-05 12:46:32,640 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 9 states. [2019-09-05 12:46:32,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:46:32,725 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2019-09-05 12:46:32,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-05 12:46:32,726 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2019-09-05 12:46:32,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:46:32,726 INFO L225 Difference]: With dead ends: 35 [2019-09-05 12:46:32,727 INFO L226 Difference]: Without dead ends: 35 [2019-09-05 12:46:32,727 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 33 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-05 12:46:32,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-09-05 12:46:32,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2019-09-05 12:46:32,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-09-05 12:46:32,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2019-09-05 12:46:32,731 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 20 [2019-09-05 12:46:32,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:46:32,731 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2019-09-05 12:46:32,731 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-05 12:46:32,731 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2019-09-05 12:46:32,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-05 12:46:32,732 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:46:32,732 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:46:32,733 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:46:32,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:46:32,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1709400550, now seen corresponding path program 6 times [2019-09-05 12:46:32,733 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:46:32,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:32,734 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:46:32,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:32,734 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:46:32,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:32,840 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-05 12:46:32,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:46:32,841 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:46:32,841 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:46:32,841 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:46:32,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:46:32,841 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) [2019-09-05 12:46:32,855 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:46:32,855 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:46:32,870 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:46:32,870 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:46:32,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-05 12:46:32,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:46:32,895 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-05 12:46:32,896 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:46:33,212 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (14)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 12:46:33,220 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:46:33,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2019-09-05 12:46:33,220 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:46:33,220 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-05 12:46:33,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-05 12:46:33,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2019-09-05 12:46:33,221 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 10 states. [2019-09-05 12:46:33,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:46:33,388 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2019-09-05 12:46:33,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-05 12:46:33,389 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-09-05 12:46:33,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:46:33,390 INFO L225 Difference]: With dead ends: 37 [2019-09-05 12:46:33,390 INFO L226 Difference]: Without dead ends: 37 [2019-09-05 12:46:33,390 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2019-09-05 12:46:33,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-09-05 12:46:33,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2019-09-05 12:46:33,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-09-05 12:46:33,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2019-09-05 12:46:33,398 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 22 [2019-09-05 12:46:33,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:46:33,399 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2019-09-05 12:46:33,399 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-05 12:46:33,399 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2019-09-05 12:46:33,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-05 12:46:33,401 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:46:33,401 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:46:33,401 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:46:33,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:46:33,402 INFO L82 PathProgramCache]: Analyzing trace with hash -1209734950, now seen corresponding path program 6 times [2019-09-05 12:46:33,402 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:46:33,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:33,403 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:46:33,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:33,404 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:46:33,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:33,512 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-05 12:46:33,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:46:33,513 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:46:33,513 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:46:33,513 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:46:33,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:46:33,514 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:46:33,524 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:46:33,524 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 12:46:33,533 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:46:33,534 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:46:33,534 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-05 12:46:33,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:46:33,555 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-05 12:46:33,555 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:46:33,942 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-05 12:46:33,946 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:46:33,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2019-09-05 12:46:33,946 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:46:33,946 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-05 12:46:33,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-05 12:46:33,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2019-09-05 12:46:33,947 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 10 states. [2019-09-05 12:46:34,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:46:34,091 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2019-09-05 12:46:34,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-05 12:46:34,100 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-09-05 12:46:34,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:46:34,101 INFO L225 Difference]: With dead ends: 39 [2019-09-05 12:46:34,101 INFO L226 Difference]: Without dead ends: 39 [2019-09-05 12:46:34,102 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2019-09-05 12:46:34,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-09-05 12:46:34,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2019-09-05 12:46:34,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-09-05 12:46:34,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2019-09-05 12:46:34,107 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 22 [2019-09-05 12:46:34,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:46:34,108 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2019-09-05 12:46:34,108 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-05 12:46:34,108 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2019-09-05 12:46:34,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-05 12:46:34,109 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:46:34,109 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:46:34,109 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:46:34,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:46:34,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1163213789, now seen corresponding path program 7 times [2019-09-05 12:46:34,110 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:46:34,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:34,110 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:46:34,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:34,111 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:46:34,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:34,218 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:46:34,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:46:34,219 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:46:34,219 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:46:34,219 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:46:34,219 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:46:34,219 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:46:34,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:46:34,236 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 12:46:34,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:34,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-05 12:46:34,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:46:34,271 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:46:34,271 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:46:34,773 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:46:34,778 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:46:34,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2019-09-05 12:46:34,779 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:46:34,779 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-05 12:46:34,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-05 12:46:34,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2019-09-05 12:46:34,780 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 11 states. [2019-09-05 12:46:34,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:46:34,976 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2019-09-05 12:46:34,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-05 12:46:34,977 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2019-09-05 12:46:34,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:46:34,977 INFO L225 Difference]: With dead ends: 41 [2019-09-05 12:46:34,977 INFO L226 Difference]: Without dead ends: 41 [2019-09-05 12:46:34,978 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2019-09-05 12:46:34,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-09-05 12:46:34,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2019-09-05 12:46:34,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-09-05 12:46:34,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2019-09-05 12:46:34,981 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 24 [2019-09-05 12:46:34,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:46:34,982 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2019-09-05 12:46:34,982 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-05 12:46:34,982 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2019-09-05 12:46:34,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-05 12:46:34,983 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:46:34,983 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:46:34,983 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:46:34,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:46:34,983 INFO L82 PathProgramCache]: Analyzing trace with hash -1781526699, now seen corresponding path program 7 times [2019-09-05 12:46:34,984 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:46:34,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:34,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:46:34,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:34,985 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:46:34,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:35,085 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:46:35,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:46:35,086 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:46:35,086 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:46:35,086 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:46:35,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:46:35,086 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:46:35,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:46:35,096 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 12:46:35,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:35,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-05 12:46:35,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:46:35,139 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:46:35,139 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:46:35,472 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:46:35,475 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:46:35,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2019-09-05 12:46:35,475 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:46:35,475 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-05 12:46:35,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-05 12:46:35,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2019-09-05 12:46:35,476 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand 11 states. [2019-09-05 12:46:35,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:46:35,634 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2019-09-05 12:46:35,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-05 12:46:35,635 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2019-09-05 12:46:35,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:46:35,636 INFO L225 Difference]: With dead ends: 43 [2019-09-05 12:46:35,636 INFO L226 Difference]: Without dead ends: 43 [2019-09-05 12:46:35,636 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2019-09-05 12:46:35,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-09-05 12:46:35,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2019-09-05 12:46:35,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-09-05 12:46:35,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2019-09-05 12:46:35,639 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 24 [2019-09-05 12:46:35,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:46:35,640 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2019-09-05 12:46:35,640 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-05 12:46:35,640 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2019-09-05 12:46:35,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-05 12:46:35,641 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:46:35,641 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:46:35,641 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:46:35,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:46:35,641 INFO L82 PathProgramCache]: Analyzing trace with hash -81622240, now seen corresponding path program 8 times [2019-09-05 12:46:35,641 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:46:35,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:35,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:46:35,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:35,642 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:46:35,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:35,775 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:46:35,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:46:35,776 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:46:35,776 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:46:35,776 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:46:35,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:46:35,776 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:46:35,793 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:46:35,793 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 12:46:35,821 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-09-05 12:46:35,822 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:46:35,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-05 12:46:35,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:46:35,865 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:46:35,865 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:46:36,476 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:46:36,479 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:46:36,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2019-09-05 12:46:36,479 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:46:36,479 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-05 12:46:36,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-05 12:46:36,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2019-09-05 12:46:36,480 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand 12 states. [2019-09-05 12:46:36,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:46:36,672 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2019-09-05 12:46:36,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-05 12:46:36,672 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2019-09-05 12:46:36,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:46:36,673 INFO L225 Difference]: With dead ends: 45 [2019-09-05 12:46:36,673 INFO L226 Difference]: Without dead ends: 45 [2019-09-05 12:46:36,673 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2019-09-05 12:46:36,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-09-05 12:46:36,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2019-09-05 12:46:36,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-09-05 12:46:36,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2019-09-05 12:46:36,677 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 26 [2019-09-05 12:46:36,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:46:36,678 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2019-09-05 12:46:36,678 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-05 12:46:36,678 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2019-09-05 12:46:36,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-05 12:46:36,678 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:46:36,679 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:46:36,679 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:46:36,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:46:36,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1517583600, now seen corresponding path program 8 times [2019-09-05 12:46:36,679 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:46:36,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:36,680 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:46:36,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:36,680 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:46:36,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:36,811 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:46:36,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:46:36,812 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:46:36,812 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:46:36,812 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:46:36,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:46:36,812 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:46:36,825 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:46:36,825 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 12:46:36,915 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-09-05 12:46:36,915 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:46:36,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-05 12:46:36,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:46:36,940 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:46:36,940 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:46:37,672 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:46:37,680 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:46:37,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2019-09-05 12:46:37,680 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:46:37,680 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-05 12:46:37,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-05 12:46:37,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2019-09-05 12:46:37,681 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand 12 states. [2019-09-05 12:46:37,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:46:37,828 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2019-09-05 12:46:37,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-05 12:46:37,829 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2019-09-05 12:46:37,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:46:37,830 INFO L225 Difference]: With dead ends: 47 [2019-09-05 12:46:37,830 INFO L226 Difference]: Without dead ends: 47 [2019-09-05 12:46:37,831 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2019-09-05 12:46:37,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-09-05 12:46:37,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2019-09-05 12:46:37,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-09-05 12:46:37,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2019-09-05 12:46:37,836 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 26 [2019-09-05 12:46:37,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:46:37,836 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2019-09-05 12:46:37,836 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-05 12:46:37,836 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2019-09-05 12:46:37,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-05 12:46:37,837 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:46:37,837 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:46:37,837 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:46:37,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:46:37,837 INFO L82 PathProgramCache]: Analyzing trace with hash -54229283, now seen corresponding path program 9 times [2019-09-05 12:46:37,838 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:46:37,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:37,838 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:46:37,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:37,839 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:46:37,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:37,970 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:46:37,970 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:46:37,970 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:46:37,970 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:46:37,970 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:46:37,970 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:46:37,971 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:46:37,989 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:46:37,989 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 12:46:38,003 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:46:38,004 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:46:38,004 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-05 12:46:38,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:46:38,031 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:46:38,031 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:46:38,661 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:46:38,664 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:46:38,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2019-09-05 12:46:38,665 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:46:38,665 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-05 12:46:38,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-05 12:46:38,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2019-09-05 12:46:38,666 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand 13 states. [2019-09-05 12:46:38,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:46:38,883 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2019-09-05 12:46:38,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-05 12:46:38,883 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 28 [2019-09-05 12:46:38,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:46:38,884 INFO L225 Difference]: With dead ends: 49 [2019-09-05 12:46:38,884 INFO L226 Difference]: Without dead ends: 49 [2019-09-05 12:46:38,885 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2019-09-05 12:46:38,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-09-05 12:46:38,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2019-09-05 12:46:38,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-09-05 12:46:38,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2019-09-05 12:46:38,888 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 28 [2019-09-05 12:46:38,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:46:38,888 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2019-09-05 12:46:38,888 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-05 12:46:38,889 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2019-09-05 12:46:38,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-05 12:46:38,889 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:46:38,889 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:46:38,890 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:46:38,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:46:38,890 INFO L82 PathProgramCache]: Analyzing trace with hash -1271335925, now seen corresponding path program 9 times [2019-09-05 12:46:38,890 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:46:38,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:38,891 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:46:38,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:38,891 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:46:38,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:39,032 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:46:39,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:46:39,032 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:46:39,033 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:46:39,033 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:46:39,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:46:39,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 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 12:46:39,048 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:46:39,048 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:46:39,064 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:46:39,065 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:46:39,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-05 12:46:39,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:46:39,091 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:46:39,092 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:46:39,768 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:46:39,770 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:46:39,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2019-09-05 12:46:39,771 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:46:39,771 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-05 12:46:39,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-05 12:46:39,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2019-09-05 12:46:39,773 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand 13 states. [2019-09-05 12:46:39,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:46:39,967 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2019-09-05 12:46:39,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-05 12:46:39,969 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 28 [2019-09-05 12:46:39,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:46:39,970 INFO L225 Difference]: With dead ends: 51 [2019-09-05 12:46:39,970 INFO L226 Difference]: Without dead ends: 51 [2019-09-05 12:46:39,971 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2019-09-05 12:46:39,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-09-05 12:46:39,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2019-09-05 12:46:39,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-09-05 12:46:39,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 52 transitions. [2019-09-05 12:46:39,974 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 52 transitions. Word has length 28 [2019-09-05 12:46:39,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:46:39,974 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 52 transitions. [2019-09-05 12:46:39,974 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-05 12:46:39,974 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 52 transitions. [2019-09-05 12:46:39,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-05 12:46:39,975 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:46:39,975 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:46:39,975 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:46:39,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:46:39,976 INFO L82 PathProgramCache]: Analyzing trace with hash 500598618, now seen corresponding path program 10 times [2019-09-05 12:46:39,976 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:46:39,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:39,977 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:46:39,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:39,977 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:46:39,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:40,136 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:46:40,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:46:40,137 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:46:40,137 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:46:40,137 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:46:40,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:46:40,137 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:46:40,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:46:40,147 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 12:46:40,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:40,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-05 12:46:40,177 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:46:40,208 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:46:40,208 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:46:41,215 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:46:41,219 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:46:41,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2019-09-05 12:46:41,219 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:46:41,220 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-05 12:46:41,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-05 12:46:41,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2019-09-05 12:46:41,220 INFO L87 Difference]: Start difference. First operand 50 states and 52 transitions. Second operand 14 states. [2019-09-05 12:46:41,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:46:41,497 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2019-09-05 12:46:41,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-05 12:46:41,498 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 30 [2019-09-05 12:46:41,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:46:41,499 INFO L225 Difference]: With dead ends: 53 [2019-09-05 12:46:41,499 INFO L226 Difference]: Without dead ends: 53 [2019-09-05 12:46:41,500 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2019-09-05 12:46:41,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-09-05 12:46:41,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2019-09-05 12:46:41,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-09-05 12:46:41,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2019-09-05 12:46:41,503 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 30 [2019-09-05 12:46:41,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:46:41,504 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2019-09-05 12:46:41,504 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-05 12:46:41,504 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2019-09-05 12:46:41,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-05 12:46:41,505 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:46:41,505 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:46:41,505 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:46:41,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:46:41,505 INFO L82 PathProgramCache]: Analyzing trace with hash -850521530, now seen corresponding path program 10 times [2019-09-05 12:46:41,505 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:46:41,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:41,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:46:41,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:41,506 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:46:41,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:41,645 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:46:41,646 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:46:41,646 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:46:41,646 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:46:41,646 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:46:41,646 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:46:41,646 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:46:41,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:46:41,656 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 12:46:41,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:41,666 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-05 12:46:41,667 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:46:41,695 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:46:41,695 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:46:42,617 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:46:42,619 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:46:42,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2019-09-05 12:46:42,620 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:46:42,620 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-05 12:46:42,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-05 12:46:42,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2019-09-05 12:46:42,621 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand 14 states. [2019-09-05 12:46:42,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:46:42,850 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2019-09-05 12:46:42,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-05 12:46:42,850 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 30 [2019-09-05 12:46:42,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:46:42,850 INFO L225 Difference]: With dead ends: 55 [2019-09-05 12:46:42,851 INFO L226 Difference]: Without dead ends: 55 [2019-09-05 12:46:42,851 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2019-09-05 12:46:42,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-09-05 12:46:42,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2019-09-05 12:46:42,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-09-05 12:46:42,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2019-09-05 12:46:42,853 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 30 [2019-09-05 12:46:42,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:46:42,854 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2019-09-05 12:46:42,854 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-05 12:46:42,854 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2019-09-05 12:46:42,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-05 12:46:42,854 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:46:42,855 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:46:42,855 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:46:42,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:46:42,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1114266775, now seen corresponding path program 11 times [2019-09-05 12:46:42,855 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:46:42,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:42,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:46:42,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:42,856 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:46:42,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:43,036 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:46:43,037 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:46:43,037 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:46:43,037 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:46:43,037 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:46:43,037 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:46:43,037 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) [2019-09-05 12:46:43,056 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:46:43,056 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:46:43,144 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-09-05 12:46:43,145 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:46:43,146 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-05 12:46:43,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:46:43,192 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:46:43,192 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:46:44,352 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:46:44,356 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:46:44,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2019-09-05 12:46:44,356 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:46:44,356 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-05 12:46:44,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-05 12:46:44,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=483, Unknown=0, NotChecked=0, Total=702 [2019-09-05 12:46:44,357 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. Second operand 15 states. [2019-09-05 12:46:44,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:46:44,700 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2019-09-05 12:46:44,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-05 12:46:44,701 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 32 [2019-09-05 12:46:44,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:46:44,701 INFO L225 Difference]: With dead ends: 57 [2019-09-05 12:46:44,702 INFO L226 Difference]: Without dead ends: 57 [2019-09-05 12:46:44,702 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=219, Invalid=483, Unknown=0, NotChecked=0, Total=702 [2019-09-05 12:46:44,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-09-05 12:46:44,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2019-09-05 12:46:44,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-09-05 12:46:44,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2019-09-05 12:46:44,706 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 32 [2019-09-05 12:46:44,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:46:44,706 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2019-09-05 12:46:44,706 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-05 12:46:44,706 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2019-09-05 12:46:44,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-05 12:46:44,707 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:46:44,707 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:46:44,707 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:46:44,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:46:44,707 INFO L82 PathProgramCache]: Analyzing trace with hash -174813759, now seen corresponding path program 11 times [2019-09-05 12:46:44,708 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:46:44,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:44,708 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:46:44,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:44,709 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:46:44,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:44,908 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:46:44,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:46:44,908 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:46:44,909 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:46:44,909 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:46:44,909 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:46:44,909 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) [2019-09-05 12:46:44,926 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:46:44,926 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:46:45,066 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-09-05 12:46:45,067 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:46:45,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-05 12:46:45,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:46:45,107 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:46:45,108 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:46:46,486 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:46:46,488 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:46:46,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2019-09-05 12:46:46,489 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:46:46,489 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-05 12:46:46,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-05 12:46:46,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=483, Unknown=0, NotChecked=0, Total=702 [2019-09-05 12:46:46,490 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 15 states. [2019-09-05 12:46:46,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:46:46,749 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2019-09-05 12:46:46,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-05 12:46:46,749 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 32 [2019-09-05 12:46:46,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:46:46,750 INFO L225 Difference]: With dead ends: 59 [2019-09-05 12:46:46,750 INFO L226 Difference]: Without dead ends: 59 [2019-09-05 12:46:46,751 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=219, Invalid=483, Unknown=0, NotChecked=0, Total=702 [2019-09-05 12:46:46,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-09-05 12:46:46,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2019-09-05 12:46:46,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-09-05 12:46:46,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2019-09-05 12:46:46,754 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 32 [2019-09-05 12:46:46,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:46:46,755 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2019-09-05 12:46:46,755 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-05 12:46:46,755 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2019-09-05 12:46:46,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-05 12:46:46,755 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:46:46,755 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:46:46,755 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:46:46,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:46:46,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1856121196, now seen corresponding path program 12 times [2019-09-05 12:46:46,756 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:46:46,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:46,756 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:46:46,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:46,757 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:46:46,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:46,981 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:46:46,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:46:46,982 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:46:46,982 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:46:46,982 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:46:46,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:46:46,982 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:46:47,004 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:46:47,004 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 12:46:47,027 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:46:47,028 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:46:47,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-05 12:46:47,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:46:47,067 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:46:47,068 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:46:49,176 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:46:49,179 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:46:49,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2019-09-05 12:46:49,180 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:46:49,180 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-05 12:46:49,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-05 12:46:49,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=562, Unknown=0, NotChecked=0, Total=812 [2019-09-05 12:46:49,182 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 16 states. [2019-09-05 12:46:49,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:46:49,530 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2019-09-05 12:46:49,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-05 12:46:49,530 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 34 [2019-09-05 12:46:49,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:46:49,531 INFO L225 Difference]: With dead ends: 61 [2019-09-05 12:46:49,531 INFO L226 Difference]: Without dead ends: 61 [2019-09-05 12:46:49,532 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=250, Invalid=562, Unknown=0, NotChecked=0, Total=812 [2019-09-05 12:46:49,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-09-05 12:46:49,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2019-09-05 12:46:49,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-09-05 12:46:49,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2019-09-05 12:46:49,535 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 34 [2019-09-05 12:46:49,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:46:49,535 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2019-09-05 12:46:49,535 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-05 12:46:49,535 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2019-09-05 12:46:49,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-05 12:46:49,536 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:46:49,536 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:46:49,536 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:46:49,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:46:49,537 INFO L82 PathProgramCache]: Analyzing trace with hash 640292476, now seen corresponding path program 12 times [2019-09-05 12:46:49,537 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:46:49,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:49,538 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:46:49,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:49,538 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:46:49,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:49,754 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:46:49,754 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:46:49,755 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:46:49,755 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:46:49,755 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:46:49,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:46:49,755 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) [2019-09-05 12:46:49,771 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:46:49,771 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:46:49,787 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:46:49,787 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:46:49,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-05 12:46:49,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:46:49,819 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:46:49,819 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:46:51,164 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:46:51,166 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:46:51,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2019-09-05 12:46:51,167 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:46:51,167 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-05 12:46:51,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-05 12:46:51,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=562, Unknown=0, NotChecked=0, Total=812 [2019-09-05 12:46:51,168 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 16 states. [2019-09-05 12:46:51,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:46:51,468 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2019-09-05 12:46:51,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-05 12:46:51,469 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 34 [2019-09-05 12:46:51,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:46:51,470 INFO L225 Difference]: With dead ends: 63 [2019-09-05 12:46:51,470 INFO L226 Difference]: Without dead ends: 63 [2019-09-05 12:46:51,470 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=250, Invalid=562, Unknown=0, NotChecked=0, Total=812 [2019-09-05 12:46:51,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-09-05 12:46:51,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2019-09-05 12:46:51,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-09-05 12:46:51,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2019-09-05 12:46:51,473 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 34 [2019-09-05 12:46:51,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:46:51,473 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2019-09-05 12:46:51,473 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-05 12:46:51,473 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2019-09-05 12:46:51,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-05 12:46:51,474 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:46:51,474 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:46:51,474 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:46:51,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:46:51,475 INFO L82 PathProgramCache]: Analyzing trace with hash -245709487, now seen corresponding path program 13 times [2019-09-05 12:46:51,475 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:46:51,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:51,475 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:46:51,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:51,476 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:46:51,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:51,689 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:46:51,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:46:51,689 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:46:51,689 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:46:51,689 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:46:51,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:46:51,690 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 12:46:51,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:46:51,705 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:46:51,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:51,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-05 12:46:51,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:46:51,751 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:46:51,751 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:46:53,501 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:46:53,504 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:46:53,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2019-09-05 12:46:53,504 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:46:53,504 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-05 12:46:53,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-05 12:46:53,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=647, Unknown=0, NotChecked=0, Total=930 [2019-09-05 12:46:53,506 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand 17 states. [2019-09-05 12:46:53,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:46:53,918 INFO L93 Difference]: Finished difference Result 65 states and 67 transitions. [2019-09-05 12:46:53,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-05 12:46:53,919 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 36 [2019-09-05 12:46:53,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:46:53,920 INFO L225 Difference]: With dead ends: 65 [2019-09-05 12:46:53,920 INFO L226 Difference]: Without dead ends: 65 [2019-09-05 12:46:53,921 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=283, Invalid=647, Unknown=0, NotChecked=0, Total=930 [2019-09-05 12:46:53,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-09-05 12:46:53,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2019-09-05 12:46:53,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-09-05 12:46:53,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 66 transitions. [2019-09-05 12:46:53,924 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 66 transitions. Word has length 36 [2019-09-05 12:46:53,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:46:53,924 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 66 transitions. [2019-09-05 12:46:53,924 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-05 12:46:53,924 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 66 transitions. [2019-09-05 12:46:53,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-05 12:46:53,925 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:46:53,925 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:46:53,925 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:46:53,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:46:53,925 INFO L82 PathProgramCache]: Analyzing trace with hash -2021630857, now seen corresponding path program 13 times [2019-09-05 12:46:53,926 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:46:53,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:53,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:46:53,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:53,926 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:46:53,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:54,166 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:46:54,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:46:54,167 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:46:54,167 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:46:54,167 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:46:54,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:46:54,168 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:46:54,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:46:54,190 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 12:46:54,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:54,215 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-05 12:46:54,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:46:54,257 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:46:54,257 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:46:56,161 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:46:56,163 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:46:56,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2019-09-05 12:46:56,164 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:46:56,164 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-05 12:46:56,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-05 12:46:56,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=647, Unknown=0, NotChecked=0, Total=930 [2019-09-05 12:46:56,165 INFO L87 Difference]: Start difference. First operand 64 states and 66 transitions. Second operand 17 states. [2019-09-05 12:46:56,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:46:56,544 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2019-09-05 12:46:56,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-05 12:46:56,544 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 36 [2019-09-05 12:46:56,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:46:56,545 INFO L225 Difference]: With dead ends: 67 [2019-09-05 12:46:56,545 INFO L226 Difference]: Without dead ends: 67 [2019-09-05 12:46:56,546 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=283, Invalid=647, Unknown=0, NotChecked=0, Total=930 [2019-09-05 12:46:56,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-09-05 12:46:56,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2019-09-05 12:46:56,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-09-05 12:46:56,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 68 transitions. [2019-09-05 12:46:56,549 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 68 transitions. Word has length 36 [2019-09-05 12:46:56,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:46:56,549 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 68 transitions. [2019-09-05 12:46:56,549 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-05 12:46:56,549 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2019-09-05 12:46:56,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-05 12:46:56,550 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:46:56,550 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:46:56,550 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:46:56,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:46:56,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1171716302, now seen corresponding path program 14 times [2019-09-05 12:46:56,551 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:46:56,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:56,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:46:56,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:46:56,552 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:46:56,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:46:56,759 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:46:56,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:46:56,759 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:46:56,759 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:46:56,759 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:46:56,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:46:56,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 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:46:56,769 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:46:56,769 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 12:46:57,038 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-09-05 12:46:57,039 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:46:57,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-05 12:46:57,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:46:57,101 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:46:57,101 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:46:58,612 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-09-05 12:46:59,966 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-09-05 12:47:08,237 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (30)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 12:47:08,241 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:47:08,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 18] total 34 [2019-09-05 12:47:08,241 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:47:08,242 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-05 12:47:08,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-05 12:47:08,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=337, Invalid=784, Unknown=1, NotChecked=0, Total=1122 [2019-09-05 12:47:08,243 INFO L87 Difference]: Start difference. First operand 66 states and 68 transitions. Second operand 18 states. [2019-09-05 12:47:08,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:47:08,686 INFO L93 Difference]: Finished difference Result 69 states and 71 transitions. [2019-09-05 12:47:08,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-05 12:47:08,686 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 38 [2019-09-05 12:47:08,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:47:08,687 INFO L225 Difference]: With dead ends: 69 [2019-09-05 12:47:08,687 INFO L226 Difference]: Without dead ends: 69 [2019-09-05 12:47:08,688 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 58 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=337, Invalid=784, Unknown=1, NotChecked=0, Total=1122 [2019-09-05 12:47:08,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-09-05 12:47:08,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2019-09-05 12:47:08,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-09-05 12:47:08,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2019-09-05 12:47:08,691 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 70 transitions. Word has length 38 [2019-09-05 12:47:08,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:47:08,691 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 70 transitions. [2019-09-05 12:47:08,691 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-05 12:47:08,691 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2019-09-05 12:47:08,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-05 12:47:08,692 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:47:08,692 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:47:08,692 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:47:08,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:47:08,692 INFO L82 PathProgramCache]: Analyzing trace with hash -329445454, now seen corresponding path program 14 times [2019-09-05 12:47:08,692 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:47:08,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:47:08,693 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:47:08,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:47:08,693 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:47:08,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:47:08,928 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:47:08,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:47:08,928 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:47:08,928 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:47:08,929 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:47:08,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:47:08,929 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) [2019-09-05 12:47:08,950 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:47:08,950 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:47:10,846 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-09-05 12:47:10,846 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:47:10,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-05 12:47:10,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:47:10,900 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:47:10,901 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:47:13,002 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:47:13,007 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:47:13,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2019-09-05 12:47:13,007 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:47:13,007 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-05 12:47:13,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-05 12:47:13,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=318, Invalid=738, Unknown=0, NotChecked=0, Total=1056 [2019-09-05 12:47:13,008 INFO L87 Difference]: Start difference. First operand 68 states and 70 transitions. Second operand 18 states. [2019-09-05 12:47:13,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:47:13,404 INFO L93 Difference]: Finished difference Result 71 states and 73 transitions. [2019-09-05 12:47:13,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-05 12:47:13,405 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 38 [2019-09-05 12:47:13,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:47:13,406 INFO L225 Difference]: With dead ends: 71 [2019-09-05 12:47:13,406 INFO L226 Difference]: Without dead ends: 71 [2019-09-05 12:47:13,407 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=318, Invalid=738, Unknown=0, NotChecked=0, Total=1056 [2019-09-05 12:47:13,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-09-05 12:47:13,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2019-09-05 12:47:13,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-09-05 12:47:13,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2019-09-05 12:47:13,410 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 38 [2019-09-05 12:47:13,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:47:13,410 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2019-09-05 12:47:13,410 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-05 12:47:13,410 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2019-09-05 12:47:13,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-05 12:47:13,411 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:47:13,411 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:47:13,411 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:47:13,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:47:13,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1813266699, now seen corresponding path program 15 times [2019-09-05 12:47:13,411 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:47:13,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:47:13,413 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:47:13,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:47:13,413 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:47:13,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:47:13,671 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:47:13,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:47:13,672 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:47:13,672 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:47:13,672 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:47:13,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:47:13,672 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) [2019-09-05 12:47:13,687 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:47:13,687 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:47:13,705 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:47:13,705 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:47:13,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-05 12:47:13,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:47:13,737 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:47:13,737 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:47:16,025 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:47:16,028 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:47:16,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2019-09-05 12:47:16,028 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:47:16,029 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-05 12:47:16,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-05 12:47:16,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=355, Invalid=835, Unknown=0, NotChecked=0, Total=1190 [2019-09-05 12:47:16,030 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. Second operand 19 states. [2019-09-05 12:47:16,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:47:16,532 INFO L93 Difference]: Finished difference Result 73 states and 75 transitions. [2019-09-05 12:47:16,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-05 12:47:16,532 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 40 [2019-09-05 12:47:16,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:47:16,533 INFO L225 Difference]: With dead ends: 73 [2019-09-05 12:47:16,533 INFO L226 Difference]: Without dead ends: 73 [2019-09-05 12:47:16,534 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=355, Invalid=835, Unknown=0, NotChecked=0, Total=1190 [2019-09-05 12:47:16,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-09-05 12:47:16,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2019-09-05 12:47:16,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-09-05 12:47:16,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 74 transitions. [2019-09-05 12:47:16,537 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 74 transitions. Word has length 40 [2019-09-05 12:47:16,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:47:16,538 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 74 transitions. [2019-09-05 12:47:16,538 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-05 12:47:16,538 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 74 transitions. [2019-09-05 12:47:16,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-05 12:47:16,538 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:47:16,539 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:47:16,539 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:47:16,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:47:16,539 INFO L82 PathProgramCache]: Analyzing trace with hash -1931878355, now seen corresponding path program 15 times [2019-09-05 12:47:16,539 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:47:16,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:47:16,540 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:47:16,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:47:16,540 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:47:16,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:47:16,780 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:47:16,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:47:16,780 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:47:16,780 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:47:16,781 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:47:16,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:47:16,781 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) [2019-09-05 12:47:16,798 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:47:16,799 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:47:16,816 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:47:16,816 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:47:16,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-05 12:47:16,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:47:16,856 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:47:16,856 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:47:18,875 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:47:18,878 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:47:18,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2019-09-05 12:47:18,878 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:47:18,878 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-05 12:47:18,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-05 12:47:18,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=355, Invalid=835, Unknown=0, NotChecked=0, Total=1190 [2019-09-05 12:47:18,879 INFO L87 Difference]: Start difference. First operand 72 states and 74 transitions. Second operand 19 states. [2019-09-05 12:47:19,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:47:19,295 INFO L93 Difference]: Finished difference Result 75 states and 77 transitions. [2019-09-05 12:47:19,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-05 12:47:19,296 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 40 [2019-09-05 12:47:19,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:47:19,296 INFO L225 Difference]: With dead ends: 75 [2019-09-05 12:47:19,297 INFO L226 Difference]: Without dead ends: 75 [2019-09-05 12:47:19,297 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=355, Invalid=835, Unknown=0, NotChecked=0, Total=1190 [2019-09-05 12:47:19,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-09-05 12:47:19,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2019-09-05 12:47:19,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-09-05 12:47:19,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 76 transitions. [2019-09-05 12:47:19,300 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 76 transitions. Word has length 40 [2019-09-05 12:47:19,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:47:19,300 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 76 transitions. [2019-09-05 12:47:19,300 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-05 12:47:19,300 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 76 transitions. [2019-09-05 12:47:19,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-05 12:47:19,301 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:47:19,301 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:47:19,301 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:47:19,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:47:19,301 INFO L82 PathProgramCache]: Analyzing trace with hash -132092408, now seen corresponding path program 16 times [2019-09-05 12:47:19,301 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:47:19,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:47:19,302 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:47:19,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:47:19,302 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:47:19,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:47:19,533 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:47:19,533 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:47:19,533 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:47:19,533 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:47:19,534 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:47:19,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:47:19,534 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-05 12:47:19,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:47:19,544 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 12:47:19,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:47:19,562 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-05 12:47:19,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:47:19,593 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:47:19,593 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:47:22,257 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:47:22,260 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:47:22,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2019-09-05 12:47:22,260 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:47:22,261 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-05 12:47:22,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-05 12:47:22,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=394, Invalid=938, Unknown=0, NotChecked=0, Total=1332 [2019-09-05 12:47:22,262 INFO L87 Difference]: Start difference. First operand 74 states and 76 transitions. Second operand 20 states. [2019-09-05 12:47:22,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:47:22,843 INFO L93 Difference]: Finished difference Result 77 states and 79 transitions. [2019-09-05 12:47:22,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-05 12:47:22,844 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 42 [2019-09-05 12:47:22,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:47:22,844 INFO L225 Difference]: With dead ends: 77 [2019-09-05 12:47:22,845 INFO L226 Difference]: Without dead ends: 77 [2019-09-05 12:47:22,845 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 66 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=394, Invalid=938, Unknown=0, NotChecked=0, Total=1332 [2019-09-05 12:47:22,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-09-05 12:47:22,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2019-09-05 12:47:22,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-09-05 12:47:22,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 78 transitions. [2019-09-05 12:47:22,848 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 78 transitions. Word has length 42 [2019-09-05 12:47:22,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:47:22,849 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 78 transitions. [2019-09-05 12:47:22,849 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-05 12:47:22,849 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2019-09-05 12:47:22,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-05 12:47:22,849 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:47:22,849 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:47:22,850 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:47:22,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:47:22,850 INFO L82 PathProgramCache]: Analyzing trace with hash 23363048, now seen corresponding path program 16 times [2019-09-05 12:47:22,850 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:47:22,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:47:22,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:47:22,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:47:22,851 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:47:22,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:47:23,100 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:47:23,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:47:23,100 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:47:23,100 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:47:23,100 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:47:23,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:47:23,101 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-05 12:47:23,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:47:23,111 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 12:47:23,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:47:23,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-05 12:47:23,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:47:23,175 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:47:23,175 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:47:25,468 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:47:25,470 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:47:25,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2019-09-05 12:47:25,471 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:47:25,471 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-05 12:47:25,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-05 12:47:25,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=394, Invalid=938, Unknown=0, NotChecked=0, Total=1332 [2019-09-05 12:47:25,472 INFO L87 Difference]: Start difference. First operand 76 states and 78 transitions. Second operand 20 states. [2019-09-05 12:47:25,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:47:25,942 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2019-09-05 12:47:25,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-05 12:47:25,942 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 42 [2019-09-05 12:47:25,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:47:25,943 INFO L225 Difference]: With dead ends: 79 [2019-09-05 12:47:25,943 INFO L226 Difference]: Without dead ends: 79 [2019-09-05 12:47:25,944 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 66 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=394, Invalid=938, Unknown=0, NotChecked=0, Total=1332 [2019-09-05 12:47:25,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-09-05 12:47:25,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2019-09-05 12:47:25,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-09-05 12:47:25,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 80 transitions. [2019-09-05 12:47:25,947 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 80 transitions. Word has length 42 [2019-09-05 12:47:25,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:47:25,947 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 80 transitions. [2019-09-05 12:47:25,947 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-05 12:47:25,948 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2019-09-05 12:47:25,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-05 12:47:25,948 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:47:25,948 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:47:25,949 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:47:25,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:47:25,949 INFO L82 PathProgramCache]: Analyzing trace with hash -1311420475, now seen corresponding path program 17 times [2019-09-05 12:47:25,949 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:47:25,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:47:25,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:47:25,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:47:25,950 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:47:25,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:47:26,229 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:47:26,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:47:26,229 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:47:26,230 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:47:26,230 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:47:26,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:47:26,230 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-05 12:47:26,240 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:47:26,240 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 12:47:28,562 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-09-05 12:47:28,562 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:47:28,578 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-05 12:47:28,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:47:28,611 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:47:28,611 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:47:31,358 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:47:31,363 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:47:31,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2019-09-05 12:47:31,364 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:47:31,364 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-05 12:47:31,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-05 12:47:31,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=1047, Unknown=0, NotChecked=0, Total=1482 [2019-09-05 12:47:31,365 INFO L87 Difference]: Start difference. First operand 78 states and 80 transitions. Second operand 21 states. [2019-09-05 12:47:32,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:47:32,035 INFO L93 Difference]: Finished difference Result 81 states and 83 transitions. [2019-09-05 12:47:32,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-05 12:47:32,035 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 44 [2019-09-05 12:47:32,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:47:32,036 INFO L225 Difference]: With dead ends: 81 [2019-09-05 12:47:32,036 INFO L226 Difference]: Without dead ends: 81 [2019-09-05 12:47:32,037 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 69 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=435, Invalid=1047, Unknown=0, NotChecked=0, Total=1482 [2019-09-05 12:47:32,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-09-05 12:47:32,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2019-09-05 12:47:32,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-09-05 12:47:32,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 82 transitions. [2019-09-05 12:47:32,040 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 82 transitions. Word has length 44 [2019-09-05 12:47:32,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:47:32,043 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 82 transitions. [2019-09-05 12:47:32,043 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-05 12:47:32,044 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 82 transitions. [2019-09-05 12:47:32,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-05 12:47:32,044 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:47:32,044 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:47:32,045 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:47:32,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:47:32,045 INFO L82 PathProgramCache]: Analyzing trace with hash 2109642979, now seen corresponding path program 17 times [2019-09-05 12:47:32,045 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:47:32,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:47:32,046 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:47:32,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:47:32,046 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:47:32,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:47:32,303 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:47:32,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:47:32,303 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:47:32,303 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:47:32,304 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:47:32,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:47:32,304 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) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:47:32,313 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:47:32,314 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 12:47:35,517 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-09-05 12:47:35,517 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:47:35,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-05 12:47:35,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:47:35,592 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:47:35,592 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:47:39,173 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-09-05 12:47:50,063 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-09-05 12:47:55,172 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-09-05 12:47:55,180 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:47:55,184 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:47:55,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 21] total 40 [2019-09-05 12:47:55,184 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:47:55,184 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-05 12:47:55,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-05 12:47:55,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=457, Invalid=1099, Unknown=4, NotChecked=0, Total=1560 [2019-09-05 12:47:55,185 INFO L87 Difference]: Start difference. First operand 80 states and 82 transitions. Second operand 21 states. [2019-09-05 12:47:55,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:47:55,727 INFO L93 Difference]: Finished difference Result 83 states and 85 transitions. [2019-09-05 12:47:55,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-05 12:47:55,727 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 44 [2019-09-05 12:47:55,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:47:55,728 INFO L225 Difference]: With dead ends: 83 [2019-09-05 12:47:55,729 INFO L226 Difference]: Without dead ends: 83 [2019-09-05 12:47:55,730 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 65 SyntacticMatches, 5 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 19.8s TimeCoverageRelationStatistics Valid=457, Invalid=1099, Unknown=4, NotChecked=0, Total=1560 [2019-09-05 12:47:55,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-09-05 12:47:55,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2019-09-05 12:47:55,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-09-05 12:47:55,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 84 transitions. [2019-09-05 12:47:55,733 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 84 transitions. Word has length 44 [2019-09-05 12:47:55,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:47:55,733 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 84 transitions. [2019-09-05 12:47:55,733 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-05 12:47:55,734 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 84 transitions. [2019-09-05 12:47:55,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-05 12:47:55,734 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:47:55,734 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:47:55,734 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:47:55,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:47:55,735 INFO L82 PathProgramCache]: Analyzing trace with hash -774326718, now seen corresponding path program 18 times [2019-09-05 12:47:55,735 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:47:55,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:47:55,735 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:47:55,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:47:55,736 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:47:55,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:47:56,012 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:47:56,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:47:56,012 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:47:56,012 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:47:56,012 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:47:56,013 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:47:56,013 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-05 12:47:56,028 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:47:56,028 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 12:47:56,047 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:47:56,047 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:47:56,048 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-05 12:47:56,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:47:56,076 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:47:56,076 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:47:59,269 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:47:59,272 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:47:59,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2019-09-05 12:47:59,272 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:47:59,272 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-05 12:47:59,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-05 12:47:59,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=478, Invalid=1162, Unknown=0, NotChecked=0, Total=1640 [2019-09-05 12:47:59,273 INFO L87 Difference]: Start difference. First operand 82 states and 84 transitions. Second operand 22 states. [2019-09-05 12:47:59,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:47:59,964 INFO L93 Difference]: Finished difference Result 85 states and 87 transitions. [2019-09-05 12:47:59,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-05 12:47:59,965 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 46 [2019-09-05 12:47:59,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:47:59,966 INFO L225 Difference]: With dead ends: 85 [2019-09-05 12:47:59,966 INFO L226 Difference]: Without dead ends: 85 [2019-09-05 12:47:59,967 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 72 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=478, Invalid=1162, Unknown=0, NotChecked=0, Total=1640 [2019-09-05 12:47:59,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-09-05 12:47:59,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2019-09-05 12:47:59,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-09-05 12:47:59,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 86 transitions. [2019-09-05 12:47:59,970 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 86 transitions. Word has length 46 [2019-09-05 12:47:59,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:47:59,970 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 86 transitions. [2019-09-05 12:47:59,970 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-05 12:47:59,970 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2019-09-05 12:47:59,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-05 12:47:59,971 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:47:59,971 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:47:59,971 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:47:59,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:47:59,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1274929438, now seen corresponding path program 18 times [2019-09-05 12:47:59,972 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:47:59,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:47:59,972 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:47:59,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:47:59,972 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:47:59,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:48:00,261 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:48:00,261 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:48:00,261 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:48:00,261 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:48:00,262 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:48:00,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:48:00,262 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-05 12:48:00,273 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:48:00,274 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 12:48:00,286 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:48:00,286 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:48:00,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-05 12:48:00,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:48:00,335 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:48:00,336 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:48:03,357 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:48:03,359 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:48:03,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2019-09-05 12:48:03,359 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:48:03,360 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-05 12:48:03,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-05 12:48:03,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=478, Invalid=1162, Unknown=0, NotChecked=0, Total=1640 [2019-09-05 12:48:03,361 INFO L87 Difference]: Start difference. First operand 84 states and 86 transitions. Second operand 22 states. [2019-09-05 12:48:03,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:48:03,980 INFO L93 Difference]: Finished difference Result 87 states and 89 transitions. [2019-09-05 12:48:03,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-05 12:48:03,981 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 46 [2019-09-05 12:48:03,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:48:03,982 INFO L225 Difference]: With dead ends: 87 [2019-09-05 12:48:03,983 INFO L226 Difference]: Without dead ends: 87 [2019-09-05 12:48:03,984 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 72 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=478, Invalid=1162, Unknown=0, NotChecked=0, Total=1640 [2019-09-05 12:48:03,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-09-05 12:48:03,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2019-09-05 12:48:03,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-09-05 12:48:03,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 88 transitions. [2019-09-05 12:48:03,986 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 88 transitions. Word has length 46 [2019-09-05 12:48:03,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:48:03,986 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 88 transitions. [2019-09-05 12:48:03,986 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-05 12:48:03,986 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 88 transitions. [2019-09-05 12:48:03,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-05 12:48:03,987 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:48:03,987 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:48:03,987 INFO L418 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:48:03,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:48:03,988 INFO L82 PathProgramCache]: Analyzing trace with hash -23301761, now seen corresponding path program 19 times [2019-09-05 12:48:03,988 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:48:03,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:48:03,989 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:48:03,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:48:03,989 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:48:03,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:48:04,400 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:48:04,400 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:48:04,400 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:48:04,401 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:48:04,401 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:48:04,401 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:48:04,401 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 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 12:48:04,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:48:04,421 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:48:04,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:48:04,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-05 12:48:04,444 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:48:04,491 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:48:04,492 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:48:07,990 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:48:07,992 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:48:07,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2019-09-05 12:48:07,992 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:48:07,993 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-05 12:48:07,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-05 12:48:07,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=523, Invalid=1283, Unknown=0, NotChecked=0, Total=1806 [2019-09-05 12:48:07,994 INFO L87 Difference]: Start difference. First operand 86 states and 88 transitions. Second operand 23 states. [2019-09-05 12:48:08,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:48:08,775 INFO L93 Difference]: Finished difference Result 89 states and 91 transitions. [2019-09-05 12:48:08,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-05 12:48:08,776 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 48 [2019-09-05 12:48:08,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:48:08,777 INFO L225 Difference]: With dead ends: 89 [2019-09-05 12:48:08,777 INFO L226 Difference]: Without dead ends: 89 [2019-09-05 12:48:08,778 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 75 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=523, Invalid=1283, Unknown=0, NotChecked=0, Total=1806 [2019-09-05 12:48:08,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-09-05 12:48:08,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2019-09-05 12:48:08,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-09-05 12:48:08,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 90 transitions. [2019-09-05 12:48:08,781 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 90 transitions. Word has length 48 [2019-09-05 12:48:08,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:48:08,781 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 90 transitions. [2019-09-05 12:48:08,781 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-05 12:48:08,781 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 90 transitions. [2019-09-05 12:48:08,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-05 12:48:08,782 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:48:08,782 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:48:08,782 INFO L418 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:48:08,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:48:08,783 INFO L82 PathProgramCache]: Analyzing trace with hash -2020866407, now seen corresponding path program 19 times [2019-09-05 12:48:08,783 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:48:08,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:48:08,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:48:08,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:48:08,784 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:48:08,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:48:09,102 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:48:09,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:48:09,103 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:48:09,103 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:48:09,103 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:48:09,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:48:09,103 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 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:48:09,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:48:09,114 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 12:48:09,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:48:09,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-05 12:48:09,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:48:09,161 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:48:09,162 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:48:12,293 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:48:12,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:48:12,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2019-09-05 12:48:12,296 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:48:12,296 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-05 12:48:12,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-05 12:48:12,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=523, Invalid=1283, Unknown=0, NotChecked=0, Total=1806 [2019-09-05 12:48:12,298 INFO L87 Difference]: Start difference. First operand 88 states and 90 transitions. Second operand 23 states. [2019-09-05 12:48:12,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:48:12,945 INFO L93 Difference]: Finished difference Result 91 states and 93 transitions. [2019-09-05 12:48:12,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-05 12:48:12,946 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 48 [2019-09-05 12:48:12,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:48:12,947 INFO L225 Difference]: With dead ends: 91 [2019-09-05 12:48:12,947 INFO L226 Difference]: Without dead ends: 91 [2019-09-05 12:48:12,947 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 75 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=523, Invalid=1283, Unknown=0, NotChecked=0, Total=1806 [2019-09-05 12:48:12,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-09-05 12:48:12,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2019-09-05 12:48:12,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-09-05 12:48:12,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 92 transitions. [2019-09-05 12:48:12,949 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 92 transitions. Word has length 48 [2019-09-05 12:48:12,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:48:12,949 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 92 transitions. [2019-09-05 12:48:12,950 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-05 12:48:12,950 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 92 transitions. [2019-09-05 12:48:12,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-05 12:48:12,950 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:48:12,950 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:48:12,951 INFO L418 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:48:12,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:48:12,951 INFO L82 PathProgramCache]: Analyzing trace with hash 157176188, now seen corresponding path program 20 times [2019-09-05 12:48:12,951 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:48:12,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:48:12,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:48:12,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:48:12,952 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:48:12,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:48:13,272 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:48:13,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:48:13,272 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:48:13,273 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:48:13,273 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:48:13,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:48:13,273 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 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:48:13,283 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:48:13,283 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 12:48:13,915 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2019-09-05 12:48:13,915 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:48:13,918 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 45 conjunts are in the unsatisfiable core [2019-09-05 12:48:13,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:48:13,989 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:48:13,989 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:48:27,027 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-09-05 12:48:36,408 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:48:36,412 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:48:36,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 24] total 46 [2019-09-05 12:48:36,413 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:48:36,413 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-05 12:48:36,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-05 12:48:36,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=1473, Unknown=2, NotChecked=0, Total=2070 [2019-09-05 12:48:36,414 INFO L87 Difference]: Start difference. First operand 90 states and 92 transitions. Second operand 24 states. [2019-09-05 12:48:37,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:48:37,307 INFO L93 Difference]: Finished difference Result 93 states and 95 transitions. [2019-09-05 12:48:37,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-05 12:48:37,308 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 50 [2019-09-05 12:48:37,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:48:37,309 INFO L225 Difference]: With dead ends: 93 [2019-09-05 12:48:37,309 INFO L226 Difference]: Without dead ends: 93 [2019-09-05 12:48:37,310 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 74 SyntacticMatches, 5 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 22.7s TimeCoverageRelationStatistics Valid=595, Invalid=1473, Unknown=2, NotChecked=0, Total=2070 [2019-09-05 12:48:37,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-09-05 12:48:37,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2019-09-05 12:48:37,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-09-05 12:48:37,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 94 transitions. [2019-09-05 12:48:37,313 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 94 transitions. Word has length 50 [2019-09-05 12:48:37,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:48:37,313 INFO L475 AbstractCegarLoop]: Abstraction has 92 states and 94 transitions. [2019-09-05 12:48:37,313 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-05 12:48:37,313 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 94 transitions. [2019-09-05 12:48:37,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-05 12:48:37,314 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:48:37,314 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:48:37,314 INFO L418 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:48:37,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:48:37,314 INFO L82 PathProgramCache]: Analyzing trace with hash 405190996, now seen corresponding path program 20 times [2019-09-05 12:48:37,314 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:48:37,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:48:37,315 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:48:37,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:48:37,315 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:48:37,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:48:37,633 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:48:37,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:48:37,633 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:48:37,634 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:48:37,634 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:48:37,634 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:48:37,634 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 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:48:37,644 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:48:37,644 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 12:48:53,506 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2019-09-05 12:48:53,506 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:48:53,831 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 43 conjunts are in the unsatisfiable core [2019-09-05 12:48:53,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:48:53,860 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:48:53,860 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:48:57,369 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:48:57,374 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:48:57,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2019-09-05 12:48:57,375 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:48:57,375 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-05 12:48:57,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-05 12:48:57,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=570, Invalid=1410, Unknown=0, NotChecked=0, Total=1980 [2019-09-05 12:48:57,376 INFO L87 Difference]: Start difference. First operand 92 states and 94 transitions. Second operand 24 states. [2019-09-05 12:48:58,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:48:58,108 INFO L93 Difference]: Finished difference Result 95 states and 97 transitions. [2019-09-05 12:48:58,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-05 12:48:58,108 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 50 [2019-09-05 12:48:58,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:48:58,109 INFO L225 Difference]: With dead ends: 95 [2019-09-05 12:48:58,110 INFO L226 Difference]: Without dead ends: 95 [2019-09-05 12:48:58,110 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 78 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=570, Invalid=1410, Unknown=0, NotChecked=0, Total=1980 [2019-09-05 12:48:58,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-09-05 12:48:58,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2019-09-05 12:48:58,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-09-05 12:48:58,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 96 transitions. [2019-09-05 12:48:58,114 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 96 transitions. Word has length 50 [2019-09-05 12:48:58,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:48:58,114 INFO L475 AbstractCegarLoop]: Abstraction has 94 states and 96 transitions. [2019-09-05 12:48:58,114 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-05 12:48:58,114 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 96 transitions. [2019-09-05 12:48:58,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-05 12:48:58,115 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:48:58,115 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:48:58,115 INFO L418 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:48:58,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:48:58,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1797793337, now seen corresponding path program 21 times [2019-09-05 12:48:58,116 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:48:58,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:48:58,116 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:48:58,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:48:58,116 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:48:58,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:48:58,484 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:48:58,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:48:58,484 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:48:58,484 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:48:58,484 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:48:58,485 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:48:58,485 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 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:48:58,496 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:48:58,496 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 12:48:58,518 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:48:58,519 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:48:58,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 45 conjunts are in the unsatisfiable core [2019-09-05 12:48:58,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:48:58,564 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:48:58,565 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:49:02,601 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:49:02,604 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:49:02,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2019-09-05 12:49:02,605 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:49:02,605 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-05 12:49:02,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-05 12:49:02,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=619, Invalid=1543, Unknown=0, NotChecked=0, Total=2162 [2019-09-05 12:49:02,606 INFO L87 Difference]: Start difference. First operand 94 states and 96 transitions. Second operand 25 states. [2019-09-05 12:49:03,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:49:03,537 INFO L93 Difference]: Finished difference Result 97 states and 99 transitions. [2019-09-05 12:49:03,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-05 12:49:03,538 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 52 [2019-09-05 12:49:03,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:49:03,539 INFO L225 Difference]: With dead ends: 97 [2019-09-05 12:49:03,539 INFO L226 Difference]: Without dead ends: 97 [2019-09-05 12:49:03,539 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 81 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=619, Invalid=1543, Unknown=0, NotChecked=0, Total=2162 [2019-09-05 12:49:03,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-09-05 12:49:03,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2019-09-05 12:49:03,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-09-05 12:49:03,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 98 transitions. [2019-09-05 12:49:03,543 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 98 transitions. Word has length 52 [2019-09-05 12:49:03,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:49:03,543 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 98 transitions. [2019-09-05 12:49:03,543 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-05 12:49:03,543 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 98 transitions. [2019-09-05 12:49:03,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-05 12:49:03,544 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:49:03,544 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:49:03,544 INFO L418 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:49:03,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:49:03,545 INFO L82 PathProgramCache]: Analyzing trace with hash -320886449, now seen corresponding path program 21 times [2019-09-05 12:49:03,545 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:49:03,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:49:03,546 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:49:03,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:49:03,546 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:49:03,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:49:03,903 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:49:03,904 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:49:03,904 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:49:03,904 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:49:03,904 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:49:03,904 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:49:03,904 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 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:49:03,914 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:49:03,914 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 12:49:03,932 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:49:03,932 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:49:03,933 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 45 conjunts are in the unsatisfiable core [2019-09-05 12:49:03,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:49:03,971 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:49:03,971 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:49:08,148 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:49:08,150 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:49:08,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2019-09-05 12:49:08,151 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:49:08,151 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-05 12:49:08,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-05 12:49:08,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=619, Invalid=1543, Unknown=0, NotChecked=0, Total=2162 [2019-09-05 12:49:08,152 INFO L87 Difference]: Start difference. First operand 96 states and 98 transitions. Second operand 25 states. [2019-09-05 12:49:08,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:49:08,937 INFO L93 Difference]: Finished difference Result 99 states and 101 transitions. [2019-09-05 12:49:08,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-05 12:49:08,937 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 52 [2019-09-05 12:49:08,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:49:08,938 INFO L225 Difference]: With dead ends: 99 [2019-09-05 12:49:08,939 INFO L226 Difference]: Without dead ends: 99 [2019-09-05 12:49:08,939 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 81 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=619, Invalid=1543, Unknown=0, NotChecked=0, Total=2162 [2019-09-05 12:49:08,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-09-05 12:49:08,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2019-09-05 12:49:08,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-09-05 12:49:08,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 100 transitions. [2019-09-05 12:49:08,942 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 100 transitions. Word has length 52 [2019-09-05 12:49:08,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:49:08,943 INFO L475 AbstractCegarLoop]: Abstraction has 98 states and 100 transitions. [2019-09-05 12:49:08,943 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-05 12:49:08,943 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 100 transitions. [2019-09-05 12:49:08,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-05 12:49:08,943 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:49:08,943 INFO L399 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:49:08,943 INFO L418 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:49:08,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:49:08,944 INFO L82 PathProgramCache]: Analyzing trace with hash -2117091402, now seen corresponding path program 22 times [2019-09-05 12:49:08,944 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:49:08,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:49:08,944 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:49:08,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:49:08,944 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:49:08,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:49:09,316 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:49:09,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:49:09,316 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:49:09,316 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:49:09,317 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:49:09,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:49:09,317 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 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:49:09,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:49:09,327 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 12:49:09,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:49:09,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 47 conjunts are in the unsatisfiable core [2019-09-05 12:49:09,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:49:09,391 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:49:09,391 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:49:13,997 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:49:14,000 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:49:14,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2019-09-05 12:49:14,000 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:49:14,001 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-05 12:49:14,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-05 12:49:14,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=670, Invalid=1682, Unknown=0, NotChecked=0, Total=2352 [2019-09-05 12:49:14,002 INFO L87 Difference]: Start difference. First operand 98 states and 100 transitions. Second operand 26 states. [2019-09-05 12:49:15,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:49:15,057 INFO L93 Difference]: Finished difference Result 101 states and 103 transitions. [2019-09-05 12:49:15,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-05 12:49:15,057 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 54 [2019-09-05 12:49:15,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:49:15,058 INFO L225 Difference]: With dead ends: 101 [2019-09-05 12:49:15,059 INFO L226 Difference]: Without dead ends: 101 [2019-09-05 12:49:15,059 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 84 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=670, Invalid=1682, Unknown=0, NotChecked=0, Total=2352 [2019-09-05 12:49:15,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-09-05 12:49:15,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2019-09-05 12:49:15,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-09-05 12:49:15,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 102 transitions. [2019-09-05 12:49:15,062 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 102 transitions. Word has length 54 [2019-09-05 12:49:15,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:49:15,062 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 102 transitions. [2019-09-05 12:49:15,062 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-05 12:49:15,062 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 102 transitions. [2019-09-05 12:49:15,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-05 12:49:15,063 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:49:15,063 INFO L399 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:49:15,063 INFO L418 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:49:15,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:49:15,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1998358154, now seen corresponding path program 22 times [2019-09-05 12:49:15,064 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:49:15,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:49:15,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:49:15,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:49:15,065 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:49:15,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:49:15,440 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:49:15,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:49:15,441 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:49:15,441 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:49:15,441 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:49:15,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:49:15,441 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 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:49:15,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:49:15,450 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 12:49:15,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:49:15,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 47 conjunts are in the unsatisfiable core [2019-09-05 12:49:15,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:49:15,498 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:49:15,498 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:49:19,492 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:49:19,495 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:49:19,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2019-09-05 12:49:19,495 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:49:19,495 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-05 12:49:19,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-05 12:49:19,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=670, Invalid=1682, Unknown=0, NotChecked=0, Total=2352 [2019-09-05 12:49:19,496 INFO L87 Difference]: Start difference. First operand 100 states and 102 transitions. Second operand 26 states. [2019-09-05 12:49:20,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:49:20,359 INFO L93 Difference]: Finished difference Result 103 states and 105 transitions. [2019-09-05 12:49:20,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-05 12:49:20,360 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 54 [2019-09-05 12:49:20,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:49:20,361 INFO L225 Difference]: With dead ends: 103 [2019-09-05 12:49:20,361 INFO L226 Difference]: Without dead ends: 103 [2019-09-05 12:49:20,361 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 84 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=670, Invalid=1682, Unknown=0, NotChecked=0, Total=2352 [2019-09-05 12:49:20,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-09-05 12:49:20,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2019-09-05 12:49:20,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-09-05 12:49:20,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 104 transitions. [2019-09-05 12:49:20,365 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 104 transitions. Word has length 54 [2019-09-05 12:49:20,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:49:20,366 INFO L475 AbstractCegarLoop]: Abstraction has 102 states and 104 transitions. [2019-09-05 12:49:20,366 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-05 12:49:20,366 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 104 transitions. [2019-09-05 12:49:20,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-05 12:49:20,366 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:49:20,366 INFO L399 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:49:20,367 INFO L418 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:49:20,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:49:20,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1929974285, now seen corresponding path program 23 times [2019-09-05 12:49:20,367 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:49:20,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:49:20,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:49:20,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:49:20,368 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:49:20,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:49:20,808 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:49:20,809 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:49:20,809 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:49:20,809 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:49:20,809 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:49:20,809 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:49:20,809 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 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:49:20,820 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:49:20,820 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 12:49:28,980 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-09-05 12:49:28,981 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:49:29,760 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 49 conjunts are in the unsatisfiable core [2019-09-05 12:49:29,761 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:49:29,828 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:49:29,828 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:49:34,876 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:49:34,881 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:49:34,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2019-09-05 12:49:34,881 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:49:34,881 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-05 12:49:34,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-05 12:49:34,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=723, Invalid=1827, Unknown=0, NotChecked=0, Total=2550 [2019-09-05 12:49:34,882 INFO L87 Difference]: Start difference. First operand 102 states and 104 transitions. Second operand 27 states. [2019-09-05 12:49:36,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:49:36,025 INFO L93 Difference]: Finished difference Result 105 states and 107 transitions. [2019-09-05 12:49:36,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-05 12:49:36,025 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 56 [2019-09-05 12:49:36,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:49:36,026 INFO L225 Difference]: With dead ends: 105 [2019-09-05 12:49:36,026 INFO L226 Difference]: Without dead ends: 105 [2019-09-05 12:49:36,027 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 87 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=723, Invalid=1827, Unknown=0, NotChecked=0, Total=2550 [2019-09-05 12:49:36,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-09-05 12:49:36,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2019-09-05 12:49:36,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-09-05 12:49:36,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 106 transitions. [2019-09-05 12:49:36,029 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 106 transitions. Word has length 56 [2019-09-05 12:49:36,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:49:36,030 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 106 transitions. [2019-09-05 12:49:36,030 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-05 12:49:36,030 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 106 transitions. [2019-09-05 12:49:36,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-05 12:49:36,031 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:49:36,031 INFO L399 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:49:36,031 INFO L418 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:49:36,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:49:36,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1704395013, now seen corresponding path program 23 times [2019-09-05 12:49:36,032 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:49:36,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:49:36,035 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:49:36,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:49:36,035 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:49:36,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:49:36,424 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:49:36,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:49:36,424 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:49:36,424 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:49:36,425 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:49:36,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:49:36,425 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 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:49:36,436 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:49:36,437 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 12:50:12,970 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-09-05 12:50:12,970 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:50:12,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 49 conjunts are in the unsatisfiable core [2019-09-05 12:50:12,980 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:50:13,012 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:50:13,013 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:50:17,525 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:50:17,531 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:50:17,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2019-09-05 12:50:17,531 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:50:17,531 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-05 12:50:17,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-05 12:50:17,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=723, Invalid=1827, Unknown=0, NotChecked=0, Total=2550 [2019-09-05 12:50:17,532 INFO L87 Difference]: Start difference. First operand 104 states and 106 transitions. Second operand 27 states. [2019-09-05 12:50:18,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:50:18,476 INFO L93 Difference]: Finished difference Result 107 states and 109 transitions. [2019-09-05 12:50:18,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-05 12:50:18,477 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 56 [2019-09-05 12:50:18,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:50:18,478 INFO L225 Difference]: With dead ends: 107 [2019-09-05 12:50:18,478 INFO L226 Difference]: Without dead ends: 107 [2019-09-05 12:50:18,478 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 87 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=723, Invalid=1827, Unknown=0, NotChecked=0, Total=2550 [2019-09-05 12:50:18,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-09-05 12:50:18,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2019-09-05 12:50:18,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-09-05 12:50:18,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 108 transitions. [2019-09-05 12:50:18,481 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 108 transitions. Word has length 56 [2019-09-05 12:50:18,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:50:18,481 INFO L475 AbstractCegarLoop]: Abstraction has 106 states and 108 transitions. [2019-09-05 12:50:18,481 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-05 12:50:18,482 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 108 transitions. [2019-09-05 12:50:18,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-05 12:50:18,482 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:50:18,482 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:50:18,483 INFO L418 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:50:18,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:50:18,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1795916016, now seen corresponding path program 24 times [2019-09-05 12:50:18,483 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:50:18,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:50:18,484 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:50:18,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:50:18,484 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:50:18,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:50:18,981 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:50:18,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:50:18,981 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:50:18,981 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:50:18,982 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:50:18,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:50:18,982 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 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 12:50:18,998 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:50:18,999 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:50:19,024 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:50:19,024 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:50:19,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 51 conjunts are in the unsatisfiable core [2019-09-05 12:50:19,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:50:19,068 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:50:19,069 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:50:24,543 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:50:24,546 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:50:24,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2019-09-05 12:50:24,546 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:50:24,546 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-05 12:50:24,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-05 12:50:24,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=778, Invalid=1978, Unknown=0, NotChecked=0, Total=2756 [2019-09-05 12:50:24,547 INFO L87 Difference]: Start difference. First operand 106 states and 108 transitions. Second operand 28 states. [2019-09-05 12:50:25,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:50:25,785 INFO L93 Difference]: Finished difference Result 109 states and 111 transitions. [2019-09-05 12:50:25,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-05 12:50:25,786 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 58 [2019-09-05 12:50:25,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:50:25,787 INFO L225 Difference]: With dead ends: 109 [2019-09-05 12:50:25,787 INFO L226 Difference]: Without dead ends: 109 [2019-09-05 12:50:25,788 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 90 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=778, Invalid=1978, Unknown=0, NotChecked=0, Total=2756 [2019-09-05 12:50:25,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-09-05 12:50:25,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2019-09-05 12:50:25,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-09-05 12:50:25,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 110 transitions. [2019-09-05 12:50:25,791 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 110 transitions. Word has length 58 [2019-09-05 12:50:25,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:50:25,791 INFO L475 AbstractCegarLoop]: Abstraction has 108 states and 110 transitions. [2019-09-05 12:50:25,792 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-05 12:50:25,792 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 110 transitions. [2019-09-05 12:50:25,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-05 12:50:25,792 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:50:25,792 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:50:25,793 INFO L418 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:50:25,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:50:25,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1621309248, now seen corresponding path program 24 times [2019-09-05 12:50:25,793 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:50:25,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:50:25,794 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:50:25,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:50:25,794 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:50:25,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:50:26,309 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:50:26,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:50:26,310 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:50:26,310 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:50:26,310 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:50:26,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:50:26,310 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 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:50:26,320 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:50:26,320 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 12:50:26,337 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:50:26,337 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:50:26,338 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 51 conjunts are in the unsatisfiable core [2019-09-05 12:50:26,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:50:26,374 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:50:26,374 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:50:31,679 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:50:31,682 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:50:31,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2019-09-05 12:50:31,682 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:50:31,682 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-05 12:50:31,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-05 12:50:31,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=778, Invalid=1978, Unknown=0, NotChecked=0, Total=2756 [2019-09-05 12:50:31,683 INFO L87 Difference]: Start difference. First operand 108 states and 110 transitions. Second operand 28 states. [2019-09-05 12:50:32,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:50:32,709 INFO L93 Difference]: Finished difference Result 111 states and 113 transitions. [2019-09-05 12:50:32,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-05 12:50:32,709 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 58 [2019-09-05 12:50:32,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:50:32,710 INFO L225 Difference]: With dead ends: 111 [2019-09-05 12:50:32,711 INFO L226 Difference]: Without dead ends: 111 [2019-09-05 12:50:32,711 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 90 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=778, Invalid=1978, Unknown=0, NotChecked=0, Total=2756 [2019-09-05 12:50:32,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-09-05 12:50:32,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2019-09-05 12:50:32,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-09-05 12:50:32,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 112 transitions. [2019-09-05 12:50:32,715 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 112 transitions. Word has length 58 [2019-09-05 12:50:32,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:50:32,715 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 112 transitions. [2019-09-05 12:50:32,715 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-05 12:50:32,715 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 112 transitions. [2019-09-05 12:50:32,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-05 12:50:32,716 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:50:32,716 INFO L399 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:50:32,716 INFO L418 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:50:32,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:50:32,716 INFO L82 PathProgramCache]: Analyzing trace with hash 373770413, now seen corresponding path program 25 times [2019-09-05 12:50:32,717 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:50:32,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:50:32,717 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:50:32,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:50:32,717 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:50:32,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:50:33,139 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:50:33,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:50:33,139 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:50:33,139 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:50:33,140 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:50:33,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:50:33,140 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 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:50:33,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:50:33,149 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 12:50:33,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:50:33,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 53 conjunts are in the unsatisfiable core [2019-09-05 12:50:33,177 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:50:33,219 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:50:33,219 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:50:39,028 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:50:39,030 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:50:39,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 55 [2019-09-05 12:50:39,031 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:50:39,031 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-05 12:50:39,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-05 12:50:39,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=835, Invalid=2135, Unknown=0, NotChecked=0, Total=2970 [2019-09-05 12:50:39,032 INFO L87 Difference]: Start difference. First operand 110 states and 112 transitions. Second operand 29 states. [2019-09-05 12:50:40,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:50:40,377 INFO L93 Difference]: Finished difference Result 113 states and 115 transitions. [2019-09-05 12:50:40,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-05 12:50:40,378 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 60 [2019-09-05 12:50:40,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:50:40,379 INFO L225 Difference]: With dead ends: 113 [2019-09-05 12:50:40,379 INFO L226 Difference]: Without dead ends: 113 [2019-09-05 12:50:40,380 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 93 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=835, Invalid=2135, Unknown=0, NotChecked=0, Total=2970 [2019-09-05 12:50:40,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-09-05 12:50:40,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2019-09-05 12:50:40,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-09-05 12:50:40,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 114 transitions. [2019-09-05 12:50:40,382 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 114 transitions. Word has length 60 [2019-09-05 12:50:40,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:50:40,382 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 114 transitions. [2019-09-05 12:50:40,382 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-05 12:50:40,383 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 114 transitions. [2019-09-05 12:50:40,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-05 12:50:40,383 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:50:40,383 INFO L399 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:50:40,383 INFO L418 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:50:40,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:50:40,383 INFO L82 PathProgramCache]: Analyzing trace with hash 2127531451, now seen corresponding path program 25 times [2019-09-05 12:50:40,384 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:50:40,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:50:40,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:50:40,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:50:40,384 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:50:40,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:50:40,819 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:50:40,819 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:50:40,819 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:50:40,819 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:50:40,819 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:50:40,820 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:50:40,820 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 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:50:40,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:50:40,830 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 12:50:40,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:50:40,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 53 conjunts are in the unsatisfiable core [2019-09-05 12:50:40,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:50:40,917 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:50:40,918 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:50:46,183 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (53)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 12:50:46,186 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:50:46,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 55 [2019-09-05 12:50:46,187 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:50:46,187 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-05 12:50:46,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-05 12:50:46,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=833, Invalid=2137, Unknown=0, NotChecked=0, Total=2970 [2019-09-05 12:50:46,188 INFO L87 Difference]: Start difference. First operand 112 states and 114 transitions. Second operand 29 states. [2019-09-05 12:50:47,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:50:47,282 INFO L93 Difference]: Finished difference Result 115 states and 117 transitions. [2019-09-05 12:50:47,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-05 12:50:47,284 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 60 [2019-09-05 12:50:47,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:50:47,285 INFO L225 Difference]: With dead ends: 115 [2019-09-05 12:50:47,285 INFO L226 Difference]: Without dead ends: 115 [2019-09-05 12:50:47,285 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 93 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=833, Invalid=2137, Unknown=0, NotChecked=0, Total=2970 [2019-09-05 12:50:47,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-09-05 12:50:47,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2019-09-05 12:50:47,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-09-05 12:50:47,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 116 transitions. [2019-09-05 12:50:47,287 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 116 transitions. Word has length 60 [2019-09-05 12:50:47,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:50:47,288 INFO L475 AbstractCegarLoop]: Abstraction has 114 states and 116 transitions. [2019-09-05 12:50:47,288 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-05 12:50:47,288 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 116 transitions. [2019-09-05 12:50:47,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-05 12:50:47,288 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:50:47,289 INFO L399 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:50:47,289 INFO L418 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:50:47,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:50:47,289 INFO L82 PathProgramCache]: Analyzing trace with hash -508553942, now seen corresponding path program 26 times [2019-09-05 12:50:47,289 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:50:47,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:50:47,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:50:47,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:50:47,290 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:50:47,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:50:47,755 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:50:47,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:50:47,756 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:50:47,756 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:50:47,756 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:50:47,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:50:47,756 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 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:50:47,766 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:50:47,766 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 12:50:54,735 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2019-09-05 12:50:54,735 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:50:54,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 55 conjunts are in the unsatisfiable core [2019-09-05 12:50:54,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:50:54,788 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:50:54,788 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:51:01,042 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:51:01,047 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:51:01,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2019-09-05 12:51:01,047 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:51:01,049 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-05 12:51:01,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-05 12:51:01,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=894, Invalid=2298, Unknown=0, NotChecked=0, Total=3192 [2019-09-05 12:51:01,049 INFO L87 Difference]: Start difference. First operand 114 states and 116 transitions. Second operand 30 states. [2019-09-05 12:51:02,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:51:02,498 INFO L93 Difference]: Finished difference Result 117 states and 119 transitions. [2019-09-05 12:51:02,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-05 12:51:02,499 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 62 [2019-09-05 12:51:02,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:51:02,500 INFO L225 Difference]: With dead ends: 117 [2019-09-05 12:51:02,500 INFO L226 Difference]: Without dead ends: 117 [2019-09-05 12:51:02,500 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 96 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=894, Invalid=2298, Unknown=0, NotChecked=0, Total=3192 [2019-09-05 12:51:02,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-09-05 12:51:02,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 116. [2019-09-05 12:51:02,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-09-05 12:51:02,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 118 transitions. [2019-09-05 12:51:02,503 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 118 transitions. Word has length 62 [2019-09-05 12:51:02,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:51:02,503 INFO L475 AbstractCegarLoop]: Abstraction has 116 states and 118 transitions. [2019-09-05 12:51:02,503 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-05 12:51:02,504 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 118 transitions. [2019-09-05 12:51:02,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-05 12:51:02,504 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:51:02,504 INFO L399 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:51:02,504 INFO L418 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:51:02,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:51:02,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1285881846, now seen corresponding path program 26 times [2019-09-05 12:51:02,505 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:51:02,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:51:02,506 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:51:02,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:51:02,506 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:51:02,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:51:03,031 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:51:03,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:51:03,031 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:51:03,031 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:51:03,031 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:51:03,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:51:03,032 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 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:51:03,042 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:51:03,042 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 12:51:31,878 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2019-09-05 12:51:31,879 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:51:31,918 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 55 conjunts are in the unsatisfiable core [2019-09-05 12:51:31,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:51:31,957 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:51:31,958 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:51:36,732 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:51:36,738 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:51:36,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2019-09-05 12:51:36,739 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:51:36,739 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-05 12:51:36,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-05 12:51:36,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=885, Invalid=2307, Unknown=0, NotChecked=0, Total=3192 [2019-09-05 12:51:36,739 INFO L87 Difference]: Start difference. First operand 116 states and 118 transitions. Second operand 30 states. [2019-09-05 12:51:37,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:51:37,924 INFO L93 Difference]: Finished difference Result 119 states and 121 transitions. [2019-09-05 12:51:37,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-05 12:51:37,924 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 62 [2019-09-05 12:51:37,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:51:37,926 INFO L225 Difference]: With dead ends: 119 [2019-09-05 12:51:37,926 INFO L226 Difference]: Without dead ends: 119 [2019-09-05 12:51:37,926 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 96 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=885, Invalid=2307, Unknown=0, NotChecked=0, Total=3192 [2019-09-05 12:51:37,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-09-05 12:51:37,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2019-09-05 12:51:37,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-09-05 12:51:37,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 120 transitions. [2019-09-05 12:51:37,929 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 120 transitions. Word has length 62 [2019-09-05 12:51:37,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:51:37,929 INFO L475 AbstractCegarLoop]: Abstraction has 118 states and 120 transitions. [2019-09-05 12:51:37,929 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-05 12:51:37,929 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 120 transitions. [2019-09-05 12:51:37,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-05 12:51:37,930 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:51:37,930 INFO L399 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:51:37,930 INFO L418 AbstractCegarLoop]: === Iteration 57 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:51:37,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:51:37,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1981265511, now seen corresponding path program 27 times [2019-09-05 12:51:37,930 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:51:37,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:51:37,931 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:51:37,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:51:37,931 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:51:37,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:51:38,424 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:51:38,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:51:38,425 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:51:38,425 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:51:38,425 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:51:38,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:51:38,425 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 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:51:38,435 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:51:38,435 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 12:51:38,461 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:51:38,462 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:51:38,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 57 conjunts are in the unsatisfiable core [2019-09-05 12:51:38,464 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:51:38,501 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:51:38,501 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:51:45,669 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:51:45,673 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:51:45,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 59 [2019-09-05 12:51:45,673 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:51:45,673 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-05 12:51:45,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-05 12:51:45,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=955, Invalid=2467, Unknown=0, NotChecked=0, Total=3422 [2019-09-05 12:51:45,674 INFO L87 Difference]: Start difference. First operand 118 states and 120 transitions. Second operand 31 states. [2019-09-05 12:51:47,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:51:47,190 INFO L93 Difference]: Finished difference Result 121 states and 123 transitions. [2019-09-05 12:51:47,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-05 12:51:47,191 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 64 [2019-09-05 12:51:47,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:51:47,192 INFO L225 Difference]: With dead ends: 121 [2019-09-05 12:51:47,192 INFO L226 Difference]: Without dead ends: 121 [2019-09-05 12:51:47,192 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 99 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=955, Invalid=2467, Unknown=0, NotChecked=0, Total=3422 [2019-09-05 12:51:47,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-09-05 12:51:47,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 120. [2019-09-05 12:51:47,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-09-05 12:51:47,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 122 transitions. [2019-09-05 12:51:47,195 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 122 transitions. Word has length 64 [2019-09-05 12:51:47,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:51:47,196 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 122 transitions. [2019-09-05 12:51:47,196 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-05 12:51:47,196 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 122 transitions. [2019-09-05 12:51:47,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-05 12:51:47,197 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:51:47,197 INFO L399 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:51:47,197 INFO L418 AbstractCegarLoop]: === Iteration 58 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:51:47,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:51:47,198 INFO L82 PathProgramCache]: Analyzing trace with hash -85536911, now seen corresponding path program 27 times [2019-09-05 12:51:47,198 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:51:47,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:51:47,198 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:51:47,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:51:47,199 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:51:47,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:51:47,705 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:51:47,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:51:47,705 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:51:47,706 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:51:47,706 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:51:47,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:51:47,706 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 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:51:47,716 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:51:47,716 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 12:51:47,738 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:51:47,738 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:51:47,739 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 57 conjunts are in the unsatisfiable core [2019-09-05 12:51:47,740 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:51:47,775 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:51:47,776 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:51:52,200 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:51:52,203 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:51:52,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 59 [2019-09-05 12:51:52,203 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:51:52,204 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-05 12:51:52,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-05 12:51:52,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=935, Invalid=2487, Unknown=0, NotChecked=0, Total=3422 [2019-09-05 12:51:52,205 INFO L87 Difference]: Start difference. First operand 120 states and 122 transitions. Second operand 31 states. [2019-09-05 12:51:53,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:51:53,469 INFO L93 Difference]: Finished difference Result 123 states and 125 transitions. [2019-09-05 12:51:53,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-05 12:51:53,469 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 64 [2019-09-05 12:51:53,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:51:53,470 INFO L225 Difference]: With dead ends: 123 [2019-09-05 12:51:53,470 INFO L226 Difference]: Without dead ends: 123 [2019-09-05 12:51:53,471 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 99 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=935, Invalid=2487, Unknown=0, NotChecked=0, Total=3422 [2019-09-05 12:51:53,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-09-05 12:51:53,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2019-09-05 12:51:53,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-09-05 12:51:53,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 124 transitions. [2019-09-05 12:51:53,474 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 124 transitions. Word has length 64 [2019-09-05 12:51:53,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:51:53,474 INFO L475 AbstractCegarLoop]: Abstraction has 122 states and 124 transitions. [2019-09-05 12:51:53,474 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-05 12:51:53,474 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 124 transitions. [2019-09-05 12:51:53,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-05 12:51:53,475 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:51:53,475 INFO L399 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:51:53,475 INFO L418 AbstractCegarLoop]: === Iteration 59 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:51:53,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:51:53,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1893991324, now seen corresponding path program 28 times [2019-09-05 12:51:53,476 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:51:53,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:51:53,476 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:51:53,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:51:53,477 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:51:53,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:51:54,295 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:51:54,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:51:54,296 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:51:54,296 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:51:54,296 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:51:54,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:51:54,297 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:51:54,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:51:54,321 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 12:51:54,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:51:54,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 59 conjunts are in the unsatisfiable core [2019-09-05 12:51:54,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:51:54,450 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:51:54,451 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:52:03,246 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:52:03,248 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:52:03,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 61 [2019-09-05 12:52:03,249 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:52:03,249 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-05 12:52:03,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-05 12:52:03,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1018, Invalid=2642, Unknown=0, NotChecked=0, Total=3660 [2019-09-05 12:52:03,250 INFO L87 Difference]: Start difference. First operand 122 states and 124 transitions. Second operand 32 states. [2019-09-05 12:52:04,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:52:04,925 INFO L93 Difference]: Finished difference Result 125 states and 127 transitions. [2019-09-05 12:52:04,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-05 12:52:04,926 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 66 [2019-09-05 12:52:04,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:52:04,927 INFO L225 Difference]: With dead ends: 125 [2019-09-05 12:52:04,927 INFO L226 Difference]: Without dead ends: 125 [2019-09-05 12:52:04,928 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 102 SyntacticMatches, 2 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=1018, Invalid=2642, Unknown=0, NotChecked=0, Total=3660 [2019-09-05 12:52:04,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-09-05 12:52:04,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2019-09-05 12:52:04,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-09-05 12:52:04,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 126 transitions. [2019-09-05 12:52:04,930 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 126 transitions. Word has length 66 [2019-09-05 12:52:04,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:52:04,930 INFO L475 AbstractCegarLoop]: Abstraction has 124 states and 126 transitions. [2019-09-05 12:52:04,931 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-05 12:52:04,931 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 126 transitions. [2019-09-05 12:52:04,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-05 12:52:04,931 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:52:04,931 INFO L399 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:52:04,931 INFO L418 AbstractCegarLoop]: === Iteration 60 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:52:04,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:52:04,932 INFO L82 PathProgramCache]: Analyzing trace with hash 535997484, now seen corresponding path program 28 times [2019-09-05 12:52:04,932 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:52:04,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:52:04,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:52:04,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:52:04,932 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:52:04,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:52:05,458 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:52:05,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:52:05,459 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:52:05,459 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:52:05,459 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:52:05,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:52:05,459 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:52:05,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:52:05,470 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 12:52:05,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:52:05,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 59 conjunts are in the unsatisfiable core [2019-09-05 12:52:05,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:52:05,534 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:52:05,534 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:52:09,953 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:52:09,955 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:52:09,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 61 [2019-09-05 12:52:09,955 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:52:09,956 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-05 12:52:09,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-05 12:52:09,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=983, Invalid=2677, Unknown=0, NotChecked=0, Total=3660 [2019-09-05 12:52:09,957 INFO L87 Difference]: Start difference. First operand 124 states and 126 transitions. Second operand 32 states. [2019-09-05 12:52:11,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:52:11,312 INFO L93 Difference]: Finished difference Result 127 states and 129 transitions. [2019-09-05 12:52:11,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-05 12:52:11,312 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 66 [2019-09-05 12:52:11,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:52:11,314 INFO L225 Difference]: With dead ends: 127 [2019-09-05 12:52:11,314 INFO L226 Difference]: Without dead ends: 127 [2019-09-05 12:52:11,314 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 102 SyntacticMatches, 2 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=983, Invalid=2677, Unknown=0, NotChecked=0, Total=3660 [2019-09-05 12:52:11,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-09-05 12:52:11,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 126. [2019-09-05 12:52:11,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-09-05 12:52:11,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 128 transitions. [2019-09-05 12:52:11,316 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 128 transitions. Word has length 66 [2019-09-05 12:52:11,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:52:11,317 INFO L475 AbstractCegarLoop]: Abstraction has 126 states and 128 transitions. [2019-09-05 12:52:11,317 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-05 12:52:11,317 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 128 transitions. [2019-09-05 12:52:11,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-05 12:52:11,317 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:52:11,318 INFO L399 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:52:11,318 INFO L418 AbstractCegarLoop]: === Iteration 61 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:52:11,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:52:11,318 INFO L82 PathProgramCache]: Analyzing trace with hash 2015803169, now seen corresponding path program 29 times [2019-09-05 12:52:11,318 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:52:11,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:52:11,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:52:11,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:52:11,319 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:52:11,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:52:11,931 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:52:11,931 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:52:11,932 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:52:11,932 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:52:11,932 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:52:11,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:52:11,932 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 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:52:11,943 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:52:11,943 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 12:52:36,108 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2019-09-05 12:52:36,108 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:52:36,122 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 62 conjunts are in the unsatisfiable core [2019-09-05 12:52:36,123 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:52:36,190 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:52:36,190 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:52:54,085 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-09-05 12:53:30,525 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:53:30,531 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:53:30,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 33] total 64 [2019-09-05 12:53:30,531 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:53:30,532 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-05 12:53:30,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-05 12:53:30,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1117, Invalid=2906, Unknown=9, NotChecked=0, Total=4032 [2019-09-05 12:53:30,532 INFO L87 Difference]: Start difference. First operand 126 states and 128 transitions. Second operand 33 states. [2019-09-05 12:53:32,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:53:32,285 INFO L93 Difference]: Finished difference Result 129 states and 131 transitions. [2019-09-05 12:53:32,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-05 12:53:32,286 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 68 [2019-09-05 12:53:32,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:53:32,287 INFO L225 Difference]: With dead ends: 129 [2019-09-05 12:53:32,287 INFO L226 Difference]: Without dead ends: 129 [2019-09-05 12:53:32,288 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 103 SyntacticMatches, 3 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 54.9s TimeCoverageRelationStatistics Valid=1117, Invalid=2906, Unknown=9, NotChecked=0, Total=4032 [2019-09-05 12:53:32,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-09-05 12:53:32,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 128. [2019-09-05 12:53:32,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-09-05 12:53:32,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 130 transitions. [2019-09-05 12:53:32,291 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 130 transitions. Word has length 68 [2019-09-05 12:53:32,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:53:32,291 INFO L475 AbstractCegarLoop]: Abstraction has 128 states and 130 transitions. [2019-09-05 12:53:32,291 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-05 12:53:32,291 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 130 transitions. [2019-09-05 12:53:32,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-05 12:53:32,292 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:53:32,292 INFO L399 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:53:32,292 INFO L418 AbstractCegarLoop]: === Iteration 62 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:53:32,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:53:32,292 INFO L82 PathProgramCache]: Analyzing trace with hash 830096935, now seen corresponding path program 29 times [2019-09-05 12:53:32,293 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:53:32,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:53:32,293 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:53:32,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:53:32,294 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:53:32,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:53:32,861 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:53:32,862 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:53:32,862 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:53:32,862 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:53:32,862 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:53:32,862 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:53:32,862 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 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:53:32,873 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:53:32,873 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 12:54:50,560 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2019-09-05 12:54:50,560 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:54:50,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 61 conjunts are in the unsatisfiable core [2019-09-05 12:54:50,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:54:50,644 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:54:50,644 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:54:55,069 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:54:55,077 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:54:55,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2019-09-05 12:54:55,078 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:54:55,078 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-05 12:54:55,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-05 12:54:55,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1029, Invalid=2877, Unknown=0, NotChecked=0, Total=3906 [2019-09-05 12:54:55,078 INFO L87 Difference]: Start difference. First operand 128 states and 130 transitions. Second operand 33 states. [2019-09-05 12:54:56,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:54:56,476 INFO L93 Difference]: Finished difference Result 131 states and 133 transitions. [2019-09-05 12:54:56,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-05 12:54:56,476 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 68 [2019-09-05 12:54:56,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:54:56,478 INFO L225 Difference]: With dead ends: 131 [2019-09-05 12:54:56,478 INFO L226 Difference]: Without dead ends: 131 [2019-09-05 12:54:56,478 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 105 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=1029, Invalid=2877, Unknown=0, NotChecked=0, Total=3906 [2019-09-05 12:54:56,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-09-05 12:54:56,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2019-09-05 12:54:56,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-09-05 12:54:56,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 132 transitions. [2019-09-05 12:54:56,482 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 132 transitions. Word has length 68 [2019-09-05 12:54:56,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:54:56,482 INFO L475 AbstractCegarLoop]: Abstraction has 130 states and 132 transitions. [2019-09-05 12:54:56,482 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-05 12:54:56,482 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 132 transitions. [2019-09-05 12:54:56,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-05 12:54:56,483 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:54:56,483 INFO L399 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:54:56,483 INFO L418 AbstractCegarLoop]: === Iteration 63 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:54:56,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:54:56,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1231926942, now seen corresponding path program 30 times [2019-09-05 12:54:56,483 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:54:56,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:54:56,484 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:54:56,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:54:56,484 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:54:56,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:54:57,214 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:54:57,215 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:54:57,215 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:54:57,215 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:54:57,215 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:54:57,215 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:54:57,215 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 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 12:54:57,235 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:54:57,235 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:54:57,265 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:54:57,265 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:54:57,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 63 conjunts are in the unsatisfiable core [2019-09-05 12:54:57,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:54:57,369 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:54:57,370 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:55:06,064 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:55:06,066 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:55:06,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2019-09-05 12:55:06,067 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:55:06,067 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-05 12:55:06,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-05 12:55:06,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1150, Invalid=3010, Unknown=0, NotChecked=0, Total=4160 [2019-09-05 12:55:06,067 INFO L87 Difference]: Start difference. First operand 130 states and 132 transitions. Second operand 34 states. [2019-09-05 12:55:07,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:55:07,954 INFO L93 Difference]: Finished difference Result 133 states and 135 transitions. [2019-09-05 12:55:07,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-05 12:55:07,955 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 70 [2019-09-05 12:55:07,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:55:07,956 INFO L225 Difference]: With dead ends: 133 [2019-09-05 12:55:07,956 INFO L226 Difference]: Without dead ends: 133 [2019-09-05 12:55:07,956 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 108 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=1150, Invalid=3010, Unknown=0, NotChecked=0, Total=4160 [2019-09-05 12:55:07,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-09-05 12:55:07,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 132. [2019-09-05 12:55:07,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-09-05 12:55:07,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 134 transitions. [2019-09-05 12:55:07,959 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 134 transitions. Word has length 70 [2019-09-05 12:55:07,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:55:07,959 INFO L475 AbstractCegarLoop]: Abstraction has 132 states and 134 transitions. [2019-09-05 12:55:07,959 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-05 12:55:07,959 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 134 transitions. [2019-09-05 12:55:07,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-05 12:55:07,960 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:55:07,960 INFO L399 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:55:07,960 INFO L418 AbstractCegarLoop]: === Iteration 64 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:55:07,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:55:07,960 INFO L82 PathProgramCache]: Analyzing trace with hash -8172190, now seen corresponding path program 30 times [2019-09-05 12:55:07,960 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:55:07,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:55:07,961 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:55:07,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:55:07,961 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:55:07,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:55:08,537 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:55:08,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:55:08,537 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:55:08,537 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:55:08,538 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:55:08,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:55:08,538 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 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:55:08,548 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:55:08,548 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 12:55:08,580 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:55:08,581 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:55:08,582 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 63 conjunts are in the unsatisfiable core [2019-09-05 12:55:08,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:55:08,632 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:55:08,632 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:55:12,796 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:55:12,799 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:55:12,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2019-09-05 12:55:12,799 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:55:12,799 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-05 12:55:12,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-05 12:55:12,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1073, Invalid=3087, Unknown=0, NotChecked=0, Total=4160 [2019-09-05 12:55:12,800 INFO L87 Difference]: Start difference. First operand 132 states and 134 transitions. Second operand 34 states. [2019-09-05 12:55:14,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:55:14,304 INFO L93 Difference]: Finished difference Result 135 states and 137 transitions. [2019-09-05 12:55:14,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-05 12:55:14,304 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 70 [2019-09-05 12:55:14,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:55:14,305 INFO L225 Difference]: With dead ends: 135 [2019-09-05 12:55:14,306 INFO L226 Difference]: Without dead ends: 135 [2019-09-05 12:55:14,306 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 108 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=1073, Invalid=3087, Unknown=0, NotChecked=0, Total=4160 [2019-09-05 12:55:14,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-09-05 12:55:14,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 134. [2019-09-05 12:55:14,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-09-05 12:55:14,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 136 transitions. [2019-09-05 12:55:14,309 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 136 transitions. Word has length 70 [2019-09-05 12:55:14,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:55:14,310 INFO L475 AbstractCegarLoop]: Abstraction has 134 states and 136 transitions. [2019-09-05 12:55:14,310 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-05 12:55:14,310 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 136 transitions. [2019-09-05 12:55:14,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-05 12:55:14,311 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:55:14,311 INFO L399 BasicCegarLoop]: trace histogram [31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:55:14,311 INFO L418 AbstractCegarLoop]: === Iteration 65 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:55:14,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:55:14,311 INFO L82 PathProgramCache]: Analyzing trace with hash -453850405, now seen corresponding path program 31 times [2019-09-05 12:55:14,311 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:55:14,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:55:14,312 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:55:14,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:55:14,312 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:55:14,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:55:14,935 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:55:14,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:55:14,935 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:55:14,935 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:55:14,936 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:55:14,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:55:14,936 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 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 12:55:14,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:55:14,955 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:55:14,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:55:14,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 65 conjunts are in the unsatisfiable core [2019-09-05 12:55:14,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:55:15,072 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:55:15,072 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:55:24,046 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:55:24,049 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:55:24,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 67 [2019-09-05 12:55:24,049 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:55:24,049 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-05 12:55:24,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-05 12:55:24,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1219, Invalid=3203, Unknown=0, NotChecked=0, Total=4422 [2019-09-05 12:55:24,050 INFO L87 Difference]: Start difference. First operand 134 states and 136 transitions. Second operand 35 states. [2019-09-05 12:55:26,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:55:26,038 INFO L93 Difference]: Finished difference Result 137 states and 139 transitions. [2019-09-05 12:55:26,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-05 12:55:26,038 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 72 [2019-09-05 12:55:26,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:55:26,039 INFO L225 Difference]: With dead ends: 137 [2019-09-05 12:55:26,039 INFO L226 Difference]: Without dead ends: 137 [2019-09-05 12:55:26,040 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 111 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=1219, Invalid=3203, Unknown=0, NotChecked=0, Total=4422 [2019-09-05 12:55:26,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-09-05 12:55:26,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 136. [2019-09-05 12:55:26,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-09-05 12:55:26,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 138 transitions. [2019-09-05 12:55:26,043 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 138 transitions. Word has length 72 [2019-09-05 12:55:26,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:55:26,043 INFO L475 AbstractCegarLoop]: Abstraction has 136 states and 138 transitions. [2019-09-05 12:55:26,043 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-05 12:55:26,043 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 138 transitions. [2019-09-05 12:55:26,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-05 12:55:26,044 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:55:26,044 INFO L399 BasicCegarLoop]: trace histogram [31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:55:26,044 INFO L418 AbstractCegarLoop]: === Iteration 66 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:55:26,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:55:26,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1869050333, now seen corresponding path program 31 times [2019-09-05 12:55:26,045 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:55:26,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:55:26,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:55:26,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:55:26,045 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:55:26,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:55:26,648 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:55:26,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:55:26,648 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:55:26,649 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:55:26,649 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:55:26,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:55:26,649 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 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:55:26,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:55:26,659 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 12:55:26,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:55:26,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 65 conjunts are in the unsatisfiable core [2019-09-05 12:55:26,684 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:55:26,751 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:55:26,751 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:55:30,369 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:55:30,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:55:30,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 67 [2019-09-05 12:55:30,373 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:55:30,373 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-05 12:55:30,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-05 12:55:30,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1115, Invalid=3307, Unknown=0, NotChecked=0, Total=4422 [2019-09-05 12:55:30,374 INFO L87 Difference]: Start difference. First operand 136 states and 138 transitions. Second operand 35 states. [2019-09-05 12:55:32,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:55:32,007 INFO L93 Difference]: Finished difference Result 139 states and 141 transitions. [2019-09-05 12:55:32,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-05 12:55:32,008 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 72 [2019-09-05 12:55:32,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:55:32,009 INFO L225 Difference]: With dead ends: 139 [2019-09-05 12:55:32,009 INFO L226 Difference]: Without dead ends: 139 [2019-09-05 12:55:32,009 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 111 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 390 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=1115, Invalid=3307, Unknown=0, NotChecked=0, Total=4422 [2019-09-05 12:55:32,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-09-05 12:55:32,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 138. [2019-09-05 12:55:32,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-09-05 12:55:32,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 140 transitions. [2019-09-05 12:55:32,012 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 140 transitions. Word has length 72 [2019-09-05 12:55:32,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:55:32,013 INFO L475 AbstractCegarLoop]: Abstraction has 138 states and 140 transitions. [2019-09-05 12:55:32,013 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-05 12:55:32,013 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 140 transitions. [2019-09-05 12:55:32,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-05 12:55:32,013 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:55:32,013 INFO L399 BasicCegarLoop]: trace histogram [32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:55:32,014 INFO L418 AbstractCegarLoop]: === Iteration 67 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:55:32,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:55:32,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1283210280, now seen corresponding path program 32 times [2019-09-05 12:55:32,014 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:55:32,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:55:32,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:55:32,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:55:32,015 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:55:32,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:55:32,692 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:55:32,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:55:32,693 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:55:32,693 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:55:32,693 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:55:32,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:55:32,693 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 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:55:32,702 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:55:32,702 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 12:56:11,383 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2019-09-05 12:56:11,383 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:56:11,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 68 conjunts are in the unsatisfiable core [2019-09-05 12:56:11,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:56:11,540 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:56:11,540 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:57:21,840 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:57:21,847 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:57:21,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 36] total 70 [2019-09-05 12:57:21,848 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:57:21,849 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-05 12:57:21,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-05 12:57:21,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1327, Invalid=3488, Unknown=15, NotChecked=0, Total=4830 [2019-09-05 12:57:21,849 INFO L87 Difference]: Start difference. First operand 138 states and 140 transitions. Second operand 36 states. [2019-09-05 12:57:23,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:57:23,998 INFO L93 Difference]: Finished difference Result 141 states and 143 transitions. [2019-09-05 12:57:23,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-05 12:57:23,999 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 74 [2019-09-05 12:57:23,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:57:24,000 INFO L225 Difference]: With dead ends: 141 [2019-09-05 12:57:24,000 INFO L226 Difference]: Without dead ends: 141 [2019-09-05 12:57:24,000 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 112 SyntacticMatches, 3 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 70.9s TimeCoverageRelationStatistics Valid=1327, Invalid=3488, Unknown=15, NotChecked=0, Total=4830 [2019-09-05 12:57:24,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-09-05 12:57:24,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 140. [2019-09-05 12:57:24,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-09-05 12:57:24,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 142 transitions. [2019-09-05 12:57:24,008 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 142 transitions. Word has length 74 [2019-09-05 12:57:24,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:57:24,008 INFO L475 AbstractCegarLoop]: Abstraction has 140 states and 142 transitions. [2019-09-05 12:57:24,008 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-05 12:57:24,008 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 142 transitions. [2019-09-05 12:57:24,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-05 12:57:24,009 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:57:24,009 INFO L399 BasicCegarLoop]: trace histogram [32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:57:24,009 INFO L418 AbstractCegarLoop]: === Iteration 68 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:57:24,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:57:24,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1993630616, now seen corresponding path program 32 times [2019-09-05 12:57:24,009 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:57:24,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:57:24,010 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:57:24,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:57:24,011 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:57:24,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:57:24,647 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:57:24,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:57:24,648 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:57:24,648 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:57:24,648 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:57:24,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:57:24,648 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 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:57:24,661 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:57:24,661 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 12:59:28,391 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2019-09-05 12:59:28,392 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:59:28,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 67 conjunts are in the unsatisfiable core [2019-09-05 12:59:28,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:59:28,470 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:59:28,470 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:59:32,469 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:59:32,479 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:59:32,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2019-09-05 12:59:32,479 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:59:32,479 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-05 12:59:32,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-05 12:59:32,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1155, Invalid=3537, Unknown=0, NotChecked=0, Total=4692 [2019-09-05 12:59:32,480 INFO L87 Difference]: Start difference. First operand 140 states and 142 transitions. Second operand 36 states. [2019-09-05 12:59:34,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:59:34,205 INFO L93 Difference]: Finished difference Result 143 states and 145 transitions. [2019-09-05 12:59:34,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-05 12:59:34,206 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 74 [2019-09-05 12:59:34,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:59:34,207 INFO L225 Difference]: With dead ends: 143 [2019-09-05 12:59:34,207 INFO L226 Difference]: Without dead ends: 143 [2019-09-05 12:59:34,208 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 114 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 442 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=1155, Invalid=3537, Unknown=0, NotChecked=0, Total=4692 [2019-09-05 12:59:34,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-09-05 12:59:34,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 142. [2019-09-05 12:59:34,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-09-05 12:59:34,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 144 transitions. [2019-09-05 12:59:34,210 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 144 transitions. Word has length 74 [2019-09-05 12:59:34,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:59:34,210 INFO L475 AbstractCegarLoop]: Abstraction has 142 states and 144 transitions. [2019-09-05 12:59:34,210 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-05 12:59:34,211 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 144 transitions. [2019-09-05 12:59:34,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-05 12:59:34,211 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:59:34,211 INFO L399 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:59:34,211 INFO L418 AbstractCegarLoop]: === Iteration 69 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:59:34,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:59:34,212 INFO L82 PathProgramCache]: Analyzing trace with hash 565866901, now seen corresponding path program 33 times [2019-09-05 12:59:34,212 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:59:34,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:59:34,212 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:59:34,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:59:34,213 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:59:34,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:59:34,903 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:59:34,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:59:34,903 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:59:34,903 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:59:34,904 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:59:34,904 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:59:34,904 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 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:59:34,914 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:59:34,914 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 12:59:34,945 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:59:34,946 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:59:34,947 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 69 conjunts are in the unsatisfiable core [2019-09-05 12:59:34,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:59:35,015 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:59:35,015 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:59:45,990 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:59:45,993 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:59:45,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 71 [2019-09-05 12:59:45,993 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:59:45,994 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-05 12:59:45,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-05 12:59:45,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1363, Invalid=3607, Unknown=0, NotChecked=0, Total=4970 [2019-09-05 12:59:45,995 INFO L87 Difference]: Start difference. First operand 142 states and 144 transitions. Second operand 37 states. [2019-09-05 12:59:48,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:59:48,228 INFO L93 Difference]: Finished difference Result 145 states and 147 transitions. [2019-09-05 12:59:48,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-05 12:59:48,229 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 76 [2019-09-05 12:59:48,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:59:48,230 INFO L225 Difference]: With dead ends: 145 [2019-09-05 12:59:48,230 INFO L226 Difference]: Without dead ends: 145 [2019-09-05 12:59:48,231 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 117 SyntacticMatches, 2 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=1363, Invalid=3607, Unknown=0, NotChecked=0, Total=4970 [2019-09-05 12:59:48,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-09-05 12:59:48,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 144. [2019-09-05 12:59:48,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-09-05 12:59:48,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 146 transitions. [2019-09-05 12:59:48,234 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 146 transitions. Word has length 76 [2019-09-05 12:59:48,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:59:48,234 INFO L475 AbstractCegarLoop]: Abstraction has 144 states and 146 transitions. [2019-09-05 12:59:48,234 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-05 12:59:48,234 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 146 transitions. [2019-09-05 12:59:48,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-05 12:59:48,235 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:59:48,235 INFO L399 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:59:48,235 INFO L418 AbstractCegarLoop]: === Iteration 70 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:59:48,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:59:48,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1456198291, now seen corresponding path program 33 times [2019-09-05 12:59:48,236 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:59:48,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:59:48,236 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:59:48,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:59:48,237 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:59:48,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:59:49,050 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:59:49,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:59:49,050 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:59:49,050 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:59:49,050 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:59:49,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:59:49,050 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 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:59:49,061 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:59:49,061 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 12:59:49,088 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:59:49,089 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:59:49,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 69 conjunts are in the unsatisfiable core [2019-09-05 12:59:49,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:59:49,147 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:59:49,148 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 12:59:52,899 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:59:52,902 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 12:59:52,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 71 [2019-09-05 12:59:52,902 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 12:59:52,902 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-05 12:59:52,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-05 12:59:52,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1193, Invalid=3777, Unknown=0, NotChecked=0, Total=4970 [2019-09-05 12:59:52,903 INFO L87 Difference]: Start difference. First operand 144 states and 146 transitions. Second operand 37 states. [2019-09-05 12:59:54,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:59:54,740 INFO L93 Difference]: Finished difference Result 147 states and 149 transitions. [2019-09-05 12:59:54,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-05 12:59:54,741 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 76 [2019-09-05 12:59:54,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:59:54,742 INFO L225 Difference]: With dead ends: 147 [2019-09-05 12:59:54,742 INFO L226 Difference]: Without dead ends: 147 [2019-09-05 12:59:54,742 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 117 SyntacticMatches, 2 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=1193, Invalid=3777, Unknown=0, NotChecked=0, Total=4970 [2019-09-05 12:59:54,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-09-05 12:59:54,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 146. [2019-09-05 12:59:54,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-09-05 12:59:54,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 148 transitions. [2019-09-05 12:59:54,746 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 148 transitions. Word has length 76 [2019-09-05 12:59:54,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:59:54,746 INFO L475 AbstractCegarLoop]: Abstraction has 146 states and 148 transitions. [2019-09-05 12:59:54,746 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-05 12:59:54,746 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 148 transitions. [2019-09-05 12:59:54,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-05 12:59:54,747 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:59:54,747 INFO L399 BasicCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:59:54,747 INFO L418 AbstractCegarLoop]: === Iteration 71 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:59:54,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:59:54,748 INFO L82 PathProgramCache]: Analyzing trace with hash -587422702, now seen corresponding path program 34 times [2019-09-05 12:59:54,748 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 12:59:54,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:59:54,749 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:59:54,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:59:54,749 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 12:59:54,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:59:55,455 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:59:55,456 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:59:55,456 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 12:59:55,456 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 12:59:55,456 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 12:59:55,456 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:59:55,456 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 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:59:55,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:59:55,469 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 12:59:55,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:59:55,501 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 71 conjunts are in the unsatisfiable core [2019-09-05 12:59:55,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:59:55,549 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:59:55,549 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:00:06,760 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:00:06,763 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:00:06,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 73 [2019-09-05 13:00:06,763 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:00:06,763 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-05 13:00:06,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-05 13:00:06,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1438, Invalid=3818, Unknown=0, NotChecked=0, Total=5256 [2019-09-05 13:00:06,764 INFO L87 Difference]: Start difference. First operand 146 states and 148 transitions. Second operand 38 states. [2019-09-05 13:00:09,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:00:09,135 INFO L93 Difference]: Finished difference Result 149 states and 151 transitions. [2019-09-05 13:00:09,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-05 13:00:09,136 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 78 [2019-09-05 13:00:09,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:00:09,137 INFO L225 Difference]: With dead ends: 149 [2019-09-05 13:00:09,137 INFO L226 Difference]: Without dead ends: 149 [2019-09-05 13:00:09,138 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 120 SyntacticMatches, 2 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=1438, Invalid=3818, Unknown=0, NotChecked=0, Total=5256 [2019-09-05 13:00:09,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-09-05 13:00:09,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 148. [2019-09-05 13:00:09,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-09-05 13:00:09,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 150 transitions. [2019-09-05 13:00:09,141 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 150 transitions. Word has length 78 [2019-09-05 13:00:09,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:00:09,141 INFO L475 AbstractCegarLoop]: Abstraction has 148 states and 150 transitions. [2019-09-05 13:00:09,141 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-05 13:00:09,141 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 150 transitions. [2019-09-05 13:00:09,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-05 13:00:09,142 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:00:09,142 INFO L399 BasicCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:00:09,142 INFO L418 AbstractCegarLoop]: === Iteration 72 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:00:09,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:00:09,143 INFO L82 PathProgramCache]: Analyzing trace with hash 379809486, now seen corresponding path program 34 times [2019-09-05 13:00:09,143 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:00:09,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:00:09,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:00:09,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:00:09,144 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:00:09,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:00:09,833 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:00:09,833 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:00:09,833 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:00:09,833 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:00:09,833 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:00:09,833 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:00:09,834 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 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:00:09,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:00:09,845 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:00:09,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:00:09,870 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 71 conjunts are in the unsatisfiable core [2019-09-05 13:00:09,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:00:09,929 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:00:09,929 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:00:13,223 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:00:13,226 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:00:13,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 73 [2019-09-05 13:00:13,226 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:00:13,226 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-05 13:00:13,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-05 13:00:13,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1229, Invalid=4027, Unknown=0, NotChecked=0, Total=5256 [2019-09-05 13:00:13,227 INFO L87 Difference]: Start difference. First operand 148 states and 150 transitions. Second operand 38 states. [2019-09-05 13:00:15,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:00:15,150 INFO L93 Difference]: Finished difference Result 151 states and 153 transitions. [2019-09-05 13:00:15,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-05 13:00:15,150 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 78 [2019-09-05 13:00:15,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:00:15,151 INFO L225 Difference]: With dead ends: 151 [2019-09-05 13:00:15,152 INFO L226 Difference]: Without dead ends: 151 [2019-09-05 13:00:15,152 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 120 SyntacticMatches, 2 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 546 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=1229, Invalid=4027, Unknown=0, NotChecked=0, Total=5256 [2019-09-05 13:00:15,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-09-05 13:00:15,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 150. [2019-09-05 13:00:15,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-09-05 13:00:15,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 152 transitions. [2019-09-05 13:00:15,155 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 152 transitions. Word has length 78 [2019-09-05 13:00:15,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:00:15,156 INFO L475 AbstractCegarLoop]: Abstraction has 150 states and 152 transitions. [2019-09-05 13:00:15,156 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-05 13:00:15,156 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 152 transitions. [2019-09-05 13:00:15,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-05 13:00:15,157 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:00:15,157 INFO L399 BasicCegarLoop]: trace histogram [35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:00:15,157 INFO L418 AbstractCegarLoop]: === Iteration 73 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:00:15,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:00:15,157 INFO L82 PathProgramCache]: Analyzing trace with hash -797168817, now seen corresponding path program 35 times [2019-09-05 13:00:15,158 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:00:15,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:00:15,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:00:15,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:00:15,158 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:00:15,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:00:15,879 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:00:15,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:00:15,880 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:00:15,880 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:00:15,880 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:00:15,880 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:00:15,880 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 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:00:15,889 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:00:15,889 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 13:00:21,459 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2019-09-05 13:00:21,459 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:00:21,465 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 74 conjunts are in the unsatisfiable core [2019-09-05 13:00:21,466 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:00:21,552 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:00:21,552 INFO L322 TraceCheckSpWp]: Computing backward predicates...