java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/loops/count_up_down-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 01:48:37,048 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 01:48:37,050 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 01:48:37,062 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 01:48:37,062 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 01:48:37,063 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 01:48:37,065 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 01:48:37,066 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 01:48:37,068 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 01:48:37,069 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 01:48:37,070 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 01:48:37,071 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 01:48:37,072 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 01:48:37,073 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 01:48:37,074 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 01:48:37,075 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 01:48:37,075 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 01:48:37,076 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 01:48:37,078 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 01:48:37,080 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 01:48:37,081 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 01:48:37,082 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 01:48:37,084 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 01:48:37,084 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 01:48:37,087 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 01:48:37,087 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 01:48:37,087 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 01:48:37,088 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 01:48:37,089 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 01:48:37,090 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 01:48:37,090 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 01:48:37,091 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 01:48:37,091 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 01:48:37,092 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 01:48:37,093 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 01:48:37,093 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 01:48:37,094 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 01:48:37,094 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 01:48:37,094 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 01:48:37,095 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 01:48:37,096 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 01:48:37,097 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-10 01:48:37,111 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 01:48:37,111 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 01:48:37,112 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 01:48:37,112 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 01:48:37,112 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 01:48:37,113 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 01:48:37,113 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 01:48:37,113 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 01:48:37,113 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 01:48:37,113 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 01:48:37,114 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 01:48:37,114 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 01:48:37,115 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 01:48:37,115 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 01:48:37,115 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 01:48:37,115 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 01:48:37,115 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 01:48:37,115 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 01:48:37,116 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 01:48:37,116 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 01:48:37,116 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 01:48:37,116 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 01:48:37,116 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 01:48:37,117 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 01:48:37,117 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 01:48:37,117 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 01:48:37,117 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 01:48:37,117 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 01:48:37,118 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 01:48:37,118 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 01:48:37,146 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 01:48:37,159 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 01:48:37,162 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 01:48:37,164 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 01:48:37,164 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 01:48:37,165 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/count_up_down-1.c [2019-09-10 01:48:37,226 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b1712473/be1dad52e176497a9fe021dd00d087e2/FLAG9a24a4d58 [2019-09-10 01:48:37,638 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 01:48:37,639 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/count_up_down-1.c [2019-09-10 01:48:37,646 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b1712473/be1dad52e176497a9fe021dd00d087e2/FLAG9a24a4d58 [2019-09-10 01:48:38,011 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b1712473/be1dad52e176497a9fe021dd00d087e2 [2019-09-10 01:48:38,025 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 01:48:38,026 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 01:48:38,027 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 01:48:38,028 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 01:48:38,031 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 01:48:38,032 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 01:48:38" (1/1) ... [2019-09-10 01:48:38,035 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63f255d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:48:38, skipping insertion in model container [2019-09-10 01:48:38,035 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 01:48:38" (1/1) ... [2019-09-10 01:48:38,043 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 01:48:38,063 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 01:48:38,257 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 01:48:38,262 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 01:48:38,278 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 01:48:38,294 INFO L192 MainTranslator]: Completed translation [2019-09-10 01:48:38,294 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:48:38 WrapperNode [2019-09-10 01:48:38,295 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 01:48:38,295 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 01:48:38,296 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 01:48:38,296 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 01:48:38,387 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:48:38" (1/1) ... [2019-09-10 01:48:38,387 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:48:38" (1/1) ... [2019-09-10 01:48:38,392 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:48:38" (1/1) ... [2019-09-10 01:48:38,393 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:48:38" (1/1) ... [2019-09-10 01:48:38,396 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:48:38" (1/1) ... [2019-09-10 01:48:38,402 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:48:38" (1/1) ... [2019-09-10 01:48:38,403 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:48:38" (1/1) ... [2019-09-10 01:48:38,404 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 01:48:38,405 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 01:48:38,405 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 01:48:38,405 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 01:48:38,406 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:48:38" (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-10 01:48:38,467 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 01:48:38,467 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 01:48:38,467 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-10 01:48:38,468 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 01:48:38,468 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 01:48:38,468 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-10 01:48:38,468 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2019-09-10 01:48:38,468 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 01:48:38,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 01:48:38,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 01:48:38,609 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 01:48:38,610 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-10 01:48:38,611 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 01:48:38 BoogieIcfgContainer [2019-09-10 01:48:38,611 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 01:48:38,612 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 01:48:38,612 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 01:48:38,614 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 01:48:38,615 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 01:48:38" (1/3) ... [2019-09-10 01:48:38,615 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8ff767e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 01:48:38, skipping insertion in model container [2019-09-10 01:48:38,615 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:48:38" (2/3) ... [2019-09-10 01:48:38,616 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8ff767e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 01:48:38, skipping insertion in model container [2019-09-10 01:48:38,616 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 01:48:38" (3/3) ... [2019-09-10 01:48:38,618 INFO L109 eAbstractionObserver]: Analyzing ICFG count_up_down-1.c [2019-09-10 01:48:38,627 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 01:48:38,634 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 01:48:38,650 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 01:48:38,676 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 01:48:38,676 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 01:48:38,676 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 01:48:38,677 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 01:48:38,677 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 01:48:38,677 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 01:48:38,677 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 01:48:38,677 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 01:48:38,691 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2019-09-10 01:48:38,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-10 01:48:38,700 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:48:38,701 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:48:38,703 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:48:38,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:48:38,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1846144830, now seen corresponding path program 1 times [2019-09-10 01:48:38,711 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:48:38,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:48:38,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:48:38,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:48:38,750 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:48:38,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:48:39,086 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 23 [2019-09-10 01:48:39,200 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-10 01:48:39,202 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:48:39,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 01:48:39,203 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:48:39,208 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 01:48:39,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 01:48:39,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 01:48:39,227 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 6 states. [2019-09-10 01:48:39,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:48:39,371 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2019-09-10 01:48:39,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 01:48:39,373 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-09-10 01:48:39,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:48:39,384 INFO L225 Difference]: With dead ends: 25 [2019-09-10 01:48:39,385 INFO L226 Difference]: Without dead ends: 12 [2019-09-10 01:48:39,387 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-10 01:48:39,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-09-10 01:48:39,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-09-10 01:48:39,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-09-10 01:48:39,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-09-10 01:48:39,427 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-09-10 01:48:39,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:48:39,427 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-09-10 01:48:39,427 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 01:48:39,428 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-09-10 01:48:39,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-09-10 01:48:39,428 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:48:39,429 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:48:39,429 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:48:39,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:48:39,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1432376145, now seen corresponding path program 1 times [2019-09-10 01:48:39,430 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:48:39,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:48:39,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:48:39,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:48:39,432 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:48:39,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:48:39,789 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-10 01:48:39,790 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:48:39,790 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:48:39,791 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 12 with the following transitions: [2019-09-10 01:48:39,793 INFO L207 CegarAbsIntRunner]: [0], [4], [11], [13], [19], [22], [24], [30], [31], [32], [34] [2019-09-10 01:48:39,828 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 01:48:39,828 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 01:48:39,901 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 01:48:39,961 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 01:48:39,964 INFO L272 AbstractInterpreter]: Visited 11 different actions 35 times. Merged at 2 different actions 8 times. Widened at 1 different actions 2 times. Performed 74 root evaluator evaluations with a maximum evaluation depth of 5. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 1 fixpoints after 1 different actions. Largest state had 6 variables. [2019-09-10 01:48:39,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:48:39,969 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 01:48:39,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:48:39,969 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-10 01:48:39,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:48:39,986 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 01:48:40,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:48:40,004 WARN L254 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-10 01:48:40,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:48:40,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:48:40,173 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-10 01:48:40,175 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:48:40,312 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-10 01:48:40,318 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:48:40,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2019-09-10 01:48:40,318 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:48:40,319 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 01:48:40,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 01:48:40,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2019-09-10 01:48:40,320 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2019-09-10 01:48:40,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:48:40,468 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2019-09-10 01:48:40,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 01:48:40,469 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-09-10 01:48:40,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:48:40,470 INFO L225 Difference]: With dead ends: 18 [2019-09-10 01:48:40,470 INFO L226 Difference]: Without dead ends: 14 [2019-09-10 01:48:40,471 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2019-09-10 01:48:40,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-09-10 01:48:40,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-09-10 01:48:40,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-09-10 01:48:40,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-09-10 01:48:40,478 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2019-09-10 01:48:40,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:48:40,478 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-09-10 01:48:40,478 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 01:48:40,479 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-09-10 01:48:40,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-10 01:48:40,479 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:48:40,480 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:48:40,481 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:48:40,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:48:40,484 INFO L82 PathProgramCache]: Analyzing trace with hash -1004266255, now seen corresponding path program 2 times [2019-09-10 01:48:40,484 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:48:40,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:48:40,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:48:40,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:48:40,485 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:48:40,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:48:40,812 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:48:40,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:48:40,813 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:48:40,813 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:48:40,813 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:48:40,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:48:40,814 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-10 01:48:40,835 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 01:48:40,835 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 01:48:40,857 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-10 01:48:40,857 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:48:40,859 WARN L254 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-10 01:48:40,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:48:40,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:48:41,032 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:48:41,032 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:48:41,347 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:48:41,352 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:48:41,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2019-09-10 01:48:41,353 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:48:41,353 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 01:48:41,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 01:48:41,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2019-09-10 01:48:41,356 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 15 states. [2019-09-10 01:48:41,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:48:41,525 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-09-10 01:48:41,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 01:48:41,526 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 13 [2019-09-10 01:48:41,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:48:41,527 INFO L225 Difference]: With dead ends: 18 [2019-09-10 01:48:41,527 INFO L226 Difference]: Without dead ends: 15 [2019-09-10 01:48:41,528 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=97, Invalid=365, Unknown=0, NotChecked=0, Total=462 [2019-09-10 01:48:41,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-09-10 01:48:41,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-09-10 01:48:41,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-09-10 01:48:41,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-09-10 01:48:41,533 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-09-10 01:48:41,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:48:41,534 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-09-10 01:48:41,534 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 01:48:41,534 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-09-10 01:48:41,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-10 01:48:41,536 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:48:41,536 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:48:41,536 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:48:41,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:48:41,537 INFO L82 PathProgramCache]: Analyzing trace with hash -1031021570, now seen corresponding path program 3 times [2019-09-10 01:48:41,537 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:48:41,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:48:41,538 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:48:41,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:48:41,539 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:48:41,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:48:41,987 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:48:41,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:48:41,987 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:48:41,988 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:48:41,988 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:48:41,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:48:41,988 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:48:42,014 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 01:48:42,014 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 01:48:42,072 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 01:48:42,072 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:48:42,075 WARN L254 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-10 01:48:42,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:48:42,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:48:42,285 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:48:42,285 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:48:42,636 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:48:42,640 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:48:42,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 23 [2019-09-10 01:48:42,640 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:48:42,641 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 01:48:42,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 01:48:42,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=401, Unknown=0, NotChecked=0, Total=506 [2019-09-10 01:48:42,643 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 17 states. [2019-09-10 01:48:42,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:48:42,828 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-09-10 01:48:42,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 01:48:42,829 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 14 [2019-09-10 01:48:42,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:48:42,830 INFO L225 Difference]: With dead ends: 19 [2019-09-10 01:48:42,830 INFO L226 Difference]: Without dead ends: 16 [2019-09-10 01:48:42,831 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=123, Invalid=477, Unknown=0, NotChecked=0, Total=600 [2019-09-10 01:48:42,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-09-10 01:48:42,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-09-10 01:48:42,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-09-10 01:48:42,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-09-10 01:48:42,834 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-09-10 01:48:42,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:48:42,835 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-09-10 01:48:42,835 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 01:48:42,835 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-09-10 01:48:42,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-10 01:48:42,836 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:48:42,836 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:48:42,836 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:48:42,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:48:42,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1860436335, now seen corresponding path program 4 times [2019-09-10 01:48:42,837 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:48:42,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:48:42,838 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:48:42,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:48:42,838 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:48:42,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:48:43,171 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:48:43,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:48:43,171 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:48:43,171 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:48:43,172 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:48:43,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:48:43,172 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 01:48:43,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:48:43,188 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:48:43,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:48:43,245 WARN L254 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-10 01:48:43,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:48:43,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:48:43,527 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:48:43,528 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:48:44,008 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:48:44,012 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:48:44,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 26 [2019-09-10 01:48:44,012 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:48:44,013 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 01:48:44,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 01:48:44,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=516, Unknown=0, NotChecked=0, Total=650 [2019-09-10 01:48:44,014 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 19 states. [2019-09-10 01:48:44,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:48:44,229 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-09-10 01:48:44,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 01:48:44,233 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 15 [2019-09-10 01:48:44,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:48:44,234 INFO L225 Difference]: With dead ends: 20 [2019-09-10 01:48:44,234 INFO L226 Difference]: Without dead ends: 17 [2019-09-10 01:48:44,235 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=153, Invalid=603, Unknown=0, NotChecked=0, Total=756 [2019-09-10 01:48:44,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-09-10 01:48:44,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-09-10 01:48:44,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-09-10 01:48:44,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-09-10 01:48:44,238 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-09-10 01:48:44,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:48:44,239 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-09-10 01:48:44,239 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 01:48:44,239 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-09-10 01:48:44,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-10 01:48:44,240 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:48:44,240 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:48:44,240 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:48:44,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:48:44,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1802490274, now seen corresponding path program 5 times [2019-09-10 01:48:44,241 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:48:44,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:48:44,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:48:44,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:48:44,242 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:48:44,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:48:44,615 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:48:44,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:48:44,616 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:48:44,616 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:48:44,616 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:48:44,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:48:44,617 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-10 01:48:44,635 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 01:48:44,635 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-10 01:48:44,707 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-10 01:48:44,708 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:48:44,709 WARN L254 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-10 01:48:44,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:48:44,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:48:44,870 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:48:44,870 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:48:45,298 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:48:45,302 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:48:45,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 24 [2019-09-10 01:48:45,303 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:48:45,303 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 01:48:45,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 01:48:45,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=440, Unknown=0, NotChecked=0, Total=552 [2019-09-10 01:48:45,304 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2019-09-10 01:48:45,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:48:45,504 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-09-10 01:48:45,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 01:48:45,505 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-09-10 01:48:45,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:48:45,505 INFO L225 Difference]: With dead ends: 21 [2019-09-10 01:48:45,505 INFO L226 Difference]: Without dead ends: 18 [2019-09-10 01:48:45,506 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 16 SyntacticMatches, 5 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=132, Invalid=518, Unknown=0, NotChecked=0, Total=650 [2019-09-10 01:48:45,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-09-10 01:48:45,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-09-10 01:48:45,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-09-10 01:48:45,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-09-10 01:48:45,509 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-09-10 01:48:45,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:48:45,509 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-09-10 01:48:45,510 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 01:48:45,510 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-09-10 01:48:45,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-10 01:48:45,510 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:48:45,510 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:48:45,511 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:48:45,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:48:45,511 INFO L82 PathProgramCache]: Analyzing trace with hash -6162383, now seen corresponding path program 6 times [2019-09-10 01:48:45,511 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:48:45,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:48:45,512 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:48:45,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:48:45,512 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:48:45,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:48:45,945 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:48:45,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:48:45,945 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:48:45,945 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:48:45,946 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:48:45,946 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:48:45,946 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-10 01:48:45,962 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 01:48:45,962 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 01:48:45,985 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 01:48:45,985 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:48:45,986 WARN L254 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-10 01:48:45,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:48:46,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:48:46,294 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:48:46,294 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:48:46,963 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:48:46,967 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:48:46,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 32 [2019-09-10 01:48:46,968 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:48:46,969 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-10 01:48:46,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-10 01:48:46,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=788, Unknown=0, NotChecked=0, Total=992 [2019-09-10 01:48:46,970 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 23 states. [2019-09-10 01:48:47,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:48:47,233 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-09-10 01:48:47,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 01:48:47,234 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 17 [2019-09-10 01:48:47,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:48:47,235 INFO L225 Difference]: With dead ends: 22 [2019-09-10 01:48:47,235 INFO L226 Difference]: Without dead ends: 19 [2019-09-10 01:48:47,236 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=225, Invalid=897, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 01:48:47,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-09-10 01:48:47,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-09-10 01:48:47,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-09-10 01:48:47,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-09-10 01:48:47,239 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-09-10 01:48:47,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:48:47,239 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-09-10 01:48:47,239 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-10 01:48:47,239 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-09-10 01:48:47,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-10 01:48:47,240 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:48:47,240 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:48:47,240 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:48:47,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:48:47,240 INFO L82 PathProgramCache]: Analyzing trace with hash -154572610, now seen corresponding path program 7 times [2019-09-10 01:48:47,241 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:48:47,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:48:47,242 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:48:47,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:48:47,242 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:48:47,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:48:47,691 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-10 01:48:47,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:48:47,692 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:48:47,692 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:48:47,693 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:48:47,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:48:47,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 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:48:47,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:48:47,719 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 01:48:47,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:48:47,865 WARN L254 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-10 01:48:47,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:48:48,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:48:48,234 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-10 01:48:48,235 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:48:48,836 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-10 01:48:48,840 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:48:48,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 35 [2019-09-10 01:48:48,841 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:48:48,841 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-10 01:48:48,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-10 01:48:48,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=945, Unknown=0, NotChecked=0, Total=1190 [2019-09-10 01:48:48,842 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 25 states. [2019-09-10 01:48:49,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:48:49,202 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-09-10 01:48:49,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 01:48:49,203 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 18 [2019-09-10 01:48:49,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:48:49,203 INFO L225 Difference]: With dead ends: 23 [2019-09-10 01:48:49,204 INFO L226 Difference]: Without dead ends: 20 [2019-09-10 01:48:49,204 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=267, Invalid=1065, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 01:48:49,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-09-10 01:48:49,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-09-10 01:48:49,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-09-10 01:48:49,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-09-10 01:48:49,208 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-09-10 01:48:49,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:48:49,208 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-09-10 01:48:49,208 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-10 01:48:49,208 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-09-10 01:48:49,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-10 01:48:49,209 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:48:49,209 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:48:49,209 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:48:49,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:48:49,210 INFO L82 PathProgramCache]: Analyzing trace with hash -460322351, now seen corresponding path program 8 times [2019-09-10 01:48:49,210 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:48:49,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:48:49,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:48:49,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:48:49,211 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:48:49,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:48:49,663 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:48:49,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:48:49,664 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:48:49,664 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:48:49,664 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:48:49,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:48:49,664 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:48:49,675 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 01:48:49,676 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 01:48:49,770 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-09-10 01:48:49,770 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:48:49,772 WARN L254 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 47 conjunts are in the unsatisfiable core [2019-09-10 01:48:49,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:48:49,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:48:49,963 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:48:49,963 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:48:50,605 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:48:50,609 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:48:50,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 30 [2019-09-10 01:48:50,610 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:48:50,610 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 01:48:50,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 01:48:50,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=692, Unknown=0, NotChecked=0, Total=870 [2019-09-10 01:48:50,611 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2019-09-10 01:48:50,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:48:50,890 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-09-10 01:48:50,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 01:48:50,890 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-09-10 01:48:50,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:48:50,891 INFO L225 Difference]: With dead ends: 24 [2019-09-10 01:48:50,891 INFO L226 Difference]: Without dead ends: 21 [2019-09-10 01:48:50,891 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 16 SyntacticMatches, 8 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=201, Invalid=791, Unknown=0, NotChecked=0, Total=992 [2019-09-10 01:48:50,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-09-10 01:48:50,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-09-10 01:48:50,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-09-10 01:48:50,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-09-10 01:48:50,895 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-09-10 01:48:50,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:48:50,895 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-09-10 01:48:50,895 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 01:48:50,895 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-09-10 01:48:50,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-10 01:48:50,896 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:48:50,896 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:48:50,896 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:48:50,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:48:50,897 INFO L82 PathProgramCache]: Analyzing trace with hash -1348629730, now seen corresponding path program 9 times [2019-09-10 01:48:50,897 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:48:50,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:48:50,898 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:48:50,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:48:50,898 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:48:50,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:48:51,365 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:48:51,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:48:51,366 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:48:51,366 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:48:51,366 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:48:51,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:48:51,366 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:48:51,378 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 01:48:51,378 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 01:48:55,706 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 01:48:55,706 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:48:55,708 WARN L254 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 55 conjunts are in the unsatisfiable core [2019-09-10 01:48:55,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:48:57,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:48:57,266 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:48:57,266 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:49:02,548 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:49:02,553 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:49:02,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 41 [2019-09-10 01:49:02,554 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:49:02,554 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-10 01:49:02,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-10 01:49:02,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=338, Invalid=1301, Unknown=1, NotChecked=0, Total=1640 [2019-09-10 01:49:02,555 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 29 states. [2019-09-10 01:49:03,153 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 15 [2019-09-10 01:49:03,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:49:03,259 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-09-10 01:49:03,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 01:49:03,259 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 20 [2019-09-10 01:49:03,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:49:03,260 INFO L225 Difference]: With dead ends: 25 [2019-09-10 01:49:03,260 INFO L226 Difference]: Without dead ends: 22 [2019-09-10 01:49:03,262 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 422 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=362, Invalid=1443, Unknown=1, NotChecked=0, Total=1806 [2019-09-10 01:49:03,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-09-10 01:49:03,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-09-10 01:49:03,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-09-10 01:49:03,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-09-10 01:49:03,265 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-09-10 01:49:03,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:49:03,265 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-09-10 01:49:03,265 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-10 01:49:03,265 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-09-10 01:49:03,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-10 01:49:03,266 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:49:03,266 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:49:03,266 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:49:03,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:49:03,267 INFO L82 PathProgramCache]: Analyzing trace with hash 1178612593, now seen corresponding path program 10 times [2019-09-10 01:49:03,267 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:49:03,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:49:03,268 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:49:03,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:49:03,268 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:49:03,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:49:03,787 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:49:03,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:49:03,787 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:49:03,787 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:49:03,787 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:49:03,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:49:03,788 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-10 01:49:03,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:49:03,799 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 01:49:03,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:49:03,912 WARN L254 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 56 conjunts are in the unsatisfiable core [2019-09-10 01:49:03,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:49:04,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:49:04,413 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:49:04,413 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:49:05,479 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:49:05,484 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:49:05,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 44 [2019-09-10 01:49:05,484 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:49:05,485 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-10 01:49:05,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-10 01:49:05,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=392, Invalid=1500, Unknown=0, NotChecked=0, Total=1892 [2019-09-10 01:49:05,486 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 31 states. [2019-09-10 01:49:05,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:49:05,883 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-09-10 01:49:05,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 01:49:05,884 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 21 [2019-09-10 01:49:05,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:49:05,885 INFO L225 Difference]: With dead ends: 26 [2019-09-10 01:49:05,885 INFO L226 Difference]: Without dead ends: 23 [2019-09-10 01:49:05,886 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 490 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=417, Invalid=1653, Unknown=0, NotChecked=0, Total=2070 [2019-09-10 01:49:05,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-09-10 01:49:05,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-09-10 01:49:05,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-10 01:49:05,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-09-10 01:49:05,889 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-09-10 01:49:05,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:49:05,889 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-09-10 01:49:05,889 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-10 01:49:05,889 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-09-10 01:49:05,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-10 01:49:05,890 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:49:05,890 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:49:05,891 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:49:05,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:49:05,891 INFO L82 PathProgramCache]: Analyzing trace with hash -2081254018, now seen corresponding path program 11 times [2019-09-10 01:49:05,891 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:49:05,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:49:05,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:49:05,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:49:05,892 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:49:05,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:49:06,506 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:49:06,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:49:06,506 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:49:06,507 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:49:06,507 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:49:06,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:49:06,507 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-10 01:49:06,519 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 01:49:06,519 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 01:49:30,777 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-09-10 01:49:30,777 INFO L250 tOrderPrioritization]: Conjunction of SSA is unknown [2019-09-10 01:49:31,254 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-10 01:49:31,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-09-10 01:49:31,255 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:49:31,255 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 01:49:31,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 01:49:31,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2019-09-10 01:49:31,256 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 18 states. [2019-09-10 01:49:31,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:49:31,522 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-09-10 01:49:31,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 01:49:31,523 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 22 [2019-09-10 01:49:31,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:49:31,523 INFO L225 Difference]: With dead ends: 27 [2019-09-10 01:49:31,524 INFO L226 Difference]: Without dead ends: 24 [2019-09-10 01:49:31,524 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2019-09-10 01:49:31,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-09-10 01:49:31,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-09-10 01:49:31,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-09-10 01:49:31,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-09-10 01:49:31,528 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-09-10 01:49:31,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:49:31,528 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-09-10 01:49:31,528 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 01:49:31,528 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-09-10 01:49:31,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-10 01:49:31,529 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:49:31,529 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:49:31,530 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:49:31,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:49:31,530 INFO L82 PathProgramCache]: Analyzing trace with hash -57903855, now seen corresponding path program 12 times [2019-09-10 01:49:31,530 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:49:31,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:49:31,532 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:49:31,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:49:31,532 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:49:31,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:49:32,164 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:49:32,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:49:32,164 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:49:32,165 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:49:32,165 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:49:32,165 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:49:32,165 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-10 01:49:32,176 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 01:49:32,177 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 01:49:32,315 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 01:49:32,315 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:49:32,317 WARN L254 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 63 conjunts are in the unsatisfiable core [2019-09-10 01:49:32,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:49:32,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:49:32,554 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:49:32,555 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:49:33,698 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:49:33,701 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:49:33,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 38 [2019-09-10 01:49:33,701 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:49:33,702 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-10 01:49:33,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-10 01:49:33,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=294, Invalid=1112, Unknown=0, NotChecked=0, Total=1406 [2019-09-10 01:49:33,703 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2019-09-10 01:49:34,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:49:34,094 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-09-10 01:49:34,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 01:49:34,094 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-09-10 01:49:34,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:49:34,095 INFO L225 Difference]: With dead ends: 28 [2019-09-10 01:49:34,095 INFO L226 Difference]: Without dead ends: 25 [2019-09-10 01:49:34,096 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 17 SyntacticMatches, 11 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=321, Invalid=1239, Unknown=0, NotChecked=0, Total=1560 [2019-09-10 01:49:34,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-09-10 01:49:34,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-09-10 01:49:34,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-09-10 01:49:34,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-09-10 01:49:34,100 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2019-09-10 01:49:34,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:49:34,100 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-09-10 01:49:34,100 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-10 01:49:34,100 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-09-10 01:49:34,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-10 01:49:34,101 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:49:34,101 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:49:34,101 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:49:34,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:49:34,101 INFO L82 PathProgramCache]: Analyzing trace with hash -1758558242, now seen corresponding path program 13 times [2019-09-10 01:49:34,102 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:49:34,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:49:34,102 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:49:34,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:49:34,102 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:49:34,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:49:34,643 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 31 [2019-09-10 01:49:34,762 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:49:34,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:49:34,763 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:49:34,763 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:49:34,763 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:49:34,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:49:34,763 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:49:34,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:49:34,773 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 01:49:34,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:49:34,994 WARN L254 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 68 conjunts are in the unsatisfiable core [2019-09-10 01:49:34,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:49:35,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:49:35,668 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:49:35,668 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:49:39,305 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 104 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:49:39,309 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:49:39,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 53 [2019-09-10 01:49:39,309 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:49:39,309 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-10 01:49:39,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-10 01:49:39,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=575, Invalid=2180, Unknown=1, NotChecked=0, Total=2756 [2019-09-10 01:49:39,311 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 37 states. [2019-09-10 01:49:39,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:49:39,805 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-09-10 01:49:39,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 01:49:39,806 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 24 [2019-09-10 01:49:39,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:49:39,807 INFO L225 Difference]: With dead ends: 29 [2019-09-10 01:49:39,807 INFO L226 Difference]: Without dead ends: 26 [2019-09-10 01:49:39,809 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 721 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=603, Invalid=2366, Unknown=1, NotChecked=0, Total=2970 [2019-09-10 01:49:39,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-09-10 01:49:39,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-09-10 01:49:39,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-09-10 01:49:39,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-09-10 01:49:39,812 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2019-09-10 01:49:39,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:49:39,812 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-09-10 01:49:39,812 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-10 01:49:39,812 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-09-10 01:49:39,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-10 01:49:39,813 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:49:39,813 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:49:39,813 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:49:39,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:49:39,814 INFO L82 PathProgramCache]: Analyzing trace with hash 1355730609, now seen corresponding path program 14 times [2019-09-10 01:49:39,814 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:49:39,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:49:39,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:49:39,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:49:39,815 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:49:39,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:49:40,470 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:49:40,470 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:49:40,470 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:49:40,470 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:49:40,471 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:49:40,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:49:40,471 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-10 01:49:40,482 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 01:49:40,482 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 01:49:52,547 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-09-10 01:49:52,548 INFO L250 tOrderPrioritization]: Conjunction of SSA is unknown [2019-09-10 01:49:52,668 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-10 01:49:52,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-09-10 01:49:52,669 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:49:52,669 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 01:49:52,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 01:49:52,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2019-09-10 01:49:52,670 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 21 states. [2019-09-10 01:49:53,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:49:53,037 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-09-10 01:49:53,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 01:49:53,038 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 25 [2019-09-10 01:49:53,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:49:53,039 INFO L225 Difference]: With dead ends: 30 [2019-09-10 01:49:53,039 INFO L226 Difference]: Without dead ends: 27 [2019-09-10 01:49:53,041 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2019-09-10 01:49:53,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-09-10 01:49:53,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-09-10 01:49:53,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-10 01:49:53,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-09-10 01:49:53,044 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2019-09-10 01:49:53,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:49:53,044 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-09-10 01:49:53,045 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 01:49:53,045 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-09-10 01:49:53,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-10 01:49:53,045 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:49:53,045 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:49:53,046 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:49:53,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:49:53,046 INFO L82 PathProgramCache]: Analyzing trace with hash -885562818, now seen corresponding path program 15 times [2019-09-10 01:49:53,046 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:49:53,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:49:53,047 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:49:53,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:49:53,047 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:49:53,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:49:53,803 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:49:53,803 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:49:53,803 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:49:53,803 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:49:53,803 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:49:53,804 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:49:53,804 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 01:49:53,819 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 01:49:53,820 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:49:55,248 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 01:49:55,248 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:49:55,250 WARN L254 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 77 conjunts are in the unsatisfiable core [2019-09-10 01:49:55,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:49:55,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:49:56,030 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:49:56,030 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:49:58,975 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:49:58,980 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:49:58,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 59 [2019-09-10 01:49:58,980 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:49:58,981 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-10 01:49:58,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-10 01:49:58,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=717, Invalid=2705, Unknown=0, NotChecked=0, Total=3422 [2019-09-10 01:49:58,982 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 41 states. [2019-09-10 01:49:59,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:49:59,618 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-09-10 01:49:59,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-10 01:49:59,618 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 26 [2019-09-10 01:49:59,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:49:59,619 INFO L225 Difference]: With dead ends: 31 [2019-09-10 01:49:59,619 INFO L226 Difference]: Without dead ends: 28 [2019-09-10 01:49:59,620 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 900 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=747, Invalid=2913, Unknown=0, NotChecked=0, Total=3660 [2019-09-10 01:49:59,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-09-10 01:49:59,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-09-10 01:49:59,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-09-10 01:49:59,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-09-10 01:49:59,623 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2019-09-10 01:49:59,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:49:59,623 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-09-10 01:49:59,623 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-09-10 01:49:59,623 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-09-10 01:49:59,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-10 01:49:59,624 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:49:59,624 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:49:59,624 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:49:59,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:49:59,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1646182319, now seen corresponding path program 16 times [2019-09-10 01:49:59,624 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:49:59,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:49:59,625 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:49:59,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:49:59,625 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:49:59,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:50:00,377 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:50:00,377 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:50:00,377 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:50:00,377 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:50:00,377 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:50:00,377 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:50:00,377 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-10 01:50:00,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:50:00,390 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 01:50:01,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:50:01,523 WARN L254 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 81 conjunts are in the unsatisfiable core [2019-09-10 01:50:01,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:50:02,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:50:02,859 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:50:02,859 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:50:09,440 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:50:09,444 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:50:09,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 62 [2019-09-10 01:50:09,444 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:50:09,445 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-10 01:50:09,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-10 01:50:09,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=792, Invalid=2988, Unknown=2, NotChecked=0, Total=3782 [2019-09-10 01:50:09,446 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 43 states. [2019-09-10 01:50:10,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:50:10,458 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-09-10 01:50:10,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 01:50:10,459 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 27 [2019-09-10 01:50:10,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:50:10,460 INFO L225 Difference]: With dead ends: 32 [2019-09-10 01:50:10,460 INFO L226 Difference]: Without dead ends: 29 [2019-09-10 01:50:10,462 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 997 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=823, Invalid=3207, Unknown=2, NotChecked=0, Total=4032 [2019-09-10 01:50:10,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-09-10 01:50:10,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-09-10 01:50:10,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-09-10 01:50:10,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-09-10 01:50:10,465 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2019-09-10 01:50:10,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:50:10,466 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-09-10 01:50:10,466 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-10 01:50:10,466 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-09-10 01:50:10,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-10 01:50:10,466 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:50:10,466 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:50:10,468 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:50:10,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:50:10,469 INFO L82 PathProgramCache]: Analyzing trace with hash 544416926, now seen corresponding path program 17 times [2019-09-10 01:50:10,469 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:50:10,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:50:10,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:50:10,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:50:10,470 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:50:10,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:50:11,348 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 33 [2019-09-10 01:50:11,506 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:50:11,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:50:11,507 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:50:11,507 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:50:11,507 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:50:11,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:50:11,507 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) [2019-09-10 01:50:11,529 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 01:50:11,529 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:51:27,098 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-09-10 01:51:27,098 INFO L250 tOrderPrioritization]: Conjunction of SSA is unknown [2019-09-10 01:51:27,652 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-10 01:51:27,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-09-10 01:51:27,652 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:51:27,652 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-10 01:51:27,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-10 01:51:27,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=488, Unknown=0, NotChecked=0, Total=552 [2019-09-10 01:51:27,653 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 24 states. [2019-09-10 01:51:28,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:51:28,170 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-09-10 01:51:28,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-10 01:51:28,171 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 28 [2019-09-10 01:51:28,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:51:28,171 INFO L225 Difference]: With dead ends: 33 [2019-09-10 01:51:28,171 INFO L226 Difference]: Without dead ends: 30 [2019-09-10 01:51:28,172 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=68, Invalid=532, Unknown=0, NotChecked=0, Total=600 [2019-09-10 01:51:28,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-09-10 01:51:28,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-09-10 01:51:28,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-10 01:51:28,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-09-10 01:51:28,174 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2019-09-10 01:51:28,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:51:28,175 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-09-10 01:51:28,175 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-10 01:51:28,175 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-09-10 01:51:28,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-10 01:51:28,176 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:51:28,176 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:51:28,176 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:51:28,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:51:28,176 INFO L82 PathProgramCache]: Analyzing trace with hash -266483215, now seen corresponding path program 18 times [2019-09-10 01:51:28,176 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:51:28,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:51:28,177 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:51:28,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:51:28,177 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:51:28,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:51:29,044 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:51:29,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:51:29,044 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:51:29,044 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:51:29,045 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:51:29,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:51:29,045 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-10 01:51:29,056 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 01:51:29,056 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 01:51:41,101 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 01:51:41,102 INFO L250 tOrderPrioritization]: Conjunction of SSA is unknown [2019-09-10 01:51:41,138 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-10 01:51:41,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-09-10 01:51:41,138 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:51:41,138 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-10 01:51:41,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-10 01:51:41,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=533, Unknown=0, NotChecked=0, Total=600 [2019-09-10 01:51:41,139 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 25 states. [2019-09-10 01:51:41,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:51:41,663 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-09-10 01:51:41,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 01:51:41,664 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 29 [2019-09-10 01:51:41,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:51:41,665 INFO L225 Difference]: With dead ends: 34 [2019-09-10 01:51:41,665 INFO L226 Difference]: Without dead ends: 31 [2019-09-10 01:51:41,666 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=71, Invalid=579, Unknown=0, NotChecked=0, Total=650 [2019-09-10 01:51:41,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-09-10 01:51:41,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-09-10 01:51:41,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-10 01:51:41,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-09-10 01:51:41,671 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2019-09-10 01:51:41,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:51:41,673 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-09-10 01:51:41,673 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-10 01:51:41,674 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-09-10 01:51:41,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-10 01:51:41,676 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:51:41,676 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:51:41,676 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:51:41,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:51:41,677 INFO L82 PathProgramCache]: Analyzing trace with hash 365416190, now seen corresponding path program 19 times [2019-09-10 01:51:41,677 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:51:41,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:51:41,677 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:51:41,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:51:41,678 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:51:41,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:51:42,525 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:51:42,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:51:42,525 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:51:42,525 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:51:42,525 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:51:42,526 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:51:42,526 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-10 01:51:42,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:51:42,540 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 01:51:42,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:51:42,590 WARN L254 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 92 conjunts are in the unsatisfiable core [2019-09-10 01:51:42,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:51:43,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:51:43,586 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:51:43,586 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:51:46,366 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:51:46,369 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:51:46,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 71 [2019-09-10 01:51:46,370 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:51:46,370 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-10 01:51:46,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-10 01:51:46,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1049, Invalid=3921, Unknown=0, NotChecked=0, Total=4970 [2019-09-10 01:51:46,372 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 49 states. [2019-09-10 01:51:47,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:51:47,235 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-09-10 01:51:47,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 01:51:47,235 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 30 [2019-09-10 01:51:47,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:51:47,236 INFO L225 Difference]: With dead ends: 35 [2019-09-10 01:51:47,236 INFO L226 Difference]: Without dead ends: 32 [2019-09-10 01:51:47,239 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1318 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=1083, Invalid=4173, Unknown=0, NotChecked=0, Total=5256 [2019-09-10 01:51:47,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-09-10 01:51:47,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-09-10 01:51:47,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-09-10 01:51:47,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-09-10 01:51:47,242 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2019-09-10 01:51:47,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:51:47,242 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-09-10 01:51:47,243 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-10 01:51:47,243 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-09-10 01:51:47,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-10 01:51:47,243 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:51:47,244 INFO L399 BasicCegarLoop]: trace histogram [21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:51:47,244 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:51:47,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:51:47,244 INFO L82 PathProgramCache]: Analyzing trace with hash -1520538735, now seen corresponding path program 20 times [2019-09-10 01:51:47,244 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:51:47,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:51:47,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:51:47,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:51:47,245 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:51:47,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:51:48,119 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:51:48,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:51:48,119 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:51:48,119 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:51:48,119 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:51:48,120 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:51:48,120 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:51:48,131 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 01:51:48,131 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 01:52:00,523 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-09-10 01:52:00,524 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:52:00,580 WARN L254 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 99 conjunts are in the unsatisfiable core [2019-09-10 01:52:00,583 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:52:03,172 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2019-09-10 01:52:06,082 WARN L188 SmtUtils]: Spent 1.57 s on a formula simplification that was a NOOP. DAG size: 32 [2019-09-10 01:52:06,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:52:06,615 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:52:06,615 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:52:31,866 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:52:31,871 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:52:31,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 60 [2019-09-10 01:52:31,871 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:52:31,872 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-10 01:52:31,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-10 01:52:31,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=773, Invalid=2760, Unknown=7, NotChecked=0, Total=3540 [2019-09-10 01:52:31,873 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 37 states. [2019-09-10 01:52:42,612 WARN L188 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 32 [2019-09-10 01:52:42,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:52:42,695 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-09-10 01:52:42,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-10 01:52:42,696 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 31 [2019-09-10 01:52:42,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:52:42,696 INFO L225 Difference]: With dead ends: 36 [2019-09-10 01:52:42,696 INFO L226 Difference]: Without dead ends: 33 [2019-09-10 01:52:42,699 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 17 SyntacticMatches, 13 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 539 ImplicationChecksByTransitivity, 41.9s TimeCoverageRelationStatistics Valid=808, Invalid=2963, Unknown=11, NotChecked=0, Total=3782 [2019-09-10 01:52:42,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-09-10 01:52:42,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-09-10 01:52:42,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-10 01:52:42,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-09-10 01:52:42,701 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2019-09-10 01:52:42,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:52:42,702 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-09-10 01:52:42,702 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-10 01:52:42,702 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-09-10 01:52:42,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-10 01:52:42,702 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:52:42,702 INFO L399 BasicCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:52:42,703 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:52:42,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:52:42,703 INFO L82 PathProgramCache]: Analyzing trace with hash 144400734, now seen corresponding path program 21 times [2019-09-10 01:52:42,703 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:52:42,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:52:42,704 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:52:42,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:52:42,704 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:52:42,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:52:43,723 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:52:43,724 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:52:43,724 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:52:43,724 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:52:43,724 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:52:43,724 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:52:43,724 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-10 01:52:43,736 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 01:52:43,736 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 01:52:48,836 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 01:52:48,836 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:52:48,838 WARN L254 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 100 conjunts are in the unsatisfiable core [2019-09-10 01:52:48,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:52:49,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:52:50,008 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:52:50,008 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:52:57,058 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:52:57,062 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:52:57,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 77 [2019-09-10 01:52:57,063 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:52:57,063 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-09-10 01:52:57,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-09-10 01:52:57,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1238, Invalid=4613, Unknown=1, NotChecked=0, Total=5852 [2019-09-10 01:52:57,064 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 53 states. [2019-09-10 01:52:58,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:52:58,294 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-09-10 01:52:58,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-10 01:52:58,294 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 32 [2019-09-10 01:52:58,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:52:58,295 INFO L225 Difference]: With dead ends: 37 [2019-09-10 01:52:58,295 INFO L226 Difference]: Without dead ends: 34 [2019-09-10 01:52:58,296 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1556 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=1274, Invalid=4887, Unknown=1, NotChecked=0, Total=6162 [2019-09-10 01:52:58,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-09-10 01:52:58,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-09-10 01:52:58,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-09-10 01:52:58,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-09-10 01:52:58,299 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2019-09-10 01:52:58,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:52:58,299 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-09-10 01:52:58,299 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-09-10 01:52:58,299 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-09-10 01:52:58,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-10 01:52:58,300 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:52:58,300 INFO L399 BasicCegarLoop]: trace histogram [23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:52:58,300 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:52:58,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:52:58,300 INFO L82 PathProgramCache]: Analyzing trace with hash 217916721, now seen corresponding path program 22 times [2019-09-10 01:52:58,301 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:52:58,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:52:58,301 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:52:58,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:52:58,301 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:52:58,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:52:59,371 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:52:59,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:52:59,372 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:52:59,372 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:52:59,372 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:52:59,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:52:59,372 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-10 01:52:59,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:52:59,386 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 01:53:03,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:53:03,457 WARN L254 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 104 conjunts are in the unsatisfiable core [2019-09-10 01:53:03,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:53:04,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:53:04,735 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:53:04,735 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:53:08,941 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:53:08,945 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:53:08,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 80 [2019-09-10 01:53:08,946 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:53:08,946 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-09-10 01:53:08,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-09-10 01:53:08,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1340, Invalid=4980, Unknown=0, NotChecked=0, Total=6320 [2019-09-10 01:53:08,947 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 55 states. [2019-09-10 01:53:09,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:53:09,985 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-09-10 01:53:09,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-10 01:53:09,986 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 33 [2019-09-10 01:53:09,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:53:09,986 INFO L225 Difference]: With dead ends: 38 [2019-09-10 01:53:09,987 INFO L226 Difference]: Without dead ends: 35 [2019-09-10 01:53:09,988 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1684 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=1377, Invalid=5265, Unknown=0, NotChecked=0, Total=6642 [2019-09-10 01:53:09,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-09-10 01:53:09,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-09-10 01:53:09,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-09-10 01:53:09,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-09-10 01:53:09,991 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2019-09-10 01:53:09,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:53:09,991 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-09-10 01:53:09,992 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-09-10 01:53:09,992 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-09-10 01:53:09,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-10 01:53:09,992 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:53:09,992 INFO L399 BasicCegarLoop]: trace histogram [24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:53:09,993 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:53:09,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:53:09,993 INFO L82 PathProgramCache]: Analyzing trace with hash -1798054978, now seen corresponding path program 23 times [2019-09-10 01:53:09,993 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:53:09,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:53:09,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:53:09,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:53:09,994 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:53:10,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:53:11,241 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:53:11,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:53:11,241 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:53:11,241 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:53:11,241 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:53:11,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:53:11,241 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:53:11,252 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 01:53:11,252 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 01:54:15,287 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-09-10 01:54:15,287 INFO L250 tOrderPrioritization]: Conjunction of SSA is unknown [2019-09-10 01:54:17,622 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-10 01:54:17,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-09-10 01:54:17,623 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:54:17,623 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-10 01:54:17,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-10 01:54:17,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=788, Unknown=0, NotChecked=0, Total=870 [2019-09-10 01:54:17,624 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 30 states. [2019-09-10 01:54:18,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:54:18,364 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-09-10 01:54:18,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-10 01:54:18,364 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 34 [2019-09-10 01:54:18,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:54:18,365 INFO L225 Difference]: With dead ends: 39 [2019-09-10 01:54:18,365 INFO L226 Difference]: Without dead ends: 36 [2019-09-10 01:54:18,366 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=86, Invalid=844, Unknown=0, NotChecked=0, Total=930 [2019-09-10 01:54:18,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-09-10 01:54:18,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-09-10 01:54:18,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-09-10 01:54:18,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-09-10 01:54:18,369 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2019-09-10 01:54:18,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:54:18,370 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-09-10 01:54:18,370 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-10 01:54:18,370 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-09-10 01:54:18,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-09-10 01:54:18,370 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:54:18,370 INFO L399 BasicCegarLoop]: trace histogram [25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:54:18,371 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:54:18,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:54:18,371 INFO L82 PathProgramCache]: Analyzing trace with hash 131331793, now seen corresponding path program 24 times [2019-09-10 01:54:18,371 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:54:18,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:54:18,372 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:54:18,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:54:18,372 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:54:18,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:54:19,543 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:54:19,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:54:19,543 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:54:19,544 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:54:19,544 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:54:19,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:54:19,544 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:54:19,554 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 01:54:19,554 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 01:54:34,892 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 01:54:34,893 INFO L250 tOrderPrioritization]: Conjunction of SSA is unknown [2019-09-10 01:54:44,008 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-10 01:54:44,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-09-10 01:54:44,009 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:54:44,009 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-10 01:54:44,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-10 01:54:44,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=845, Unknown=0, NotChecked=0, Total=930 [2019-09-10 01:54:44,009 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 31 states. [2019-09-10 01:54:44,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:54:44,816 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-09-10 01:54:44,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-10 01:54:44,816 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 35 [2019-09-10 01:54:44,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:54:44,817 INFO L225 Difference]: With dead ends: 40 [2019-09-10 01:54:44,817 INFO L226 Difference]: Without dead ends: 37 [2019-09-10 01:54:44,818 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=89, Invalid=903, Unknown=0, NotChecked=0, Total=992 [2019-09-10 01:54:44,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-09-10 01:54:44,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-09-10 01:54:44,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-09-10 01:54:44,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-09-10 01:54:44,821 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2019-09-10 01:54:44,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:54:44,821 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-09-10 01:54:44,821 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-10 01:54:44,822 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-09-10 01:54:44,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-10 01:54:44,822 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:54:44,822 INFO L399 BasicCegarLoop]: trace histogram [26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:54:44,822 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:54:44,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:54:44,823 INFO L82 PathProgramCache]: Analyzing trace with hash -187220450, now seen corresponding path program 25 times [2019-09-10 01:54:44,823 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:54:44,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:54:44,824 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:54:44,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:54:44,824 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:54:44,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:54:45,990 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:54:45,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:54:45,990 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:54:45,990 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:54:45,990 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:54:45,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:54:45,990 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-10 01:54:46,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:54:46,001 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 01:54:58,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2019-09-10 01:54:58,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-10 01:54:58,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-09-10 01:54:58,148 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:54:58,148 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-10 01:54:58,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-10 01:54:58,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=904, Unknown=0, NotChecked=0, Total=992 [2019-09-10 01:54:58,149 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 32 states. [2019-09-10 01:54:59,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:54:59,028 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-09-10 01:54:59,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-10 01:54:59,028 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 36 [2019-09-10 01:54:59,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:54:59,029 INFO L225 Difference]: With dead ends: 41 [2019-09-10 01:54:59,029 INFO L226 Difference]: Without dead ends: 38 [2019-09-10 01:54:59,029 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=92, Invalid=964, Unknown=0, NotChecked=0, Total=1056 [2019-09-10 01:54:59,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-09-10 01:54:59,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-09-10 01:54:59,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-09-10 01:54:59,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-09-10 01:54:59,031 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2019-09-10 01:54:59,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:54:59,032 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-09-10 01:54:59,032 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-10 01:54:59,032 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-09-10 01:54:59,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-09-10 01:54:59,032 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:54:59,033 INFO L399 BasicCegarLoop]: trace histogram [27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:54:59,033 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:54:59,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:54:59,033 INFO L82 PathProgramCache]: Analyzing trace with hash -1472405391, now seen corresponding path program 26 times [2019-09-10 01:54:59,033 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:54:59,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:54:59,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:54:59,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:54:59,034 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:54:59,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:55:00,267 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:55:00,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:55:00,268 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:55:00,268 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:55:00,268 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:55:00,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:55:00,268 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:55:00,278 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 01:55:00,279 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 01:56:43,223 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-09-10 01:56:43,223 INFO L250 tOrderPrioritization]: Conjunction of SSA is unknown [2019-09-10 01:56:43,468 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-10 01:56:43,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-09-10 01:56:43,469 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:56:43,469 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-10 01:56:43,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-10 01:56:43,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=965, Unknown=0, NotChecked=0, Total=1056 [2019-09-10 01:56:43,470 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 33 states. [2019-09-10 01:56:44,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:56:44,415 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-09-10 01:56:44,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-10 01:56:44,415 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 37 [2019-09-10 01:56:44,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:56:44,416 INFO L225 Difference]: With dead ends: 42 [2019-09-10 01:56:44,416 INFO L226 Difference]: Without dead ends: 39 [2019-09-10 01:56:44,417 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=95, Invalid=1027, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 01:56:44,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-09-10 01:56:44,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-09-10 01:56:44,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-10 01:56:44,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-09-10 01:56:44,420 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2019-09-10 01:56:44,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:56:44,421 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-09-10 01:56:44,421 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-10 01:56:44,421 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-09-10 01:56:44,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-10 01:56:44,421 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:56:44,421 INFO L399 BasicCegarLoop]: trace histogram [28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:56:44,422 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:56:44,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:56:44,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1636534398, now seen corresponding path program 27 times [2019-09-10 01:56:44,422 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:56:44,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:56:44,423 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:56:44,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:56:44,423 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:56:44,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:56:45,700 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:56:45,700 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:56:45,700 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:56:45,700 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:56:45,700 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:56:45,700 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:56:45,700 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 01:56:45,716 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 01:56:45,716 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:56:46,361 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 01:56:46,362 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:56:46,364 WARN L254 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 124 conjunts are in the unsatisfiable core [2019-09-10 01:56:46,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:56:48,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:56:48,175 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:56:48,176 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:56:54,032 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:56:54,035 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:56:54,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 95 [2019-09-10 01:56:54,036 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:56:54,036 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-09-10 01:56:54,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-09-10 01:56:54,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1905, Invalid=7025, Unknown=0, NotChecked=0, Total=8930 [2019-09-10 01:56:54,038 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 65 states. [2019-09-10 01:56:55,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:56:55,837 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-09-10 01:56:55,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-10 01:56:55,837 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 38 [2019-09-10 01:56:55,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:56:55,838 INFO L225 Difference]: With dead ends: 43 [2019-09-10 01:56:55,838 INFO L226 Difference]: Without dead ends: 40 [2019-09-10 01:56:55,840 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2394 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=1947, Invalid=7365, Unknown=0, NotChecked=0, Total=9312 [2019-09-10 01:56:55,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-09-10 01:56:55,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-09-10 01:56:55,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-09-10 01:56:55,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-09-10 01:56:55,843 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2019-09-10 01:56:55,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:56:55,843 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-09-10 01:56:55,843 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-09-10 01:56:55,844 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-09-10 01:56:55,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-10 01:56:55,844 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:56:55,844 INFO L399 BasicCegarLoop]: trace histogram [29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:56:55,844 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:56:55,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:56:55,845 INFO L82 PathProgramCache]: Analyzing trace with hash -770579951, now seen corresponding path program 28 times [2019-09-10 01:56:55,845 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:56:55,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:56:55,846 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:56:55,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:56:55,846 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:56:55,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:56:57,183 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:56:57,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:56:57,184 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:56:57,184 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:56:57,184 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:56:57,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:56:57,184 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-10 01:56:57,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:56:57,194 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 01:56:58,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:56:58,509 WARN L254 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 129 conjunts are in the unsatisfiable core [2019-09-10 01:56:58,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:57:00,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:57:00,841 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:57:00,841 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:57:16,310 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:57:16,314 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:57:16,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 98 [2019-09-10 01:57:16,315 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:57:16,315 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-09-10 01:57:16,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-09-10 01:57:16,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2027, Invalid=7476, Unknown=3, NotChecked=0, Total=9506 [2019-09-10 01:57:16,316 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 67 states. [2019-09-10 01:57:18,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:57:18,750 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-09-10 01:57:18,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-10 01:57:18,751 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 39 [2019-09-10 01:57:18,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:57:18,752 INFO L225 Difference]: With dead ends: 44 [2019-09-10 01:57:18,752 INFO L226 Difference]: Without dead ends: 41 [2019-09-10 01:57:18,753 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2550 ImplicationChecksByTransitivity, 19.1s TimeCoverageRelationStatistics Valid=2070, Invalid=7827, Unknown=3, NotChecked=0, Total=9900 [2019-09-10 01:57:18,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-09-10 01:57:18,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-09-10 01:57:18,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-09-10 01:57:18,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-09-10 01:57:18,756 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2019-09-10 01:57:18,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:57:18,756 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-09-10 01:57:18,756 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-09-10 01:57:18,756 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-09-10 01:57:18,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-10 01:57:18,757 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:57:18,757 INFO L399 BasicCegarLoop]: trace histogram [30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:57:18,757 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:57:18,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:57:18,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1918286558, now seen corresponding path program 29 times [2019-09-10 01:57:18,758 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:57:18,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:57:18,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:57:18,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:57:18,759 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:57:18,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:57:20,136 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:57:20,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:57:20,136 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:57:20,136 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:57:20,136 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:57:20,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:57:20,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 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-10 01:57:20,146 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 01:57:20,146 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 01:58:31,435 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-09-10 01:58:31,435 INFO L250 tOrderPrioritization]: Conjunction of SSA is unknown [2019-09-10 01:58:49,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-10 01:58:49,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-09-10 01:58:49,007 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:58:49,007 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-10 01:58:49,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-10 01:58:49,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=1160, Unknown=0, NotChecked=0, Total=1260 [2019-09-10 01:58:49,007 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 36 states. [2019-09-10 01:58:50,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:58:50,116 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-09-10 01:58:50,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-10 01:58:50,117 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 40 [2019-09-10 01:58:50,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:58:50,118 INFO L225 Difference]: With dead ends: 45 [2019-09-10 01:58:50,118 INFO L226 Difference]: Without dead ends: 42 [2019-09-10 01:58:50,119 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=104, Invalid=1228, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 01:58:50,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-10 01:58:50,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-09-10 01:58:50,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-09-10 01:58:50,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-09-10 01:58:50,121 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2019-09-10 01:58:50,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:58:50,122 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-09-10 01:58:50,122 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-10 01:58:50,122 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-09-10 01:58:50,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-10 01:58:50,122 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:58:50,123 INFO L399 BasicCegarLoop]: trace histogram [31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:58:50,123 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:58:50,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:58:50,123 INFO L82 PathProgramCache]: Analyzing trace with hash -626197583, now seen corresponding path program 30 times [2019-09-10 01:58:50,123 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:58:50,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:58:50,124 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:58:50,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:58:50,124 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:58:50,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:58:51,563 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:58:51,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:58:51,564 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:58:51,564 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:58:51,564 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:58:51,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:58:51,564 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:58:51,579 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 01:58:51,579 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 01:58:57,054 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 01:58:57,054 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:58:57,057 WARN L254 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 136 conjunts are in the unsatisfiable core [2019-09-10 01:58:57,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:58:59,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:58:59,115 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:58:59,115 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:59:06,920 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:59:06,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:59:06,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 104 [2019-09-10 01:59:06,925 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:59:06,925 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-09-10 01:59:06,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-09-10 01:59:06,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2292, Invalid=8420, Unknown=0, NotChecked=0, Total=10712 [2019-09-10 01:59:06,926 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 71 states. [2019-09-10 01:59:09,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:59:09,446 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-09-10 01:59:09,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-10 01:59:09,447 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 41 [2019-09-10 01:59:09,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:59:09,447 INFO L225 Difference]: With dead ends: 46 [2019-09-10 01:59:09,448 INFO L226 Difference]: Without dead ends: 43 [2019-09-10 01:59:09,448 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2880 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=2337, Invalid=8793, Unknown=0, NotChecked=0, Total=11130 [2019-09-10 01:59:09,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-09-10 01:59:09,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-09-10 01:59:09,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-09-10 01:59:09,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-09-10 01:59:09,451 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2019-09-10 01:59:09,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:59:09,452 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-09-10 01:59:09,452 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-09-10 01:59:09,452 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-09-10 01:59:09,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-10 01:59:09,452 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:59:09,452 INFO L399 BasicCegarLoop]: trace histogram [32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:59:09,452 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:59:09,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:59:09,453 INFO L82 PathProgramCache]: Analyzing trace with hash 2099172670, now seen corresponding path program 31 times [2019-09-10 01:59:09,453 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:59:09,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:59:09,453 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:59:09,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:59:09,454 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:59:09,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:59:10,980 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:59:10,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:59:10,980 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:59:10,980 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:59:10,980 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:59:10,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:59:10,980 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:59:10,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:59:10,991 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 01:59:16,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:59:16,833 WARN L254 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 140 conjunts are in the unsatisfiable core [2019-09-10 01:59:16,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:59:18,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:59:19,049 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:59:19,049 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:59:27,301 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:59:27,306 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:59:27,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 107 [2019-09-10 01:59:27,306 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:59:27,307 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-09-10 01:59:27,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-09-10 01:59:27,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2428, Invalid=8913, Unknown=1, NotChecked=0, Total=11342 [2019-09-10 01:59:27,308 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 73 states. [2019-09-10 01:59:29,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:59:29,197 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-09-10 01:59:29,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-10 01:59:29,198 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 42 [2019-09-10 01:59:29,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:59:29,198 INFO L225 Difference]: With dead ends: 47 [2019-09-10 01:59:29,199 INFO L226 Difference]: Without dead ends: 44 [2019-09-10 01:59:29,199 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3051 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=2474, Invalid=9297, Unknown=1, NotChecked=0, Total=11772 [2019-09-10 01:59:29,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-09-10 01:59:29,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-09-10 01:59:29,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-09-10 01:59:29,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-09-10 01:59:29,202 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2019-09-10 01:59:29,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:59:29,203 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-09-10 01:59:29,203 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-09-10 01:59:29,203 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-09-10 01:59:29,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-09-10 01:59:29,203 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:59:29,203 INFO L399 BasicCegarLoop]: trace histogram [33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:59:29,204 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:59:29,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:59:29,204 INFO L82 PathProgramCache]: Analyzing trace with hash 686304593, now seen corresponding path program 32 times [2019-09-10 01:59:29,204 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:59:29,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:59:29,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:59:29,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:59:29,205 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:59:29,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:59:31,065 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:59:31,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:59:31,065 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:59:31,065 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:59:31,065 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:59:31,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:59:31,065 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:59:31,075 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 01:59:31,075 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:02:13,969 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-09-10 02:02:13,969 INFO L250 tOrderPrioritization]: Conjunction of SSA is unknown [2019-09-10 02:02:16,966 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-10 02:02:16,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-09-10 02:02:16,967 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:02:16,967 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-10 02:02:16,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-10 02:02:16,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1373, Unknown=0, NotChecked=0, Total=1482 [2019-09-10 02:02:16,968 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 39 states. [2019-09-10 02:02:18,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:02:18,295 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-09-10 02:02:18,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-10 02:02:18,296 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 43 [2019-09-10 02:02:18,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:02:18,297 INFO L225 Difference]: With dead ends: 48 [2019-09-10 02:02:18,297 INFO L226 Difference]: Without dead ends: 45 [2019-09-10 02:02:18,297 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=113, Invalid=1447, Unknown=0, NotChecked=0, Total=1560 [2019-09-10 02:02:18,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-09-10 02:02:18,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-09-10 02:02:18,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-09-10 02:02:18,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-09-10 02:02:18,300 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2019-09-10 02:02:18,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:02:18,300 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-09-10 02:02:18,300 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-10 02:02:18,300 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-09-10 02:02:18,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-10 02:02:18,301 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:02:18,301 INFO L399 BasicCegarLoop]: trace histogram [34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:02:18,301 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:02:18,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:02:18,301 INFO L82 PathProgramCache]: Analyzing trace with hash -162932834, now seen corresponding path program 33 times [2019-09-10 02:02:18,301 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:02:18,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:02:18,302 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:02:18,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:02:18,302 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:02:18,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:02:20,601 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 34 [2019-09-10 02:02:20,942 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:02:20,942 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:02:20,942 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:02:20,942 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:02:20,943 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:02:20,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:02:20,943 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) [2019-09-10 02:02:20,966 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:02:20,966 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:02:21,254 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:02:21,254 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:02:21,257 WARN L254 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 148 conjunts are in the unsatisfiable core [2019-09-10 02:02:21,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:02:23,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:02:23,701 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:02:23,701 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:02:38,500 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:02:38,503 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:02:38,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 113 [2019-09-10 02:02:38,504 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:02:38,504 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-09-10 02:02:38,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-09-10 02:02:38,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2712, Invalid=9941, Unknown=3, NotChecked=0, Total=12656 [2019-09-10 02:02:38,505 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 77 states. [2019-09-10 02:02:41,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:02:41,297 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-09-10 02:02:41,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-10 02:02:41,297 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 44 [2019-09-10 02:02:41,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:02:41,298 INFO L225 Difference]: With dead ends: 49 [2019-09-10 02:02:41,298 INFO L226 Difference]: Without dead ends: 46 [2019-09-10 02:02:41,299 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3409 ImplicationChecksByTransitivity, 19.8s TimeCoverageRelationStatistics Valid=2760, Invalid=10347, Unknown=3, NotChecked=0, Total=13110 [2019-09-10 02:02:41,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-09-10 02:02:41,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-09-10 02:02:41,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-09-10 02:02:41,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-09-10 02:02:41,302 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2019-09-10 02:02:41,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:02:41,302 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-09-10 02:02:41,302 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-09-10 02:02:41,303 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-09-10 02:02:41,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-10 02:02:41,303 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:02:41,303 INFO L399 BasicCegarLoop]: trace histogram [35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:02:41,303 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:02:41,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:02:41,304 INFO L82 PathProgramCache]: Analyzing trace with hash -719489295, now seen corresponding path program 34 times [2019-09-10 02:02:41,304 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:02:41,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:02:41,305 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:02:41,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:02:41,305 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:02:41,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:02:43,100 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:02:43,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:02:43,100 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:02:43,101 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:02:43,101 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:02:43,101 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:02:43,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-10 02:02:43,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:02:43,110 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:02:55,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2019-09-10 02:02:55,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-10 02:02:55,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-09-10 02:02:55,297 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:02:55,297 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-10 02:02:55,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-10 02:02:55,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1525, Unknown=0, NotChecked=0, Total=1640 [2019-09-10 02:02:55,298 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 41 states. [2019-09-10 02:02:56,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:02:56,735 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-09-10 02:02:56,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-10 02:02:56,736 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 45 [2019-09-10 02:02:56,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:02:56,737 INFO L225 Difference]: With dead ends: 50 [2019-09-10 02:02:56,737 INFO L226 Difference]: Without dead ends: 47 [2019-09-10 02:02:56,737 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=119, Invalid=1603, Unknown=0, NotChecked=0, Total=1722 [2019-09-10 02:02:56,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-09-10 02:02:56,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-09-10 02:02:56,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-09-10 02:02:56,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-09-10 02:02:56,740 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2019-09-10 02:02:56,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:02:56,741 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-09-10 02:02:56,741 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-09-10 02:02:56,741 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-09-10 02:02:56,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-10 02:02:56,741 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:02:56,741 INFO L399 BasicCegarLoop]: trace histogram [36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:02:56,742 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:02:56,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:02:56,742 INFO L82 PathProgramCache]: Analyzing trace with hash -792870402, now seen corresponding path program 35 times [2019-09-10 02:02:56,742 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:02:56,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:02:56,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:02:56,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:02:56,743 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:02:56,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat