java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/loop-lit/gj2007.c.i.p+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-03 02:33:25,068 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-03 02:33:25,071 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-03 02:33:25,093 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-03 02:33:25,094 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-03 02:33:25,095 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-03 02:33:25,098 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-03 02:33:25,110 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-03 02:33:25,112 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-03 02:33:25,113 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-03 02:33:25,117 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-03 02:33:25,119 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-03 02:33:25,119 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-03 02:33:25,121 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-03 02:33:25,122 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-03 02:33:25,123 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-03 02:33:25,124 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-03 02:33:25,125 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-03 02:33:25,127 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-03 02:33:25,128 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-03 02:33:25,130 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-03 02:33:25,131 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-03 02:33:25,132 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-03 02:33:25,132 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-03 02:33:25,136 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-03 02:33:25,136 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-03 02:33:25,136 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-03 02:33:25,137 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-03 02:33:25,139 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-03 02:33:25,141 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-03 02:33:25,141 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-03 02:33:25,142 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-03 02:33:25,142 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-03 02:33:25,144 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-03 02:33:25,148 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-03 02:33:25,148 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-03 02:33:25,149 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-03 02:33:25,149 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-03 02:33:25,149 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-03 02:33:25,150 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-03 02:33:25,152 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-03 02:33:25,153 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-10-03 02:33:25,182 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-03 02:33:25,182 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-03 02:33:25,183 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-03 02:33:25,183 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-03 02:33:25,184 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-03 02:33:25,184 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-03 02:33:25,184 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-03 02:33:25,185 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-03 02:33:25,185 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-03 02:33:25,185 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-03 02:33:25,188 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-03 02:33:25,188 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-03 02:33:25,188 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-03 02:33:25,189 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-03 02:33:25,189 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-03 02:33:25,189 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-03 02:33:25,189 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-03 02:33:25,189 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-03 02:33:25,190 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-03 02:33:25,190 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-03 02:33:25,190 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-03 02:33:25,191 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-03 02:33:25,191 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-03 02:33:25,191 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:33:25,191 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-03 02:33:25,192 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-03 02:33:25,192 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-03 02:33:25,192 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-03 02:33:25,192 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-03 02:33:25,192 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-03 02:33:25,229 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-03 02:33:25,241 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-03 02:33:25,245 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-03 02:33:25,246 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-03 02:33:25,247 INFO L275 PluginConnector]: CDTParser initialized [2019-10-03 02:33:25,248 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/gj2007.c.i.p+lhb-reducer.c [2019-10-03 02:33:25,311 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcb56d1ee/3ef4e67a0e7a49bc95148c3d95fb1e38/FLAG6374fba81 [2019-10-03 02:33:25,754 INFO L306 CDTParser]: Found 1 translation units. [2019-10-03 02:33:25,755 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gj2007.c.i.p+lhb-reducer.c [2019-10-03 02:33:25,762 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcb56d1ee/3ef4e67a0e7a49bc95148c3d95fb1e38/FLAG6374fba81 [2019-10-03 02:33:26,122 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcb56d1ee/3ef4e67a0e7a49bc95148c3d95fb1e38 [2019-10-03 02:33:26,133 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-03 02:33:26,135 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-03 02:33:26,136 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-03 02:33:26,136 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-03 02:33:26,140 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-03 02:33:26,141 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:33:26" (1/1) ... [2019-10-03 02:33:26,144 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e7f8ae9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:33:26, skipping insertion in model container [2019-10-03 02:33:26,144 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:33:26" (1/1) ... [2019-10-03 02:33:26,152 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-03 02:33:26,191 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-03 02:33:26,429 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:33:26,437 INFO L188 MainTranslator]: Completed pre-run [2019-10-03 02:33:26,465 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:33:26,565 INFO L192 MainTranslator]: Completed translation [2019-10-03 02:33:26,566 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:33:26 WrapperNode [2019-10-03 02:33:26,566 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-03 02:33:26,567 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-03 02:33:26,567 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-03 02:33:26,567 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-03 02:33:26,580 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:33:26" (1/1) ... [2019-10-03 02:33:26,581 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:33:26" (1/1) ... [2019-10-03 02:33:26,588 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:33:26" (1/1) ... [2019-10-03 02:33:26,589 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:33:26" (1/1) ... [2019-10-03 02:33:26,597 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:33:26" (1/1) ... [2019-10-03 02:33:26,601 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:33:26" (1/1) ... [2019-10-03 02:33:26,602 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:33:26" (1/1) ... [2019-10-03 02:33:26,604 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-03 02:33:26,605 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-03 02:33:26,605 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-03 02:33:26,605 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-03 02:33:26,606 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:33:26" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:33:26,657 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-03 02:33:26,657 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-03 02:33:26,657 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-03 02:33:26,658 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-03 02:33:26,658 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-03 02:33:26,658 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-03 02:33:26,658 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-03 02:33:26,658 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-03 02:33:26,658 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-03 02:33:26,659 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-03 02:33:26,932 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-03 02:33:26,933 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-03 02:33:26,934 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:33:26 BoogieIcfgContainer [2019-10-03 02:33:26,934 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-03 02:33:26,942 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-03 02:33:26,943 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-03 02:33:26,951 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-03 02:33:26,951 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.10 02:33:26" (1/3) ... [2019-10-03 02:33:26,953 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1532e044 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:33:26, skipping insertion in model container [2019-10-03 02:33:26,954 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:33:26" (2/3) ... [2019-10-03 02:33:26,954 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1532e044 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:33:26, skipping insertion in model container [2019-10-03 02:33:26,954 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:33:26" (3/3) ... [2019-10-03 02:33:26,956 INFO L109 eAbstractionObserver]: Analyzing ICFG gj2007.c.i.p+lhb-reducer.c [2019-10-03 02:33:26,968 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-03 02:33:26,976 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-03 02:33:26,991 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-03 02:33:27,016 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-03 02:33:27,016 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-03 02:33:27,016 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-03 02:33:27,017 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-03 02:33:27,017 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-03 02:33:27,017 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-03 02:33:27,017 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-03 02:33:27,017 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-03 02:33:27,031 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2019-10-03 02:33:27,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-03 02:33:27,040 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:33:27,041 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:33:27,042 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:33:27,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:33:27,048 INFO L82 PathProgramCache]: Analyzing trace with hash -535062244, now seen corresponding path program 1 times [2019-10-03 02:33:27,049 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:33:27,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:33:27,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:33:27,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:33:27,095 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:33:27,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:33:27,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:33:27,250 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:33:27,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:33:27,250 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:33:27,256 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:33:27,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:33:27,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:33:27,272 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 3 states. [2019-10-03 02:33:27,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:33:27,502 INFO L93 Difference]: Finished difference Result 51 states and 79 transitions. [2019-10-03 02:33:27,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:33:27,504 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-03 02:33:27,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:33:27,517 INFO L225 Difference]: With dead ends: 51 [2019-10-03 02:33:27,517 INFO L226 Difference]: Without dead ends: 47 [2019-10-03 02:33:27,519 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:33:27,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-10-03 02:33:27,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-10-03 02:33:27,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-10-03 02:33:27,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 58 transitions. [2019-10-03 02:33:27,567 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 58 transitions. Word has length 27 [2019-10-03 02:33:27,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:33:27,567 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 58 transitions. [2019-10-03 02:33:27,568 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:33:27,568 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 58 transitions. [2019-10-03 02:33:27,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-03 02:33:27,569 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:33:27,570 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:33:27,570 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:33:27,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:33:27,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1447563500, now seen corresponding path program 1 times [2019-10-03 02:33:27,571 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:33:27,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:33:27,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:33:27,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:33:27,574 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:33:27,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:33:27,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:33:27,804 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:33:27,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-03 02:33:27,805 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:33:27,807 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-03 02:33:27,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-03 02:33:27,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-10-03 02:33:27,808 INFO L87 Difference]: Start difference. First operand 47 states and 58 transitions. Second operand 12 states. [2019-10-03 02:33:27,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:33:27,933 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2019-10-03 02:33:27,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-03 02:33:27,934 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2019-10-03 02:33:27,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:33:27,935 INFO L225 Difference]: With dead ends: 33 [2019-10-03 02:33:27,935 INFO L226 Difference]: Without dead ends: 33 [2019-10-03 02:33:27,937 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-10-03 02:33:27,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-10-03 02:33:27,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-10-03 02:33:27,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-03 02:33:27,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2019-10-03 02:33:27,942 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 27 [2019-10-03 02:33:27,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:33:27,943 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2019-10-03 02:33:27,943 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-03 02:33:27,943 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2019-10-03 02:33:27,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-03 02:33:27,945 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:33:27,945 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:33:27,945 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:33:27,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:33:27,946 INFO L82 PathProgramCache]: Analyzing trace with hash -880735776, now seen corresponding path program 1 times [2019-10-03 02:33:27,946 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:33:27,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:33:27,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:33:27,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:33:27,948 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:33:27,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:33:27,990 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:33:27,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:33:27,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:33:27,991 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:33:27,992 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:33:27,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:33:27,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:33:27,994 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand 3 states. [2019-10-03 02:33:28,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:33:28,045 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2019-10-03 02:33:28,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:33:28,046 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-03 02:33:28,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:33:28,047 INFO L225 Difference]: With dead ends: 33 [2019-10-03 02:33:28,048 INFO L226 Difference]: Without dead ends: 33 [2019-10-03 02:33:28,048 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:33:28,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-10-03 02:33:28,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-10-03 02:33:28,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-03 02:33:28,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2019-10-03 02:33:28,057 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 29 [2019-10-03 02:33:28,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:33:28,064 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2019-10-03 02:33:28,064 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:33:28,064 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2019-10-03 02:33:28,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-03 02:33:28,066 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:33:28,066 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:33:28,067 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:33:28,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:33:28,067 INFO L82 PathProgramCache]: Analyzing trace with hash -286061766, now seen corresponding path program 1 times [2019-10-03 02:33:28,068 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:33:28,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:33:28,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:33:28,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:33:28,070 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:33:28,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:33:28,275 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:33:28,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:33:28,276 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:33:28,277 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 32 with the following transitions: [2019-10-03 02:33:28,279 INFO L207 CegarAbsIntRunner]: [0], [1], [5], [8], [11], [15], [18], [22], [25], [29], [32], [36], [39], [43], [46], [50], [53], [57], [60], [64], [67], [71], [74], [77], [79], [82], [83], [114], [115], [116] [2019-10-03 02:33:28,331 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 02:33:28,332 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 02:33:28,555 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 02:33:28,559 INFO L272 AbstractInterpreter]: Visited 30 different actions 60 times. Merged at 6 different actions 17 times. Widened at 2 different actions 3 times. Performed 115 root evaluator evaluations with a maximum evaluation depth of 4. Performed 115 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 4 fixpoints after 2 different actions. Largest state had 8 variables. [2019-10-03 02:33:28,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:33:28,565 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 02:33:28,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:33:28,566 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-03 02:33:28,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:33:28,586 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 02:33:28,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:33:28,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-03 02:33:28,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:33:28,678 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:33:28,678 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:33:28,946 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:33:28,952 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:33:28,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 25 [2019-10-03 02:33:28,953 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:33:28,953 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-03 02:33:28,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-03 02:33:28,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-10-03 02:33:28,957 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 14 states. [2019-10-03 02:33:29,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:33:29,066 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2019-10-03 02:33:29,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-03 02:33:29,066 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 31 [2019-10-03 02:33:29,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:33:29,068 INFO L225 Difference]: With dead ends: 37 [2019-10-03 02:33:29,068 INFO L226 Difference]: Without dead ends: 37 [2019-10-03 02:33:29,068 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-10-03 02:33:29,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-10-03 02:33:29,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-10-03 02:33:29,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-03 02:33:29,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2019-10-03 02:33:29,073 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 31 [2019-10-03 02:33:29,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:33:29,073 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2019-10-03 02:33:29,074 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-03 02:33:29,074 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2019-10-03 02:33:29,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-03 02:33:29,075 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:33:29,075 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:33:29,075 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:33:29,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:33:29,076 INFO L82 PathProgramCache]: Analyzing trace with hash -291122700, now seen corresponding path program 2 times [2019-10-03 02:33:29,076 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:33:29,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:33:29,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:33:29,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:33:29,078 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:33:29,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:33:29,252 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:33:29,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:33:29,253 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:33:29,253 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:33:29,253 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:33:29,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:33:29,254 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-10-03 02:33:29,277 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-03 02:33:29,277 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-10-03 02:33:29,309 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-03 02:33:29,310 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-03 02:33:29,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-03 02:33:29,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:33:29,366 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-03 02:33:29,366 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:33:29,421 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-03 02:33:29,425 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:33:29,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 4, 4] total 20 [2019-10-03 02:33:29,425 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:33:29,426 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-03 02:33:29,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-03 02:33:29,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-10-03 02:33:29,428 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 18 states. [2019-10-03 02:33:29,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:33:29,566 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2019-10-03 02:33:29,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-03 02:33:29,567 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 35 [2019-10-03 02:33:29,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:33:29,568 INFO L225 Difference]: With dead ends: 43 [2019-10-03 02:33:29,568 INFO L226 Difference]: Without dead ends: 43 [2019-10-03 02:33:29,569 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-10-03 02:33:29,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-10-03 02:33:29,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2019-10-03 02:33:29,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-10-03 02:33:29,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2019-10-03 02:33:29,573 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 35 [2019-10-03 02:33:29,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:33:29,574 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2019-10-03 02:33:29,574 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-03 02:33:29,574 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2019-10-03 02:33:29,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-03 02:33:29,575 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:33:29,576 INFO L411 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:33:29,576 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:33:29,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:33:29,577 INFO L82 PathProgramCache]: Analyzing trace with hash 1330868616, now seen corresponding path program 3 times [2019-10-03 02:33:29,577 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:33:29,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:33:29,578 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-03 02:33:29,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:33:29,579 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:33:29,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:33:29,829 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:33:29,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:33:29,829 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:33:29,830 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:33:29,830 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:33:29,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:33:29,830 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-10-03 02:33:29,854 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-03 02:33:29,854 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-10-03 02:33:29,873 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-03 02:33:29,874 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-03 02:33:29,875 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-03 02:33:29,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:33:29,891 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 18 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-03 02:33:29,891 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:33:30,343 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 18 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-03 02:33:30,347 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:33:30,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 17] total 34 [2019-10-03 02:33:30,347 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:33:30,349 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-03 02:33:30,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-03 02:33:30,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-10-03 02:33:30,350 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 19 states. [2019-10-03 02:33:30,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:33:30,497 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2019-10-03 02:33:30,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-03 02:33:30,497 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 41 [2019-10-03 02:33:30,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:33:30,498 INFO L225 Difference]: With dead ends: 48 [2019-10-03 02:33:30,498 INFO L226 Difference]: Without dead ends: 48 [2019-10-03 02:33:30,500 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-10-03 02:33:30,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-10-03 02:33:30,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-10-03 02:33:30,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-10-03 02:33:30,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2019-10-03 02:33:30,507 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 41 [2019-10-03 02:33:30,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:33:30,509 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2019-10-03 02:33:30,509 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-03 02:33:30,509 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2019-10-03 02:33:30,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-03 02:33:30,513 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:33:30,513 INFO L411 BasicCegarLoop]: trace histogram [10, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:33:30,513 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:33:30,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:33:30,518 INFO L82 PathProgramCache]: Analyzing trace with hash 924000767, now seen corresponding path program 4 times [2019-10-03 02:33:30,518 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:33:30,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:33:30,520 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-03 02:33:30,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:33:30,520 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:33:30,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:33:30,813 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:33:30,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:33:30,813 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:33:30,814 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:33:30,814 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:33:30,814 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:33:30,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 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 02:33:30,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:33:30,831 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 02:33:30,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:33:30,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-03 02:33:30,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:33:30,870 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 27 proven. 72 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-03 02:33:30,870 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:33:31,432 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 27 proven. 72 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-03 02:33:31,435 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:33:31,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20, 20] total 40 [2019-10-03 02:33:31,435 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:33:31,436 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-03 02:33:31,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-03 02:33:31,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-10-03 02:33:31,439 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 22 states. [2019-10-03 02:33:31,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:33:31,615 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2019-10-03 02:33:31,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-03 02:33:31,616 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 47 [2019-10-03 02:33:31,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:33:31,617 INFO L225 Difference]: With dead ends: 54 [2019-10-03 02:33:31,618 INFO L226 Difference]: Without dead ends: 54 [2019-10-03 02:33:31,619 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-10-03 02:33:31,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-10-03 02:33:31,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-10-03 02:33:31,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-10-03 02:33:31,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2019-10-03 02:33:31,624 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 47 [2019-10-03 02:33:31,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:33:31,624 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2019-10-03 02:33:31,624 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-03 02:33:31,625 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2019-10-03 02:33:31,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-03 02:33:31,625 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:33:31,626 INFO L411 BasicCegarLoop]: trace histogram [13, 11, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:33:31,626 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:33:31,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:33:31,626 INFO L82 PathProgramCache]: Analyzing trace with hash -212574922, now seen corresponding path program 5 times [2019-10-03 02:33:31,626 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:33:31,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:33:31,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:33:31,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:33:31,629 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:33:31,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:33:31,899 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:33:31,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:33:31,899 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:33:31,899 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:33:31,899 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:33:31,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:33:31,900 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) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 02:33:31,917 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-03 02:33:31,917 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-10-03 02:33:31,935 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-10-03 02:33:31,936 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-03 02:33:31,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-03 02:33:31,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:33:31,999 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 55 proven. 4 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2019-10-03 02:33:32,000 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:33:32,084 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 55 proven. 4 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2019-10-03 02:33:32,088 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:33:32,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 5, 5] total 31 [2019-10-03 02:33:32,088 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:33:32,089 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-10-03 02:33:32,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-10-03 02:33:32,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-10-03 02:33:32,090 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 28 states. [2019-10-03 02:33:32,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:33:32,281 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2019-10-03 02:33:32,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-03 02:33:32,282 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 53 [2019-10-03 02:33:32,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:33:32,283 INFO L225 Difference]: With dead ends: 63 [2019-10-03 02:33:32,284 INFO L226 Difference]: Without dead ends: 63 [2019-10-03 02:33:32,285 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-10-03 02:33:32,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-10-03 02:33:32,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2019-10-03 02:33:32,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-10-03 02:33:32,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2019-10-03 02:33:32,291 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 53 [2019-10-03 02:33:32,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:33:32,291 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2019-10-03 02:33:32,291 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-10-03 02:33:32,291 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2019-10-03 02:33:32,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-03 02:33:32,292 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:33:32,293 INFO L411 BasicCegarLoop]: trace histogram [17, 14, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:33:32,293 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:33:32,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:33:32,293 INFO L82 PathProgramCache]: Analyzing trace with hash -87493305, now seen corresponding path program 6 times [2019-10-03 02:33:32,294 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:33:32,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:33:32,295 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-03 02:33:32,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:33:32,295 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:33:32,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:33:32,658 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:33:32,659 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:33:32,659 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:33:32,659 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:33:32,659 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:33:32,659 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:33:32,659 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-10-03 02:33:32,680 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-03 02:33:32,681 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-10-03 02:33:32,719 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-03 02:33:32,719 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-03 02:33:32,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-03 02:33:32,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:33:32,740 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 75 proven. 210 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-03 02:33:32,740 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:33:33,681 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 75 proven. 210 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-03 02:33:33,685 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:33:33,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 26, 26] total 52 [2019-10-03 02:33:33,685 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:33:33,687 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-03 02:33:33,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-03 02:33:33,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-10-03 02:33:33,688 INFO L87 Difference]: Start difference. First operand 62 states and 63 transitions. Second operand 29 states. [2019-10-03 02:33:33,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:33:33,876 INFO L93 Difference]: Finished difference Result 70 states and 71 transitions. [2019-10-03 02:33:33,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-10-03 02:33:33,876 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 61 [2019-10-03 02:33:33,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:33:33,877 INFO L225 Difference]: With dead ends: 70 [2019-10-03 02:33:33,878 INFO L226 Difference]: Without dead ends: 70 [2019-10-03 02:33:33,879 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 99 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-10-03 02:33:33,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-10-03 02:33:33,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-10-03 02:33:33,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-10-03 02:33:33,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2019-10-03 02:33:33,884 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 61 [2019-10-03 02:33:33,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:33:33,884 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2019-10-03 02:33:33,885 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-03 02:33:33,885 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2019-10-03 02:33:33,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-10-03 02:33:33,886 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:33:33,886 INFO L411 BasicCegarLoop]: trace histogram [21, 18, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:33:33,886 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:33:33,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:33:33,887 INFO L82 PathProgramCache]: Analyzing trace with hash 603673275, now seen corresponding path program 7 times [2019-10-03 02:33:33,887 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:33:33,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:33:33,888 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-03 02:33:33,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:33:33,888 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:33:33,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:33:34,505 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:33:34,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:33:34,505 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:33:34,505 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:33:34,506 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:33:34,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:33:34,506 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-10-03 02:33:34,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:33:34,551 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 02:33:34,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:33:34,582 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-03 02:33:34,585 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:33:34,603 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 95 proven. 342 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-03 02:33:34,603 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:33:35,655 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 95 proven. 342 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-03 02:33:35,659 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:33:35,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 30, 30] total 52 [2019-10-03 02:33:35,660 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:33:35,663 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-10-03 02:33:35,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-10-03 02:33:35,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-10-03 02:33:35,664 INFO L87 Difference]: Start difference. First operand 70 states and 71 transitions. Second operand 33 states. [2019-10-03 02:33:35,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:33:35,859 INFO L93 Difference]: Finished difference Result 78 states and 79 transitions. [2019-10-03 02:33:35,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-10-03 02:33:35,859 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 69 [2019-10-03 02:33:35,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:33:35,860 INFO L225 Difference]: With dead ends: 78 [2019-10-03 02:33:35,860 INFO L226 Difference]: Without dead ends: 78 [2019-10-03 02:33:35,862 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 111 SyntacticMatches, 9 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-10-03 02:33:35,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-10-03 02:33:35,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-10-03 02:33:35,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-10-03 02:33:35,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 79 transitions. [2019-10-03 02:33:35,867 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 79 transitions. Word has length 69 [2019-10-03 02:33:35,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:33:35,867 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 79 transitions. [2019-10-03 02:33:35,868 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-10-03 02:33:35,868 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2019-10-03 02:33:35,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-03 02:33:35,869 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:33:35,869 INFO L411 BasicCegarLoop]: trace histogram [25, 22, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:33:35,869 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:33:35,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:33:35,870 INFO L82 PathProgramCache]: Analyzing trace with hash 109247535, now seen corresponding path program 8 times [2019-10-03 02:33:35,870 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:33:35,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:33:35,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:33:35,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:33:35,871 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:33:35,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:33:36,482 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:33:36,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:33:36,482 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:33:36,482 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:33:36,482 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:33:36,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:33:36,483 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-10-03 02:33:36,504 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-03 02:33:36,505 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-10-03 02:33:36,537 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-10-03 02:33:36,537 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-03 02:33:36,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-03 02:33:36,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:33:36,663 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 154 proven. 9 refuted. 0 times theorem prover too weak. 462 trivial. 0 not checked. [2019-10-03 02:33:36,663 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:33:36,785 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 154 proven. 9 refuted. 0 times theorem prover too weak. 462 trivial. 0 not checked. [2019-10-03 02:33:36,788 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:33:36,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 6, 6] total 45 [2019-10-03 02:33:36,789 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:33:36,789 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-10-03 02:33:36,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-10-03 02:33:36,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-10-03 02:33:36,790 INFO L87 Difference]: Start difference. First operand 78 states and 79 transitions. Second operand 41 states. [2019-10-03 02:33:37,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:33:37,016 INFO L93 Difference]: Finished difference Result 89 states and 90 transitions. [2019-10-03 02:33:37,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-10-03 02:33:37,017 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 77 [2019-10-03 02:33:37,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:33:37,018 INFO L225 Difference]: With dead ends: 89 [2019-10-03 02:33:37,018 INFO L226 Difference]: Without dead ends: 89 [2019-10-03 02:33:37,019 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-10-03 02:33:37,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-10-03 02:33:37,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2019-10-03 02:33:37,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-10-03 02:33:37,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 89 transitions. [2019-10-03 02:33:37,027 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 89 transitions. Word has length 77 [2019-10-03 02:33:37,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:33:37,027 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 89 transitions. [2019-10-03 02:33:37,027 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-10-03 02:33:37,027 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 89 transitions. [2019-10-03 02:33:37,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-10-03 02:33:37,028 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:33:37,029 INFO L411 BasicCegarLoop]: trace histogram [30, 26, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:33:37,029 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:33:37,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:33:37,029 INFO L82 PathProgramCache]: Analyzing trace with hash -2002055619, now seen corresponding path program 9 times [2019-10-03 02:33:37,029 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:33:37,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:33:37,031 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-03 02:33:37,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:33:37,031 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:33:37,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:33:37,737 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:33:37,737 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:33:37,737 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:33:37,738 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:33:37,738 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:33:37,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:33:37,738 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-10-03 02:33:37,764 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-03 02:33:37,764 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-10-03 02:33:37,797 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-03 02:33:37,797 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-03 02:33:37,798 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 37 conjunts are in the unsatisfiable core [2019-10-03 02:33:37,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:33:37,821 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 189 proven. 702 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-03 02:33:37,821 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:33:38,767 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 189 proven. 702 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-03 02:33:38,771 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:33:38,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 38, 38] total 52 [2019-10-03 02:33:38,771 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:33:38,772 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-10-03 02:33:38,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-10-03 02:33:38,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-10-03 02:33:38,774 INFO L87 Difference]: Start difference. First operand 88 states and 89 transitions. Second operand 42 states. [2019-10-03 02:33:39,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:33:39,002 INFO L93 Difference]: Finished difference Result 98 states and 99 transitions. [2019-10-03 02:33:39,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-10-03 02:33:39,003 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 87 [2019-10-03 02:33:39,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:33:39,004 INFO L225 Difference]: With dead ends: 98 [2019-10-03 02:33:39,004 INFO L226 Difference]: Without dead ends: 98 [2019-10-03 02:33:39,006 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 139 SyntacticMatches, 26 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 585 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-10-03 02:33:39,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-10-03 02:33:39,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2019-10-03 02:33:39,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-10-03 02:33:39,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 99 transitions. [2019-10-03 02:33:39,011 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 99 transitions. Word has length 87 [2019-10-03 02:33:39,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:33:39,011 INFO L475 AbstractCegarLoop]: Abstraction has 98 states and 99 transitions. [2019-10-03 02:33:39,011 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-10-03 02:33:39,012 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 99 transitions. [2019-10-03 02:33:39,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-03 02:33:39,013 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:33:39,013 INFO L411 BasicCegarLoop]: trace histogram [35, 31, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:33:39,013 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:33:39,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:33:39,014 INFO L82 PathProgramCache]: Analyzing trace with hash -83827794, now seen corresponding path program 10 times [2019-10-03 02:33:39,014 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:33:39,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:33:39,015 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-03 02:33:39,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:33:39,015 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:33:39,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:33:39,823 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:33:39,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:33:39,824 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:33:39,824 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:33:39,824 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:33:39,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:33:39,824 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-10-03 02:33:39,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:33:39,854 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 02:33:39,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:33:39,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 42 conjunts are in the unsatisfiable core [2019-10-03 02:33:39,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:33:39,919 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 224 proven. 992 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-03 02:33:39,920 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:33:40,892 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 224 proven. 992 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-03 02:33:40,902 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:33:40,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 43, 43] total 52 [2019-10-03 02:33:40,902 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:33:40,903 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-10-03 02:33:40,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-10-03 02:33:40,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-10-03 02:33:40,905 INFO L87 Difference]: Start difference. First operand 98 states and 99 transitions. Second operand 47 states. [2019-10-03 02:33:41,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:33:41,160 INFO L93 Difference]: Finished difference Result 108 states and 109 transitions. [2019-10-03 02:33:41,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-10-03 02:33:41,161 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 97 [2019-10-03 02:33:41,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:33:41,162 INFO L225 Difference]: With dead ends: 108 [2019-10-03 02:33:41,162 INFO L226 Difference]: Without dead ends: 108 [2019-10-03 02:33:41,164 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 154 SyntacticMatches, 36 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 810 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-10-03 02:33:41,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-10-03 02:33:41,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2019-10-03 02:33:41,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-10-03 02:33:41,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 109 transitions. [2019-10-03 02:33:41,169 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 109 transitions. Word has length 97 [2019-10-03 02:33:41,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:33:41,170 INFO L475 AbstractCegarLoop]: Abstraction has 108 states and 109 transitions. [2019-10-03 02:33:41,170 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-10-03 02:33:41,170 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 109 transitions. [2019-10-03 02:33:41,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-10-03 02:33:41,171 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:33:41,172 INFO L411 BasicCegarLoop]: trace histogram [40, 36, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:33:41,172 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:33:41,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:33:41,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1220763615, now seen corresponding path program 11 times [2019-10-03 02:33:41,172 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:33:41,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:33:41,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:33:41,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:33:41,174 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:33:41,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:33:42,205 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:33:42,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:33:42,206 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:33:42,206 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:33:42,206 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:33:42,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:33:42,206 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-10-03 02:33:42,240 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-03 02:33:42,241 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-10-03 02:33:42,264 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-10-03 02:33:42,264 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-03 02:33:42,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-03 02:33:42,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:33:42,442 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 324 proven. 16 refuted. 0 times theorem prover too weak. 1260 trivial. 0 not checked. [2019-10-03 02:33:42,443 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:33:42,650 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 324 proven. 16 refuted. 0 times theorem prover too weak. 1260 trivial. 0 not checked. [2019-10-03 02:33:42,654 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:33:42,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 7, 7] total 62 [2019-10-03 02:33:42,654 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:33:42,654 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-10-03 02:33:42,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-10-03 02:33:42,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-10-03 02:33:42,656 INFO L87 Difference]: Start difference. First operand 108 states and 109 transitions. Second operand 57 states. [2019-10-03 02:33:43,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:33:43,027 INFO L93 Difference]: Finished difference Result 121 states and 122 transitions. [2019-10-03 02:33:43,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-10-03 02:33:43,028 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 107 [2019-10-03 02:33:43,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:33:43,029 INFO L225 Difference]: With dead ends: 121 [2019-10-03 02:33:43,030 INFO L226 Difference]: Without dead ends: 121 [2019-10-03 02:33:43,031 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-10-03 02:33:43,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-10-03 02:33:43,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 120. [2019-10-03 02:33:43,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-10-03 02:33:43,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 121 transitions. [2019-10-03 02:33:43,036 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 121 transitions. Word has length 107 [2019-10-03 02:33:43,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:33:43,036 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 121 transitions. [2019-10-03 02:33:43,037 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-10-03 02:33:43,037 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 121 transitions. [2019-10-03 02:33:43,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-10-03 02:33:43,038 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:33:43,038 INFO L411 BasicCegarLoop]: trace histogram [46, 41, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:33:43,038 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:33:43,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:33:43,039 INFO L82 PathProgramCache]: Analyzing trace with hash -34301910, now seen corresponding path program 12 times [2019-10-03 02:33:43,039 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:33:43,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:33:43,040 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-03 02:33:43,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:33:43,041 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:33:43,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:33:44,227 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:33:44,227 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:33:44,228 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:33:44,228 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:33:44,228 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:33:44,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:33:44,228 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-10-03 02:33:44,263 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-03 02:33:44,263 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-10-03 02:33:44,310 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-03 02:33:44,310 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-03 02:33:44,312 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 57 conjunts are in the unsatisfiable core [2019-10-03 02:33:44,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:33:44,369 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:33:44,369 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:33:47,251 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:33:47,255 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:33:47,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 102 [2019-10-03 02:33:47,255 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:33:47,256 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-10-03 02:33:47,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-10-03 02:33:47,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:33:47,260 INFO L87 Difference]: Start difference. First operand 120 states and 121 transitions. Second operand 58 states. [2019-10-03 02:33:47,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:33:47,599 INFO L93 Difference]: Finished difference Result 123 states and 124 transitions. [2019-10-03 02:33:47,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-10-03 02:33:47,600 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 119 [2019-10-03 02:33:47,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:33:47,601 INFO L225 Difference]: With dead ends: 123 [2019-10-03 02:33:47,601 INFO L226 Difference]: Without dead ends: 123 [2019-10-03 02:33:47,606 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 183 SyntacticMatches, 12 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 594 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:33:47,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-10-03 02:33:47,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2019-10-03 02:33:47,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-10-03 02:33:47,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 123 transitions. [2019-10-03 02:33:47,611 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 123 transitions. Word has length 119 [2019-10-03 02:33:47,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:33:47,612 INFO L475 AbstractCegarLoop]: Abstraction has 122 states and 123 transitions. [2019-10-03 02:33:47,612 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-10-03 02:33:47,612 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 123 transitions. [2019-10-03 02:33:47,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-10-03 02:33:47,615 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:33:47,615 INFO L411 BasicCegarLoop]: trace histogram [47, 41, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:33:47,615 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:33:47,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:33:47,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1388064516, now seen corresponding path program 13 times [2019-10-03 02:33:47,616 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:33:47,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:33:47,618 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-03 02:33:47,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:33:47,618 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:33:47,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:33:48,853 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 0 proven. 2209 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:33:48,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:33:48,853 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:33:48,853 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:33:48,853 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:33:48,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:33:48,854 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-10-03 02:33:48,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:33:48,896 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 02:33:48,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:33:48,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 58 conjunts are in the unsatisfiable core [2019-10-03 02:33:48,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:33:48,967 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 0 proven. 2209 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:33:48,967 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:33:51,924 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 0 proven. 2209 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:33:51,927 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:33:51,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 102 [2019-10-03 02:33:51,928 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:33:51,928 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-10-03 02:33:51,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-10-03 02:33:51,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:33:51,930 INFO L87 Difference]: Start difference. First operand 122 states and 123 transitions. Second operand 59 states. [2019-10-03 02:33:52,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:33:52,275 INFO L93 Difference]: Finished difference Result 125 states and 126 transitions. [2019-10-03 02:33:52,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-10-03 02:33:52,275 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 121 [2019-10-03 02:33:52,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:33:52,277 INFO L225 Difference]: With dead ends: 125 [2019-10-03 02:33:52,277 INFO L226 Difference]: Without dead ends: 125 [2019-10-03 02:33:52,278 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 186 SyntacticMatches, 14 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 693 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:33:52,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-10-03 02:33:52,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2019-10-03 02:33:52,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-10-03 02:33:52,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 125 transitions. [2019-10-03 02:33:52,282 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 125 transitions. Word has length 121 [2019-10-03 02:33:52,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:33:52,283 INFO L475 AbstractCegarLoop]: Abstraction has 124 states and 125 transitions. [2019-10-03 02:33:52,283 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-10-03 02:33:52,283 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 125 transitions. [2019-10-03 02:33:52,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-10-03 02:33:52,284 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:33:52,284 INFO L411 BasicCegarLoop]: trace histogram [48, 41, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:33:52,284 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:33:52,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:33:52,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1812367522, now seen corresponding path program 14 times [2019-10-03 02:33:52,285 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:33:52,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:33:52,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:33:52,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:33:52,287 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:33:52,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:33:53,585 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 0 proven. 2304 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:33:53,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:33:53,586 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:33:53,586 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:33:53,586 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:33:53,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:33:53,586 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-10-03 02:33:53,636 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-03 02:33:53,636 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-10-03 02:33:53,663 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-10-03 02:33:53,664 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-03 02:33:53,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-03 02:33:53,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:33:53,674 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 615 proven. 49 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2019-10-03 02:33:53,675 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:33:54,077 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 615 proven. 49 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2019-10-03 02:33:54,080 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:33:54,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 10, 10] total 68 [2019-10-03 02:33:54,081 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:33:54,081 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-10-03 02:33:54,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-10-03 02:33:54,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-10-03 02:33:54,083 INFO L87 Difference]: Start difference. First operand 124 states and 125 transitions. Second operand 60 states. [2019-10-03 02:33:54,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:33:54,403 INFO L93 Difference]: Finished difference Result 127 states and 128 transitions. [2019-10-03 02:33:54,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-10-03 02:33:54,406 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 123 [2019-10-03 02:33:54,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:33:54,407 INFO L225 Difference]: With dead ends: 127 [2019-10-03 02:33:54,407 INFO L226 Difference]: Without dead ends: 127 [2019-10-03 02:33:54,407 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-10-03 02:33:54,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-10-03 02:33:54,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 126. [2019-10-03 02:33:54,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-10-03 02:33:54,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 127 transitions. [2019-10-03 02:33:54,411 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 127 transitions. Word has length 123 [2019-10-03 02:33:54,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:33:54,411 INFO L475 AbstractCegarLoop]: Abstraction has 126 states and 127 transitions. [2019-10-03 02:33:54,411 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-10-03 02:33:54,412 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 127 transitions. [2019-10-03 02:33:54,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-10-03 02:33:54,413 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:33:54,413 INFO L411 BasicCegarLoop]: trace histogram [49, 41, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:33:54,413 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:33:54,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:33:54,414 INFO L82 PathProgramCache]: Analyzing trace with hash 2063995192, now seen corresponding path program 15 times [2019-10-03 02:33:54,414 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:33:54,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:33:54,415 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-03 02:33:54,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:33:54,415 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:33:54,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:33:55,715 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 0 proven. 2401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:33:55,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:33:55,715 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:33:55,715 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:33:55,716 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:33:55,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:33:55,716 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 02:33:55,763 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-03 02:33:55,764 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-10-03 02:33:55,804 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-03 02:33:55,805 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-03 02:33:55,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 60 conjunts are in the unsatisfiable core [2019-10-03 02:33:55,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:33:55,833 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 0 proven. 2401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:33:55,834 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:33:58,830 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 0 proven. 2401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:33:58,833 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:33:58,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 102 [2019-10-03 02:33:58,834 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:33:58,835 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-10-03 02:33:58,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-10-03 02:33:58,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:33:58,837 INFO L87 Difference]: Start difference. First operand 126 states and 127 transitions. Second operand 61 states. [2019-10-03 02:33:59,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:33:59,199 INFO L93 Difference]: Finished difference Result 129 states and 130 transitions. [2019-10-03 02:33:59,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-10-03 02:33:59,200 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 125 [2019-10-03 02:33:59,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:33:59,201 INFO L225 Difference]: With dead ends: 129 [2019-10-03 02:33:59,201 INFO L226 Difference]: Without dead ends: 129 [2019-10-03 02:33:59,202 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 192 SyntacticMatches, 18 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 891 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:33:59,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-10-03 02:33:59,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 128. [2019-10-03 02:33:59,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-10-03 02:33:59,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 129 transitions. [2019-10-03 02:33:59,208 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 129 transitions. Word has length 125 [2019-10-03 02:33:59,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:33:59,209 INFO L475 AbstractCegarLoop]: Abstraction has 128 states and 129 transitions. [2019-10-03 02:33:59,209 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-10-03 02:33:59,209 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 129 transitions. [2019-10-03 02:33:59,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-10-03 02:33:59,210 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:33:59,210 INFO L411 BasicCegarLoop]: trace histogram [50, 41, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:33:59,211 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:33:59,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:33:59,211 INFO L82 PathProgramCache]: Analyzing trace with hash -783049582, now seen corresponding path program 16 times [2019-10-03 02:33:59,211 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:33:59,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:33:59,214 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-03 02:33:59,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:33:59,214 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:33:59,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:34:00,794 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 0 proven. 2500 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:34:00,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:34:00,794 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:34:00,795 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:34:00,795 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:34:00,795 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:34:00,795 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-10-03 02:34:00,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:34:00,848 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 02:34:00,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:34:00,883 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 61 conjunts are in the unsatisfiable core [2019-10-03 02:34:00,885 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:34:00,912 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 0 proven. 2500 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:34:00,912 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:34:03,980 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 0 proven. 2500 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:34:03,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:34:03,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 102 [2019-10-03 02:34:03,983 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:34:03,984 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-10-03 02:34:03,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-10-03 02:34:03,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:34:03,985 INFO L87 Difference]: Start difference. First operand 128 states and 129 transitions. Second operand 62 states. [2019-10-03 02:34:04,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:34:04,304 INFO L93 Difference]: Finished difference Result 131 states and 132 transitions. [2019-10-03 02:34:04,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-10-03 02:34:04,305 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 127 [2019-10-03 02:34:04,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:34:04,307 INFO L225 Difference]: With dead ends: 131 [2019-10-03 02:34:04,307 INFO L226 Difference]: Without dead ends: 131 [2019-10-03 02:34:04,308 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 195 SyntacticMatches, 20 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 990 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:34:04,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-10-03 02:34:04,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2019-10-03 02:34:04,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-10-03 02:34:04,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 131 transitions. [2019-10-03 02:34:04,312 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 131 transitions. Word has length 127 [2019-10-03 02:34:04,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:34:04,313 INFO L475 AbstractCegarLoop]: Abstraction has 130 states and 131 transitions. [2019-10-03 02:34:04,313 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-10-03 02:34:04,313 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 131 transitions. [2019-10-03 02:34:04,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-10-03 02:34:04,314 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:34:04,314 INFO L411 BasicCegarLoop]: trace histogram [51, 41, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:34:04,314 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:34:04,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:34:04,315 INFO L82 PathProgramCache]: Analyzing trace with hash -898909844, now seen corresponding path program 17 times [2019-10-03 02:34:04,315 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:34:04,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:34:04,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:34:04,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:34:04,317 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:34:04,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:34:05,788 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 0 proven. 2601 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:34:05,789 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:34:05,789 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:34:05,789 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:34:05,789 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:34:05,789 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:34:05,789 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 02:34:05,846 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-03 02:34:05,846 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-10-03 02:34:05,880 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-10-03 02:34:05,881 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-03 02:34:05,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-03 02:34:05,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:34:05,894 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 861 proven. 100 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2019-10-03 02:34:05,894 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:34:06,431 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 861 proven. 100 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2019-10-03 02:34:06,435 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:34:06,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 13, 13] total 74 [2019-10-03 02:34:06,435 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:34:06,436 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-10-03 02:34:06,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-10-03 02:34:06,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-10-03 02:34:06,437 INFO L87 Difference]: Start difference. First operand 130 states and 131 transitions. Second operand 63 states. [2019-10-03 02:34:06,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:34:06,831 INFO L93 Difference]: Finished difference Result 133 states and 134 transitions. [2019-10-03 02:34:06,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-10-03 02:34:06,832 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 129 [2019-10-03 02:34:06,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:34:06,833 INFO L225 Difference]: With dead ends: 133 [2019-10-03 02:34:06,833 INFO L226 Difference]: Without dead ends: 133 [2019-10-03 02:34:06,833 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-10-03 02:34:06,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-10-03 02:34:06,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 132. [2019-10-03 02:34:06,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-10-03 02:34:06,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 133 transitions. [2019-10-03 02:34:06,840 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 133 transitions. Word has length 129 [2019-10-03 02:34:06,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:34:06,840 INFO L475 AbstractCegarLoop]: Abstraction has 132 states and 133 transitions. [2019-10-03 02:34:06,840 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-10-03 02:34:06,841 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 133 transitions. [2019-10-03 02:34:06,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-10-03 02:34:06,841 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:34:06,842 INFO L411 BasicCegarLoop]: trace histogram [52, 41, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:34:06,842 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:34:06,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:34:06,842 INFO L82 PathProgramCache]: Analyzing trace with hash -571471930, now seen corresponding path program 18 times [2019-10-03 02:34:06,842 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:34:06,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:34:06,851 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-03 02:34:06,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:34:06,852 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:34:06,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:34:08,295 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 0 proven. 2704 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:34:08,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:34:08,296 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:34:08,296 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:34:08,296 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:34:08,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:34:08,296 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-10-03 02:34:08,357 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-03 02:34:08,357 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-10-03 02:34:08,400 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-03 02:34:08,400 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-03 02:34:08,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 63 conjunts are in the unsatisfiable core [2019-10-03 02:34:08,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:34:08,429 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 0 proven. 2704 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:34:08,429 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:34:11,589 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 0 proven. 2704 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:34:11,592 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:34:11,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 102 [2019-10-03 02:34:11,593 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:34:11,593 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-10-03 02:34:11,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-10-03 02:34:11,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:34:11,595 INFO L87 Difference]: Start difference. First operand 132 states and 133 transitions. Second operand 64 states. [2019-10-03 02:34:11,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:34:11,952 INFO L93 Difference]: Finished difference Result 135 states and 136 transitions. [2019-10-03 02:34:11,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-10-03 02:34:11,953 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 131 [2019-10-03 02:34:11,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:34:11,954 INFO L225 Difference]: With dead ends: 135 [2019-10-03 02:34:11,955 INFO L226 Difference]: Without dead ends: 135 [2019-10-03 02:34:11,956 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 201 SyntacticMatches, 24 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1188 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:34:11,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-10-03 02:34:11,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 134. [2019-10-03 02:34:11,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-10-03 02:34:11,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 135 transitions. [2019-10-03 02:34:11,960 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 135 transitions. Word has length 131 [2019-10-03 02:34:11,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:34:11,960 INFO L475 AbstractCegarLoop]: Abstraction has 134 states and 135 transitions. [2019-10-03 02:34:11,960 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-10-03 02:34:11,960 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 135 transitions. [2019-10-03 02:34:11,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-10-03 02:34:11,961 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:34:11,961 INFO L411 BasicCegarLoop]: trace histogram [53, 41, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:34:11,961 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:34:11,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:34:11,962 INFO L82 PathProgramCache]: Analyzing trace with hash 563750816, now seen corresponding path program 19 times [2019-10-03 02:34:11,962 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:34:11,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:34:11,963 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-03 02:34:11,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:34:11,964 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:34:11,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:34:13,461 INFO L134 CoverageAnalysis]: Checked inductivity of 2809 backedges. 0 proven. 2809 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:34:13,462 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:34:13,462 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:34:13,462 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:34:13,462 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:34:13,462 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:34:13,462 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-10-03 02:34:13,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:34:13,527 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 02:34:13,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:34:13,569 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 64 conjunts are in the unsatisfiable core [2019-10-03 02:34:13,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:34:13,596 INFO L134 CoverageAnalysis]: Checked inductivity of 2809 backedges. 0 proven. 2809 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:34:13,596 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:34:16,585 INFO L134 CoverageAnalysis]: Checked inductivity of 2809 backedges. 0 proven. 2809 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:34:16,588 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:34:16,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 102 [2019-10-03 02:34:16,589 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:34:16,589 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-10-03 02:34:16,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-10-03 02:34:16,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:34:16,590 INFO L87 Difference]: Start difference. First operand 134 states and 135 transitions. Second operand 65 states. [2019-10-03 02:34:17,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:34:17,047 INFO L93 Difference]: Finished difference Result 137 states and 138 transitions. [2019-10-03 02:34:17,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-10-03 02:34:17,052 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 133 [2019-10-03 02:34:17,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:34:17,054 INFO L225 Difference]: With dead ends: 137 [2019-10-03 02:34:17,054 INFO L226 Difference]: Without dead ends: 137 [2019-10-03 02:34:17,056 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 204 SyntacticMatches, 26 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1287 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:34:17,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-10-03 02:34:17,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 136. [2019-10-03 02:34:17,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-10-03 02:34:17,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 137 transitions. [2019-10-03 02:34:17,061 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 137 transitions. Word has length 133 [2019-10-03 02:34:17,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:34:17,062 INFO L475 AbstractCegarLoop]: Abstraction has 136 states and 137 transitions. [2019-10-03 02:34:17,062 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-10-03 02:34:17,062 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 137 transitions. [2019-10-03 02:34:17,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-03 02:34:17,063 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:34:17,064 INFO L411 BasicCegarLoop]: trace histogram [54, 41, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:34:17,064 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:34:17,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:34:17,065 INFO L82 PathProgramCache]: Analyzing trace with hash 591116538, now seen corresponding path program 20 times [2019-10-03 02:34:17,066 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:34:17,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:34:17,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:34:17,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:34:17,070 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:34:17,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:34:19,804 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 0 proven. 2916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:34:19,805 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:34:19,805 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:34:19,805 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:34:19,806 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:34:19,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:34:19,806 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-10-03 02:34:19,929 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-03 02:34:19,930 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-10-03 02:34:19,997 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2019-10-03 02:34:19,997 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-03 02:34:19,998 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-03 02:34:20,000 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:34:20,015 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 1107 proven. 169 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2019-10-03 02:34:20,016 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:34:20,734 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 1107 proven. 169 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2019-10-03 02:34:20,738 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:34:20,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 16, 16] total 80 [2019-10-03 02:34:20,738 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:34:20,738 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-10-03 02:34:20,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-10-03 02:34:20,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-10-03 02:34:20,739 INFO L87 Difference]: Start difference. First operand 136 states and 137 transitions. Second operand 66 states. [2019-10-03 02:34:21,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:34:21,113 INFO L93 Difference]: Finished difference Result 139 states and 140 transitions. [2019-10-03 02:34:21,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-10-03 02:34:21,113 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 135 [2019-10-03 02:34:21,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:34:21,115 INFO L225 Difference]: With dead ends: 139 [2019-10-03 02:34:21,115 INFO L226 Difference]: Without dead ends: 139 [2019-10-03 02:34:21,116 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-10-03 02:34:21,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-10-03 02:34:21,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 138. [2019-10-03 02:34:21,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-10-03 02:34:21,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 139 transitions. [2019-10-03 02:34:21,120 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 139 transitions. Word has length 135 [2019-10-03 02:34:21,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:34:21,120 INFO L475 AbstractCegarLoop]: Abstraction has 138 states and 139 transitions. [2019-10-03 02:34:21,120 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-10-03 02:34:21,121 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 139 transitions. [2019-10-03 02:34:21,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-10-03 02:34:21,121 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:34:21,122 INFO L411 BasicCegarLoop]: trace histogram [55, 41, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:34:21,122 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:34:21,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:34:21,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1119771604, now seen corresponding path program 21 times [2019-10-03 02:34:21,122 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:34:21,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:34:21,124 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-03 02:34:21,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:34:21,124 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:34:21,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:34:22,894 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 0 proven. 3025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:34:22,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:34:22,894 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:34:22,894 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:34:22,894 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:34:22,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:34:22,895 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-10-03 02:34:22,966 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-03 02:34:22,967 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-10-03 02:34:23,011 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-03 02:34:23,011 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-03 02:34:23,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 66 conjunts are in the unsatisfiable core [2019-10-03 02:34:23,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:34:23,032 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 0 proven. 3025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:34:23,033 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:34:26,037 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 0 proven. 3025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:34:26,042 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:34:26,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 102 [2019-10-03 02:34:26,043 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:34:26,043 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-10-03 02:34:26,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-10-03 02:34:26,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:34:26,045 INFO L87 Difference]: Start difference. First operand 138 states and 139 transitions. Second operand 67 states. [2019-10-03 02:34:26,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:34:26,406 INFO L93 Difference]: Finished difference Result 141 states and 142 transitions. [2019-10-03 02:34:26,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-10-03 02:34:26,406 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 137 [2019-10-03 02:34:26,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:34:26,408 INFO L225 Difference]: With dead ends: 141 [2019-10-03 02:34:26,408 INFO L226 Difference]: Without dead ends: 141 [2019-10-03 02:34:26,409 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 210 SyntacticMatches, 30 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1485 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:34:26,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-10-03 02:34:26,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 140. [2019-10-03 02:34:26,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-10-03 02:34:26,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 141 transitions. [2019-10-03 02:34:26,413 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 141 transitions. Word has length 137 [2019-10-03 02:34:26,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:34:26,413 INFO L475 AbstractCegarLoop]: Abstraction has 140 states and 141 transitions. [2019-10-03 02:34:26,413 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-10-03 02:34:26,413 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 141 transitions. [2019-10-03 02:34:26,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-10-03 02:34:26,414 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:34:26,414 INFO L411 BasicCegarLoop]: trace histogram [56, 41, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:34:26,415 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:34:26,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:34:26,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1943818194, now seen corresponding path program 22 times [2019-10-03 02:34:26,415 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:34:26,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:34:26,417 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-03 02:34:26,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:34:26,417 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:34:26,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:34:28,016 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 0 proven. 3136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:34:28,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:34:28,017 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:34:28,017 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:34:28,017 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:34:28,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:34:28,017 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-10-03 02:34:28,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:34:28,117 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 02:34:28,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:34:28,165 INFO L256 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 67 conjunts are in the unsatisfiable core [2019-10-03 02:34:28,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:34:28,196 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 0 proven. 3136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:34:28,196 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:34:31,548 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 0 proven. 3136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:34:31,553 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:34:31,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 102 [2019-10-03 02:34:31,554 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:34:31,554 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-10-03 02:34:31,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-10-03 02:34:31,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:34:31,555 INFO L87 Difference]: Start difference. First operand 140 states and 141 transitions. Second operand 68 states. [2019-10-03 02:34:31,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:34:31,919 INFO L93 Difference]: Finished difference Result 143 states and 144 transitions. [2019-10-03 02:34:31,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-10-03 02:34:31,920 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 139 [2019-10-03 02:34:31,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:34:31,925 INFO L225 Difference]: With dead ends: 143 [2019-10-03 02:34:31,925 INFO L226 Difference]: Without dead ends: 143 [2019-10-03 02:34:31,925 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 213 SyntacticMatches, 32 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1584 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:34:31,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-10-03 02:34:31,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 142. [2019-10-03 02:34:31,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-10-03 02:34:31,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 143 transitions. [2019-10-03 02:34:31,928 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 143 transitions. Word has length 139 [2019-10-03 02:34:31,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:34:31,928 INFO L475 AbstractCegarLoop]: Abstraction has 142 states and 143 transitions. [2019-10-03 02:34:31,928 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-10-03 02:34:31,929 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 143 transitions. [2019-10-03 02:34:31,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-03 02:34:31,929 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:34:31,929 INFO L411 BasicCegarLoop]: trace histogram [57, 41, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:34:31,929 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:34:31,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:34:31,930 INFO L82 PathProgramCache]: Analyzing trace with hash 293950984, now seen corresponding path program 23 times [2019-10-03 02:34:31,930 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:34:31,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:34:31,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:34:31,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:34:31,932 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:34:31,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:34:34,001 INFO L134 CoverageAnalysis]: Checked inductivity of 3249 backedges. 0 proven. 3249 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:34:34,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:34:34,001 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:34:34,002 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:34:34,002 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:34:34,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:34:34,002 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-10-03 02:34:34,101 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-03 02:34:34,101 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-10-03 02:34:34,149 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2019-10-03 02:34:34,149 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-03 02:34:34,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-03 02:34:34,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:34:34,168 INFO L134 CoverageAnalysis]: Checked inductivity of 3249 backedges. 1353 proven. 256 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2019-10-03 02:34:34,168 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:34:35,066 INFO L134 CoverageAnalysis]: Checked inductivity of 3249 backedges. 1353 proven. 256 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2019-10-03 02:34:35,069 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:34:35,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 19, 19] total 86 [2019-10-03 02:34:35,070 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:34:35,070 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-10-03 02:34:35,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-10-03 02:34:35,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-10-03 02:34:35,071 INFO L87 Difference]: Start difference. First operand 142 states and 143 transitions. Second operand 69 states. [2019-10-03 02:34:35,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:34:35,461 INFO L93 Difference]: Finished difference Result 145 states and 146 transitions. [2019-10-03 02:34:35,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-10-03 02:34:35,462 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 141 [2019-10-03 02:34:35,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:34:35,463 INFO L225 Difference]: With dead ends: 145 [2019-10-03 02:34:35,463 INFO L226 Difference]: Without dead ends: 145 [2019-10-03 02:34:35,464 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 266 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-10-03 02:34:35,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-10-03 02:34:35,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 144. [2019-10-03 02:34:35,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-10-03 02:34:35,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 145 transitions. [2019-10-03 02:34:35,467 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 145 transitions. Word has length 141 [2019-10-03 02:34:35,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:34:35,468 INFO L475 AbstractCegarLoop]: Abstraction has 144 states and 145 transitions. [2019-10-03 02:34:35,468 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-10-03 02:34:35,468 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 145 transitions. [2019-10-03 02:34:35,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-03 02:34:35,469 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:34:35,469 INFO L411 BasicCegarLoop]: trace histogram [58, 41, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:34:35,469 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:34:35,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:34:35,470 INFO L82 PathProgramCache]: Analyzing trace with hash -988484254, now seen corresponding path program 24 times [2019-10-03 02:34:35,470 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:34:35,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:34:35,471 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-03 02:34:35,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:34:35,471 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:34:35,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:34:37,554 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 0 proven. 3364 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:34:37,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:34:37,555 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:34:37,555 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:34:37,555 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:34:37,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:34:37,555 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-10-03 02:34:37,663 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-03 02:34:37,663 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-10-03 02:34:37,708 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-03 02:34:37,708 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-03 02:34:37,710 INFO L256 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 69 conjunts are in the unsatisfiable core [2019-10-03 02:34:37,712 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:34:37,739 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 0 proven. 3364 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:34:37,740 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:34:40,863 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 0 proven. 3364 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:34:40,867 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:34:40,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 102 [2019-10-03 02:34:40,868 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:34:40,868 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-10-03 02:34:40,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-10-03 02:34:40,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:34:40,869 INFO L87 Difference]: Start difference. First operand 144 states and 145 transitions. Second operand 70 states. [2019-10-03 02:34:41,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:34:41,242 INFO L93 Difference]: Finished difference Result 147 states and 148 transitions. [2019-10-03 02:34:41,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-10-03 02:34:41,243 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 143 [2019-10-03 02:34:41,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:34:41,244 INFO L225 Difference]: With dead ends: 147 [2019-10-03 02:34:41,244 INFO L226 Difference]: Without dead ends: 147 [2019-10-03 02:34:41,245 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 219 SyntacticMatches, 36 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1782 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:34:41,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-10-03 02:34:41,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 146. [2019-10-03 02:34:41,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-10-03 02:34:41,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 147 transitions. [2019-10-03 02:34:41,248 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 147 transitions. Word has length 143 [2019-10-03 02:34:41,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:34:41,249 INFO L475 AbstractCegarLoop]: Abstraction has 146 states and 147 transitions. [2019-10-03 02:34:41,249 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-10-03 02:34:41,249 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 147 transitions. [2019-10-03 02:34:41,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-03 02:34:41,250 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:34:41,250 INFO L411 BasicCegarLoop]: trace histogram [59, 41, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:34:41,250 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:34:41,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:34:41,250 INFO L82 PathProgramCache]: Analyzing trace with hash -753134020, now seen corresponding path program 25 times [2019-10-03 02:34:41,251 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:34:41,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:34:41,252 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-03 02:34:41,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:34:41,253 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:34:41,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:34:43,329 INFO L134 CoverageAnalysis]: Checked inductivity of 3481 backedges. 0 proven. 3481 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:34:43,330 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:34:43,330 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:34:43,330 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:34:43,330 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:34:43,330 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:34:43,330 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-10-03 02:34:43,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:34:43,425 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 02:34:43,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:34:43,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 70 conjunts are in the unsatisfiable core [2019-10-03 02:34:43,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:34:43,499 INFO L134 CoverageAnalysis]: Checked inductivity of 3481 backedges. 0 proven. 3481 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:34:43,499 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:34:46,624 INFO L134 CoverageAnalysis]: Checked inductivity of 3481 backedges. 0 proven. 3481 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:34:46,628 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:34:46,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 102 [2019-10-03 02:34:46,628 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:34:46,632 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-10-03 02:34:46,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-10-03 02:34:46,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:34:46,634 INFO L87 Difference]: Start difference. First operand 146 states and 147 transitions. Second operand 71 states. [2019-10-03 02:34:47,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:34:47,037 INFO L93 Difference]: Finished difference Result 149 states and 150 transitions. [2019-10-03 02:34:47,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-10-03 02:34:47,038 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 145 [2019-10-03 02:34:47,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:34:47,040 INFO L225 Difference]: With dead ends: 149 [2019-10-03 02:34:47,040 INFO L226 Difference]: Without dead ends: 149 [2019-10-03 02:34:47,041 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 222 SyntacticMatches, 38 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1881 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:34:47,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-10-03 02:34:47,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 148. [2019-10-03 02:34:47,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-10-03 02:34:47,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 149 transitions. [2019-10-03 02:34:47,045 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 149 transitions. Word has length 145 [2019-10-03 02:34:47,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:34:47,046 INFO L475 AbstractCegarLoop]: Abstraction has 148 states and 149 transitions. [2019-10-03 02:34:47,046 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-10-03 02:34:47,046 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 149 transitions. [2019-10-03 02:34:47,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-03 02:34:47,047 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:34:47,047 INFO L411 BasicCegarLoop]: trace histogram [60, 41, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:34:47,047 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:34:47,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:34:47,047 INFO L82 PathProgramCache]: Analyzing trace with hash 2080141462, now seen corresponding path program 26 times [2019-10-03 02:34:47,047 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:34:47,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:34:47,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:34:47,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:34:47,049 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:34:47,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:34:48,959 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 0 proven. 3600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:34:48,959 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:34:48,960 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:34:48,960 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:34:48,960 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:34:48,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:34:48,960 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-10-03 02:34:49,061 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-03 02:34:49,061 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-10-03 02:34:49,159 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2019-10-03 02:34:49,159 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-03 02:34:49,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-03 02:34:49,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:34:49,191 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 1599 proven. 361 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2019-10-03 02:34:49,192 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:34:50,433 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 1599 proven. 361 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2019-10-03 02:34:50,437 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:34:50,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 22, 22] total 92 [2019-10-03 02:34:50,437 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:34:50,438 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-10-03 02:34:50,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-10-03 02:34:50,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-10-03 02:34:50,440 INFO L87 Difference]: Start difference. First operand 148 states and 149 transitions. Second operand 72 states. [2019-10-03 02:34:50,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:34:50,845 INFO L93 Difference]: Finished difference Result 151 states and 152 transitions. [2019-10-03 02:34:50,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-10-03 02:34:50,846 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 147 [2019-10-03 02:34:50,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:34:50,848 INFO L225 Difference]: With dead ends: 151 [2019-10-03 02:34:50,848 INFO L226 Difference]: Without dead ends: 151 [2019-10-03 02:34:50,849 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 275 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-10-03 02:34:50,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-10-03 02:34:50,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 150. [2019-10-03 02:34:50,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-10-03 02:34:50,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 151 transitions. [2019-10-03 02:34:50,853 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 151 transitions. Word has length 147 [2019-10-03 02:34:50,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:34:50,854 INFO L475 AbstractCegarLoop]: Abstraction has 150 states and 151 transitions. [2019-10-03 02:34:50,854 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-10-03 02:34:50,854 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 151 transitions. [2019-10-03 02:34:50,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-10-03 02:34:50,855 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:34:50,855 INFO L411 BasicCegarLoop]: trace histogram [61, 41, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:34:50,857 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:34:50,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:34:50,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1848614000, now seen corresponding path program 27 times [2019-10-03 02:34:50,857 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:34:50,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:34:50,859 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-03 02:34:50,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:34:50,859 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:34:50,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:34:52,932 INFO L134 CoverageAnalysis]: Checked inductivity of 3721 backedges. 0 proven. 3721 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:34:52,933 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:34:52,933 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:34:52,933 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:34:52,933 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:34:52,933 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:34:52,933 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 02:34:53,041 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-03 02:34:53,041 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-10-03 02:34:53,095 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-03 02:34:53,095 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-03 02:34:53,097 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 72 conjunts are in the unsatisfiable core [2019-10-03 02:34:53,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:34:53,131 INFO L134 CoverageAnalysis]: Checked inductivity of 3721 backedges. 0 proven. 3721 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:34:53,131 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:34:56,340 INFO L134 CoverageAnalysis]: Checked inductivity of 3721 backedges. 0 proven. 3721 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:34:56,343 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:34:56,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 102 [2019-10-03 02:34:56,343 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:34:56,344 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-10-03 02:34:56,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-10-03 02:34:56,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:34:56,346 INFO L87 Difference]: Start difference. First operand 150 states and 151 transitions. Second operand 73 states. [2019-10-03 02:34:56,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:34:56,723 INFO L93 Difference]: Finished difference Result 153 states and 154 transitions. [2019-10-03 02:34:56,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-10-03 02:34:56,723 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 149 [2019-10-03 02:34:56,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:34:56,725 INFO L225 Difference]: With dead ends: 153 [2019-10-03 02:34:56,725 INFO L226 Difference]: Without dead ends: 153 [2019-10-03 02:34:56,726 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 228 SyntacticMatches, 42 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2079 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:34:56,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-10-03 02:34:56,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 152. [2019-10-03 02:34:56,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-10-03 02:34:56,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 153 transitions. [2019-10-03 02:34:56,730 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 153 transitions. Word has length 149 [2019-10-03 02:34:56,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:34:56,730 INFO L475 AbstractCegarLoop]: Abstraction has 152 states and 153 transitions. [2019-10-03 02:34:56,730 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-10-03 02:34:56,730 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 153 transitions. [2019-10-03 02:34:56,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-10-03 02:34:56,731 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:34:56,732 INFO L411 BasicCegarLoop]: trace histogram [62, 41, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:34:56,732 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:34:56,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:34:56,732 INFO L82 PathProgramCache]: Analyzing trace with hash -1605944886, now seen corresponding path program 28 times [2019-10-03 02:34:56,732 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:34:56,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:34:56,734 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-03 02:34:56,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:34:56,735 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:34:56,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:34:58,706 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 0 proven. 3844 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:34:58,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:34:58,706 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:34:58,706 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:34:58,706 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:34:58,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:34:58,706 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-10-03 02:34:58,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:34:58,824 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 02:34:58,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:34:58,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 73 conjunts are in the unsatisfiable core [2019-10-03 02:34:58,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:34:58,898 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 0 proven. 3844 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:34:58,898 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:35:02,068 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 0 proven. 3844 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:35:02,072 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:35:02,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 102 [2019-10-03 02:35:02,072 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:35:02,072 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-10-03 02:35:02,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-10-03 02:35:02,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:35:02,080 INFO L87 Difference]: Start difference. First operand 152 states and 153 transitions. Second operand 74 states. [2019-10-03 02:35:02,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:35:02,453 INFO L93 Difference]: Finished difference Result 155 states and 156 transitions. [2019-10-03 02:35:02,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-10-03 02:35:02,454 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 151 [2019-10-03 02:35:02,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:35:02,455 INFO L225 Difference]: With dead ends: 155 [2019-10-03 02:35:02,455 INFO L226 Difference]: Without dead ends: 155 [2019-10-03 02:35:02,456 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 231 SyntacticMatches, 44 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2178 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:35:02,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-10-03 02:35:02,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 154. [2019-10-03 02:35:02,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-10-03 02:35:02,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 155 transitions. [2019-10-03 02:35:02,460 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 155 transitions. Word has length 151 [2019-10-03 02:35:02,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:35:02,461 INFO L475 AbstractCegarLoop]: Abstraction has 154 states and 155 transitions. [2019-10-03 02:35:02,461 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-10-03 02:35:02,461 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 155 transitions. [2019-10-03 02:35:02,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-10-03 02:35:02,462 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:35:02,462 INFO L411 BasicCegarLoop]: trace histogram [63, 41, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:35:02,462 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:35:02,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:35:02,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1427314524, now seen corresponding path program 29 times [2019-10-03 02:35:02,463 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:35:02,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:35:02,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:35:02,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:35:02,465 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:35:02,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:35:04,582 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 0 proven. 3969 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:35:04,583 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:35:04,583 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:35:04,583 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:35:04,583 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:35:04,583 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:35:04,583 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-10-03 02:35:04,695 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-03 02:35:04,695 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-10-03 02:35:04,796 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2019-10-03 02:35:04,796 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-03 02:35:04,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-03 02:35:04,799 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:35:04,818 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 1845 proven. 484 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2019-10-03 02:35:04,818 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:35:06,237 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 1845 proven. 484 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2019-10-03 02:35:06,240 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:35:06,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 25, 25] total 98 [2019-10-03 02:35:06,241 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:35:06,241 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-10-03 02:35:06,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-10-03 02:35:06,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-10-03 02:35:06,243 INFO L87 Difference]: Start difference. First operand 154 states and 155 transitions. Second operand 75 states. [2019-10-03 02:35:06,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:35:06,681 INFO L93 Difference]: Finished difference Result 157 states and 158 transitions. [2019-10-03 02:35:06,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-10-03 02:35:06,682 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 153 [2019-10-03 02:35:06,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:35:06,684 INFO L225 Difference]: With dead ends: 157 [2019-10-03 02:35:06,684 INFO L226 Difference]: Without dead ends: 157 [2019-10-03 02:35:06,685 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 284 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-10-03 02:35:06,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-10-03 02:35:06,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 156. [2019-10-03 02:35:06,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-10-03 02:35:06,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 157 transitions. [2019-10-03 02:35:06,689 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 157 transitions. Word has length 153 [2019-10-03 02:35:06,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:35:06,690 INFO L475 AbstractCegarLoop]: Abstraction has 156 states and 157 transitions. [2019-10-03 02:35:06,690 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-10-03 02:35:06,690 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 157 transitions. [2019-10-03 02:35:06,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-10-03 02:35:06,692 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:35:06,692 INFO L411 BasicCegarLoop]: trace histogram [64, 41, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:35:06,692 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:35:06,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:35:06,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1562228482, now seen corresponding path program 30 times [2019-10-03 02:35:06,693 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:35:06,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:35:06,695 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-03 02:35:06,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:35:06,695 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:35:06,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:35:08,780 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 0 proven. 4096 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:35:08,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:35:08,780 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:35:08,780 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:35:08,780 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:35:08,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:35:08,781 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-10-03 02:35:08,897 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-03 02:35:08,897 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-10-03 02:35:08,958 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-03 02:35:08,958 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-03 02:35:08,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 75 conjunts are in the unsatisfiable core [2019-10-03 02:35:08,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:35:08,996 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 0 proven. 4096 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:35:08,996 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:35:12,324 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 0 proven. 4096 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:35:12,328 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:35:12,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 102 [2019-10-03 02:35:12,328 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:35:12,329 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-10-03 02:35:12,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-10-03 02:35:12,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:35:12,330 INFO L87 Difference]: Start difference. First operand 156 states and 157 transitions. Second operand 76 states. [2019-10-03 02:35:12,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:35:12,774 INFO L93 Difference]: Finished difference Result 159 states and 160 transitions. [2019-10-03 02:35:12,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-10-03 02:35:12,774 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 155 [2019-10-03 02:35:12,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:35:12,775 INFO L225 Difference]: With dead ends: 159 [2019-10-03 02:35:12,775 INFO L226 Difference]: Without dead ends: 159 [2019-10-03 02:35:12,776 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 237 SyntacticMatches, 48 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2376 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:35:12,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-10-03 02:35:12,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 158. [2019-10-03 02:35:12,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-10-03 02:35:12,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 159 transitions. [2019-10-03 02:35:12,779 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 159 transitions. Word has length 155 [2019-10-03 02:35:12,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:35:12,779 INFO L475 AbstractCegarLoop]: Abstraction has 158 states and 159 transitions. [2019-10-03 02:35:12,779 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-10-03 02:35:12,779 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 159 transitions. [2019-10-03 02:35:12,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-10-03 02:35:12,780 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:35:12,781 INFO L411 BasicCegarLoop]: trace histogram [65, 41, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:35:12,781 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:35:12,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:35:12,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1929444056, now seen corresponding path program 31 times [2019-10-03 02:35:12,781 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:35:12,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:35:12,783 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-03 02:35:12,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:35:12,784 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:35:12,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:35:14,953 INFO L134 CoverageAnalysis]: Checked inductivity of 4225 backedges. 0 proven. 4225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:35:14,953 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:35:14,953 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:35:14,954 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:35:14,954 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:35:14,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:35:14,954 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-10-03 02:35:15,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:35:15,070 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 02:35:15,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:35:15,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 76 conjunts are in the unsatisfiable core [2019-10-03 02:35:15,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:35:15,162 INFO L134 CoverageAnalysis]: Checked inductivity of 4225 backedges. 0 proven. 4225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:35:15,162 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:35:18,689 INFO L134 CoverageAnalysis]: Checked inductivity of 4225 backedges. 0 proven. 4225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:35:18,693 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:35:18,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 102 [2019-10-03 02:35:18,693 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:35:18,694 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-10-03 02:35:18,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-10-03 02:35:18,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:35:18,695 INFO L87 Difference]: Start difference. First operand 158 states and 159 transitions. Second operand 77 states. [2019-10-03 02:35:19,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:35:19,117 INFO L93 Difference]: Finished difference Result 161 states and 162 transitions. [2019-10-03 02:35:19,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-10-03 02:35:19,117 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 157 [2019-10-03 02:35:19,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:35:19,119 INFO L225 Difference]: With dead ends: 161 [2019-10-03 02:35:19,120 INFO L226 Difference]: Without dead ends: 161 [2019-10-03 02:35:19,120 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 240 SyntacticMatches, 50 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2475 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:35:19,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-10-03 02:35:19,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 160. [2019-10-03 02:35:19,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-10-03 02:35:19,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 161 transitions. [2019-10-03 02:35:19,124 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 161 transitions. Word has length 157 [2019-10-03 02:35:19,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:35:19,124 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 161 transitions. [2019-10-03 02:35:19,124 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-10-03 02:35:19,125 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 161 transitions. [2019-10-03 02:35:19,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-10-03 02:35:19,125 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:35:19,126 INFO L411 BasicCegarLoop]: trace histogram [66, 41, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:35:19,126 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:35:19,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:35:19,126 INFO L82 PathProgramCache]: Analyzing trace with hash -1237672398, now seen corresponding path program 32 times [2019-10-03 02:35:19,126 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:35:19,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:35:19,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:35:19,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:35:19,128 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:35:19,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:35:21,299 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 0 proven. 4356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:35:21,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:35:21,300 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:35:21,300 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:35:21,300 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:35:21,300 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:35:21,300 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-10-03 02:35:21,424 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-03 02:35:21,424 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-10-03 02:35:21,512 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2019-10-03 02:35:21,513 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-03 02:35:21,514 INFO L256 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 28 conjunts are in the unsatisfiable core [2019-10-03 02:35:21,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:35:21,531 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 2091 proven. 625 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2019-10-03 02:35:21,531 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:35:23,118 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 2091 proven. 625 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2019-10-03 02:35:23,122 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:35:23,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 28, 28] total 102 [2019-10-03 02:35:23,122 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:35:23,123 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-10-03 02:35:23,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-10-03 02:35:23,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:35:23,124 INFO L87 Difference]: Start difference. First operand 160 states and 161 transitions. Second operand 78 states. [2019-10-03 02:35:23,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:35:23,553 INFO L93 Difference]: Finished difference Result 163 states and 164 transitions. [2019-10-03 02:35:23,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-10-03 02:35:23,553 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 159 [2019-10-03 02:35:23,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:35:23,555 INFO L225 Difference]: With dead ends: 163 [2019-10-03 02:35:23,555 INFO L226 Difference]: Without dead ends: 163 [2019-10-03 02:35:23,556 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 293 SyntacticMatches, 2 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:35:23,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-10-03 02:35:23,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 162. [2019-10-03 02:35:23,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-10-03 02:35:23,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 163 transitions. [2019-10-03 02:35:23,561 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 163 transitions. Word has length 159 [2019-10-03 02:35:23,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:35:23,561 INFO L475 AbstractCegarLoop]: Abstraction has 162 states and 163 transitions. [2019-10-03 02:35:23,561 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-10-03 02:35:23,561 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 163 transitions. [2019-10-03 02:35:23,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-03 02:35:23,562 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:35:23,563 INFO L411 BasicCegarLoop]: trace histogram [67, 41, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:35:23,563 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:35:23,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:35:23,563 INFO L82 PathProgramCache]: Analyzing trace with hash 295228172, now seen corresponding path program 33 times [2019-10-03 02:35:23,563 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:35:23,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:35:23,565 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-03 02:35:23,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:35:23,565 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:35:23,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:35:25,709 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 0 proven. 4489 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:35:25,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:35:25,710 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:35:25,710 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:35:25,710 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:35:25,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:35:25,710 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 02:35:25,831 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-03 02:35:25,831 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-10-03 02:35:25,881 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-03 02:35:25,881 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-03 02:35:25,883 INFO L256 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 78 conjunts are in the unsatisfiable core [2019-10-03 02:35:25,885 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:35:25,918 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 0 proven. 4489 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:35:25,918 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:35:29,230 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 0 proven. 4489 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:35:29,234 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:35:29,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 102 [2019-10-03 02:35:29,234 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:35:29,235 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-10-03 02:35:29,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-10-03 02:35:29,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:35:29,236 INFO L87 Difference]: Start difference. First operand 162 states and 163 transitions. Second operand 79 states. [2019-10-03 02:35:29,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:35:29,685 INFO L93 Difference]: Finished difference Result 165 states and 166 transitions. [2019-10-03 02:35:29,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-10-03 02:35:29,685 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 161 [2019-10-03 02:35:29,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:35:29,686 INFO L225 Difference]: With dead ends: 165 [2019-10-03 02:35:29,686 INFO L226 Difference]: Without dead ends: 165 [2019-10-03 02:35:29,687 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 400 GetRequests, 246 SyntacticMatches, 54 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2673 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:35:29,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-10-03 02:35:29,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 164. [2019-10-03 02:35:29,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-10-03 02:35:29,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 165 transitions. [2019-10-03 02:35:29,691 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 165 transitions. Word has length 161 [2019-10-03 02:35:29,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:35:29,691 INFO L475 AbstractCegarLoop]: Abstraction has 164 states and 165 transitions. [2019-10-03 02:35:29,691 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-10-03 02:35:29,691 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 165 transitions. [2019-10-03 02:35:29,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-10-03 02:35:29,692 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:35:29,692 INFO L411 BasicCegarLoop]: trace histogram [68, 41, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:35:29,693 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:35:29,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:35:29,693 INFO L82 PathProgramCache]: Analyzing trace with hash 238893414, now seen corresponding path program 34 times [2019-10-03 02:35:29,693 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:35:29,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:35:29,695 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-03 02:35:29,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:35:29,695 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:35:29,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:35:31,885 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 0 proven. 4624 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:35:31,885 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:35:31,885 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:35:31,886 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:35:31,886 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:35:31,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:35:31,886 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-10-03 02:35:32,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:35:32,013 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 02:35:32,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:35:32,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 79 conjunts are in the unsatisfiable core [2019-10-03 02:35:32,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:35:32,100 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 0 proven. 4624 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:35:32,100 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:35:35,373 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 0 proven. 4624 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:35:35,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:35:35,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 102 [2019-10-03 02:35:35,377 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:35:35,377 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-10-03 02:35:35,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-10-03 02:35:35,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:35:35,379 INFO L87 Difference]: Start difference. First operand 164 states and 165 transitions. Second operand 80 states. [2019-10-03 02:35:35,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:35:35,860 INFO L93 Difference]: Finished difference Result 167 states and 168 transitions. [2019-10-03 02:35:35,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-10-03 02:35:35,861 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 163 [2019-10-03 02:35:35,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:35:35,862 INFO L225 Difference]: With dead ends: 167 [2019-10-03 02:35:35,862 INFO L226 Difference]: Without dead ends: 167 [2019-10-03 02:35:35,862 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 249 SyntacticMatches, 56 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2772 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:35:35,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-10-03 02:35:35,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 166. [2019-10-03 02:35:35,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-10-03 02:35:35,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 167 transitions. [2019-10-03 02:35:35,866 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 167 transitions. Word has length 163 [2019-10-03 02:35:35,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:35:35,866 INFO L475 AbstractCegarLoop]: Abstraction has 166 states and 167 transitions. [2019-10-03 02:35:35,866 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-10-03 02:35:35,866 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 167 transitions. [2019-10-03 02:35:35,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-10-03 02:35:35,867 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:35:35,867 INFO L411 BasicCegarLoop]: trace histogram [69, 41, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:35:35,868 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:35:35,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:35:35,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1935765824, now seen corresponding path program 35 times [2019-10-03 02:35:35,868 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:35:35,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:35:35,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:35:35,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:35:35,870 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:35:35,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:35:38,112 INFO L134 CoverageAnalysis]: Checked inductivity of 4761 backedges. 0 proven. 4761 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:35:38,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:35:38,113 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:35:38,113 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:35:38,113 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:35:38,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:35:38,113 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 02:35:38,252 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-03 02:35:38,252 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-10-03 02:35:38,337 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 58 check-sat command(s) [2019-10-03 02:35:38,337 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-03 02:35:38,338 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 31 conjunts are in the unsatisfiable core [2019-10-03 02:35:38,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:35:38,370 INFO L134 CoverageAnalysis]: Checked inductivity of 4761 backedges. 2337 proven. 784 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2019-10-03 02:35:38,370 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:35:40,091 INFO L134 CoverageAnalysis]: Checked inductivity of 4761 backedges. 2337 proven. 784 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2019-10-03 02:35:40,095 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:35:40,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 31, 31] total 102 [2019-10-03 02:35:40,096 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:35:40,096 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-10-03 02:35:40,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-10-03 02:35:40,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:35:40,098 INFO L87 Difference]: Start difference. First operand 166 states and 167 transitions. Second operand 81 states. [2019-10-03 02:35:40,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:35:40,536 INFO L93 Difference]: Finished difference Result 169 states and 170 transitions. [2019-10-03 02:35:40,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-10-03 02:35:40,536 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 165 [2019-10-03 02:35:40,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:35:40,537 INFO L225 Difference]: With dead ends: 169 [2019-10-03 02:35:40,537 INFO L226 Difference]: Without dead ends: 169 [2019-10-03 02:35:40,537 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 302 SyntacticMatches, 8 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:35:40,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-10-03 02:35:40,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 168. [2019-10-03 02:35:40,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-10-03 02:35:40,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 169 transitions. [2019-10-03 02:35:40,541 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 169 transitions. Word has length 165 [2019-10-03 02:35:40,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:35:40,541 INFO L475 AbstractCegarLoop]: Abstraction has 168 states and 169 transitions. [2019-10-03 02:35:40,541 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-10-03 02:35:40,541 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 169 transitions. [2019-10-03 02:35:40,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-10-03 02:35:40,542 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:35:40,542 INFO L411 BasicCegarLoop]: trace histogram [70, 41, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:35:40,543 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:35:40,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:35:40,543 INFO L82 PathProgramCache]: Analyzing trace with hash 542579354, now seen corresponding path program 36 times [2019-10-03 02:35:40,543 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:35:40,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:35:40,545 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-03 02:35:40,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:35:40,545 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:35:40,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:35:42,888 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 4900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:35:42,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:35:42,889 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:35:42,889 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:35:42,889 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:35:42,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:35:42,889 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 02:35:43,042 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-03 02:35:43,042 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-10-03 02:35:43,099 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-03 02:35:43,100 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-03 02:35:43,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 81 conjunts are in the unsatisfiable core [2019-10-03 02:35:43,105 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:35:43,141 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 4900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:35:43,141 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:35:46,456 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 4900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:35:46,460 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:35:46,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 102 [2019-10-03 02:35:46,460 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:35:46,460 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-10-03 02:35:46,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-10-03 02:35:46,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:35:46,462 INFO L87 Difference]: Start difference. First operand 168 states and 169 transitions. Second operand 82 states. [2019-10-03 02:35:46,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:35:46,907 INFO L93 Difference]: Finished difference Result 171 states and 172 transitions. [2019-10-03 02:35:46,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-10-03 02:35:46,908 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 167 [2019-10-03 02:35:46,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:35:46,909 INFO L225 Difference]: With dead ends: 171 [2019-10-03 02:35:46,909 INFO L226 Difference]: Without dead ends: 171 [2019-10-03 02:35:46,910 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 255 SyntacticMatches, 60 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2970 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:35:46,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-10-03 02:35:46,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 170. [2019-10-03 02:35:46,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-10-03 02:35:46,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 171 transitions. [2019-10-03 02:35:46,914 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 171 transitions. Word has length 167 [2019-10-03 02:35:46,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:35:46,914 INFO L475 AbstractCegarLoop]: Abstraction has 170 states and 171 transitions. [2019-10-03 02:35:46,914 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-10-03 02:35:46,914 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 171 transitions. [2019-10-03 02:35:46,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-10-03 02:35:46,915 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:35:46,915 INFO L411 BasicCegarLoop]: trace histogram [71, 41, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:35:46,915 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:35:46,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:35:46,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1720178036, now seen corresponding path program 37 times [2019-10-03 02:35:46,916 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:35:46,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:35:46,918 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-03 02:35:46,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:35:46,918 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:35:46,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:35:49,259 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 0 proven. 5041 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:35:49,260 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:35:49,260 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:35:49,260 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:35:49,260 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:35:49,260 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:35:49,260 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 02:35:49,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:35:49,405 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 02:35:49,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:35:49,460 INFO L256 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 82 conjunts are in the unsatisfiable core [2019-10-03 02:35:49,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:35:49,486 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 0 proven. 5041 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:35:49,486 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:35:52,783 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 0 proven. 5041 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:35:52,787 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:35:52,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 102 [2019-10-03 02:35:52,788 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:35:52,788 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-10-03 02:35:52,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-10-03 02:35:52,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:35:52,789 INFO L87 Difference]: Start difference. First operand 170 states and 171 transitions. Second operand 83 states. [2019-10-03 02:35:53,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:35:53,220 INFO L93 Difference]: Finished difference Result 173 states and 174 transitions. [2019-10-03 02:35:53,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-10-03 02:35:53,221 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 169 [2019-10-03 02:35:53,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:35:53,222 INFO L225 Difference]: With dead ends: 173 [2019-10-03 02:35:53,222 INFO L226 Difference]: Without dead ends: 173 [2019-10-03 02:35:53,222 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 258 SyntacticMatches, 62 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3069 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:35:53,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-10-03 02:35:53,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 172. [2019-10-03 02:35:53,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-10-03 02:35:53,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 173 transitions. [2019-10-03 02:35:53,226 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 173 transitions. Word has length 169 [2019-10-03 02:35:53,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:35:53,226 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 173 transitions. [2019-10-03 02:35:53,226 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-10-03 02:35:53,226 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 173 transitions. [2019-10-03 02:35:53,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-10-03 02:35:53,227 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:35:53,227 INFO L411 BasicCegarLoop]: trace histogram [72, 41, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:35:53,228 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:35:53,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:35:53,228 INFO L82 PathProgramCache]: Analyzing trace with hash -478854706, now seen corresponding path program 38 times [2019-10-03 02:35:53,228 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:35:53,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:35:53,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:35:53,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:35:53,230 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:35:53,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:35:55,635 INFO L134 CoverageAnalysis]: Checked inductivity of 5184 backedges. 0 proven. 5184 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:35:55,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:35:55,636 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:35:55,636 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:35:55,636 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:35:55,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:35:55,636 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 02:35:55,793 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-03 02:35:55,793 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-10-03 02:35:55,880 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 64 check-sat command(s) [2019-10-03 02:35:55,880 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-03 02:35:55,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 34 conjunts are in the unsatisfiable core [2019-10-03 02:35:55,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:35:55,900 INFO L134 CoverageAnalysis]: Checked inductivity of 5184 backedges. 2583 proven. 961 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2019-10-03 02:35:55,900 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:35:57,720 INFO L134 CoverageAnalysis]: Checked inductivity of 5184 backedges. 2583 proven. 961 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2019-10-03 02:35:57,723 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:35:57,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 34, 34] total 102 [2019-10-03 02:35:57,724 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:35:57,724 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-10-03 02:35:57,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-10-03 02:35:57,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:35:57,725 INFO L87 Difference]: Start difference. First operand 172 states and 173 transitions. Second operand 84 states. [2019-10-03 02:35:58,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:35:58,202 INFO L93 Difference]: Finished difference Result 175 states and 176 transitions. [2019-10-03 02:35:58,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-10-03 02:35:58,202 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 171 [2019-10-03 02:35:58,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:35:58,204 INFO L225 Difference]: With dead ends: 175 [2019-10-03 02:35:58,204 INFO L226 Difference]: Without dead ends: 175 [2019-10-03 02:35:58,204 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 425 GetRequests, 311 SyntacticMatches, 14 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:35:58,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-10-03 02:35:58,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 174. [2019-10-03 02:35:58,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-10-03 02:35:58,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 175 transitions. [2019-10-03 02:35:58,208 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 175 transitions. Word has length 171 [2019-10-03 02:35:58,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:35:58,208 INFO L475 AbstractCegarLoop]: Abstraction has 174 states and 175 transitions. [2019-10-03 02:35:58,208 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-10-03 02:35:58,208 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 175 transitions. [2019-10-03 02:35:58,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-10-03 02:35:58,209 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:35:58,209 INFO L411 BasicCegarLoop]: trace histogram [73, 41, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:35:58,210 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:35:58,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:35:58,210 INFO L82 PathProgramCache]: Analyzing trace with hash -625410136, now seen corresponding path program 39 times [2019-10-03 02:35:58,210 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:35:58,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:35:58,212 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-03 02:35:58,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:35:58,212 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:35:58,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:36:00,670 INFO L134 CoverageAnalysis]: Checked inductivity of 5329 backedges. 0 proven. 5329 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:36:00,670 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:36:00,670 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:36:00,670 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:36:00,670 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:36:00,670 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:36:00,670 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 02:36:00,826 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-03 02:36:00,826 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-10-03 02:36:00,885 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-03 02:36:00,885 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-03 02:36:00,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 84 conjunts are in the unsatisfiable core [2019-10-03 02:36:00,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:36:00,926 INFO L134 CoverageAnalysis]: Checked inductivity of 5329 backedges. 0 proven. 5329 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:36:00,927 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:36:04,436 INFO L134 CoverageAnalysis]: Checked inductivity of 5329 backedges. 0 proven. 5329 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:36:04,440 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:36:04,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 102 [2019-10-03 02:36:04,441 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:36:04,441 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-10-03 02:36:04,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-10-03 02:36:04,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:36:04,442 INFO L87 Difference]: Start difference. First operand 174 states and 175 transitions. Second operand 85 states. [2019-10-03 02:36:04,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:36:04,884 INFO L93 Difference]: Finished difference Result 177 states and 178 transitions. [2019-10-03 02:36:04,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-10-03 02:36:04,885 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 173 [2019-10-03 02:36:04,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:36:04,886 INFO L225 Difference]: With dead ends: 177 [2019-10-03 02:36:04,886 INFO L226 Difference]: Without dead ends: 177 [2019-10-03 02:36:04,887 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 430 GetRequests, 264 SyntacticMatches, 66 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3267 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:36:04,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-10-03 02:36:04,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 176. [2019-10-03 02:36:04,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-10-03 02:36:04,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 177 transitions. [2019-10-03 02:36:04,890 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 177 transitions. Word has length 173 [2019-10-03 02:36:04,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:36:04,891 INFO L475 AbstractCegarLoop]: Abstraction has 176 states and 177 transitions. [2019-10-03 02:36:04,891 INFO L476 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-10-03 02:36:04,891 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 177 transitions. [2019-10-03 02:36:04,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-10-03 02:36:04,892 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:36:04,892 INFO L411 BasicCegarLoop]: trace histogram [74, 41, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:36:04,892 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:36:04,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:36:04,892 INFO L82 PathProgramCache]: Analyzing trace with hash 268742402, now seen corresponding path program 40 times [2019-10-03 02:36:04,892 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:36:04,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:36:04,894 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-03 02:36:04,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:36:04,895 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:36:04,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:36:07,396 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 0 proven. 5476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:36:07,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:36:07,397 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:36:07,397 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:36:07,397 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:36:07,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:36:07,397 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 02:36:07,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:36:07,552 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 02:36:07,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:36:07,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 85 conjunts are in the unsatisfiable core [2019-10-03 02:36:07,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:36:07,638 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 0 proven. 5476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:36:07,638 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:36:10,944 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 0 proven. 5476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:36:10,949 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:36:10,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 102 [2019-10-03 02:36:10,949 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:36:10,950 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-10-03 02:36:10,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-10-03 02:36:10,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:36:10,951 INFO L87 Difference]: Start difference. First operand 176 states and 177 transitions. Second operand 86 states. [2019-10-03 02:36:11,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:36:11,456 INFO L93 Difference]: Finished difference Result 179 states and 180 transitions. [2019-10-03 02:36:11,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-10-03 02:36:11,456 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 175 [2019-10-03 02:36:11,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:36:11,457 INFO L225 Difference]: With dead ends: 179 [2019-10-03 02:36:11,457 INFO L226 Difference]: Without dead ends: 179 [2019-10-03 02:36:11,458 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 267 SyntacticMatches, 68 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3366 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:36:11,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-10-03 02:36:11,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 178. [2019-10-03 02:36:11,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-10-03 02:36:11,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 179 transitions. [2019-10-03 02:36:11,462 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 179 transitions. Word has length 175 [2019-10-03 02:36:11,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:36:11,462 INFO L475 AbstractCegarLoop]: Abstraction has 178 states and 179 transitions. [2019-10-03 02:36:11,462 INFO L476 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-10-03 02:36:11,462 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 179 transitions. [2019-10-03 02:36:11,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-10-03 02:36:11,463 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:36:11,463 INFO L411 BasicCegarLoop]: trace histogram [75, 41, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:36:11,464 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:36:11,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:36:11,464 INFO L82 PathProgramCache]: Analyzing trace with hash 555872220, now seen corresponding path program 41 times [2019-10-03 02:36:11,464 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:36:11,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:36:11,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:36:11,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:36:11,466 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:36:11,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:36:14,007 INFO L134 CoverageAnalysis]: Checked inductivity of 5625 backedges. 0 proven. 5625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:36:14,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:36:14,007 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:36:14,008 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:36:14,008 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:36:14,008 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:36:14,008 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 02:36:14,170 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-03 02:36:14,170 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-10-03 02:36:14,271 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 70 check-sat command(s) [2019-10-03 02:36:14,271 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-03 02:36:14,272 INFO L256 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 37 conjunts are in the unsatisfiable core [2019-10-03 02:36:14,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:36:14,292 INFO L134 CoverageAnalysis]: Checked inductivity of 5625 backedges. 2829 proven. 1156 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2019-10-03 02:36:14,293 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:36:16,246 INFO L134 CoverageAnalysis]: Checked inductivity of 5625 backedges. 2829 proven. 1156 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2019-10-03 02:36:16,250 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:36:16,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 37, 37] total 102 [2019-10-03 02:36:16,250 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:36:16,251 INFO L454 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-10-03 02:36:16,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-10-03 02:36:16,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:36:16,252 INFO L87 Difference]: Start difference. First operand 178 states and 179 transitions. Second operand 87 states. [2019-10-03 02:36:16,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:36:16,714 INFO L93 Difference]: Finished difference Result 181 states and 182 transitions. [2019-10-03 02:36:16,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-10-03 02:36:16,715 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 177 [2019-10-03 02:36:16,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:36:16,716 INFO L225 Difference]: With dead ends: 181 [2019-10-03 02:36:16,716 INFO L226 Difference]: Without dead ends: 181 [2019-10-03 02:36:16,717 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 440 GetRequests, 320 SyntacticMatches, 20 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 490 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:36:16,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-10-03 02:36:16,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 180. [2019-10-03 02:36:16,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-10-03 02:36:16,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 181 transitions. [2019-10-03 02:36:16,720 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 181 transitions. Word has length 177 [2019-10-03 02:36:16,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:36:16,720 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 181 transitions. [2019-10-03 02:36:16,721 INFO L476 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-10-03 02:36:16,721 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 181 transitions. [2019-10-03 02:36:16,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-10-03 02:36:16,722 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:36:16,722 INFO L411 BasicCegarLoop]: trace histogram [76, 41, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:36:16,722 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:36:16,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:36:16,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1609720374, now seen corresponding path program 42 times [2019-10-03 02:36:16,723 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:36:16,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:36:16,724 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-03 02:36:16,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:36:16,724 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:36:16,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:36:19,324 INFO L134 CoverageAnalysis]: Checked inductivity of 5776 backedges. 0 proven. 5776 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:36:19,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:36:19,324 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:36:19,325 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:36:19,325 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:36:19,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:36:19,325 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 02:36:19,491 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-03 02:36:19,491 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-10-03 02:36:19,550 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-03 02:36:19,551 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-03 02:36:19,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 87 conjunts are in the unsatisfiable core [2019-10-03 02:36:19,554 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:36:19,598 INFO L134 CoverageAnalysis]: Checked inductivity of 5776 backedges. 0 proven. 5776 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:36:19,598 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:36:22,955 INFO L134 CoverageAnalysis]: Checked inductivity of 5776 backedges. 0 proven. 5776 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:36:22,958 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:36:22,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 102 [2019-10-03 02:36:22,959 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:36:22,959 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-10-03 02:36:22,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-10-03 02:36:22,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:36:22,960 INFO L87 Difference]: Start difference. First operand 180 states and 181 transitions. Second operand 88 states. [2019-10-03 02:36:23,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:36:23,416 INFO L93 Difference]: Finished difference Result 183 states and 184 transitions. [2019-10-03 02:36:23,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-10-03 02:36:23,417 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 179 [2019-10-03 02:36:23,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:36:23,418 INFO L225 Difference]: With dead ends: 183 [2019-10-03 02:36:23,418 INFO L226 Difference]: Without dead ends: 183 [2019-10-03 02:36:23,418 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 445 GetRequests, 273 SyntacticMatches, 72 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3564 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:36:23,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-10-03 02:36:23,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 182. [2019-10-03 02:36:23,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-10-03 02:36:23,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 183 transitions. [2019-10-03 02:36:23,422 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 183 transitions. Word has length 179 [2019-10-03 02:36:23,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:36:23,422 INFO L475 AbstractCegarLoop]: Abstraction has 182 states and 183 transitions. [2019-10-03 02:36:23,422 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-10-03 02:36:23,422 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 183 transitions. [2019-10-03 02:36:23,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-10-03 02:36:23,423 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:36:23,423 INFO L411 BasicCegarLoop]: trace histogram [77, 41, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:36:23,424 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:36:23,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:36:23,424 INFO L82 PathProgramCache]: Analyzing trace with hash 745514512, now seen corresponding path program 43 times [2019-10-03 02:36:23,424 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:36:23,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:36:23,426 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-03 02:36:23,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:36:23,426 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:36:23,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:36:26,049 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 0 proven. 5929 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:36:26,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:36:26,050 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:36:26,050 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:36:26,050 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:36:26,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:36:26,050 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 02:36:26,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:36:26,224 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 02:36:26,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:36:26,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 88 conjunts are in the unsatisfiable core [2019-10-03 02:36:26,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:36:26,322 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 0 proven. 5929 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:36:26,323 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:36:29,696 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 0 proven. 5929 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:36:29,700 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:36:29,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 102 [2019-10-03 02:36:29,700 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:36:29,701 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-10-03 02:36:29,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-10-03 02:36:29,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:36:29,702 INFO L87 Difference]: Start difference. First operand 182 states and 183 transitions. Second operand 89 states. [2019-10-03 02:36:30,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:36:30,144 INFO L93 Difference]: Finished difference Result 185 states and 186 transitions. [2019-10-03 02:36:30,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-10-03 02:36:30,145 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 181 [2019-10-03 02:36:30,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:36:30,146 INFO L225 Difference]: With dead ends: 185 [2019-10-03 02:36:30,146 INFO L226 Difference]: Without dead ends: 185 [2019-10-03 02:36:30,146 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 276 SyntacticMatches, 74 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3663 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:36:30,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-10-03 02:36:30,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 184. [2019-10-03 02:36:30,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-10-03 02:36:30,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 185 transitions. [2019-10-03 02:36:30,150 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 185 transitions. Word has length 181 [2019-10-03 02:36:30,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:36:30,151 INFO L475 AbstractCegarLoop]: Abstraction has 184 states and 185 transitions. [2019-10-03 02:36:30,151 INFO L476 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-10-03 02:36:30,151 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 185 transitions. [2019-10-03 02:36:30,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-10-03 02:36:30,152 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:36:30,152 INFO L411 BasicCegarLoop]: trace histogram [78, 41, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:36:30,152 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:36:30,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:36:30,153 INFO L82 PathProgramCache]: Analyzing trace with hash -827630742, now seen corresponding path program 44 times [2019-10-03 02:36:30,153 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:36:30,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:36:30,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:36:30,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:36:30,155 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:36:30,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:36:32,822 INFO L134 CoverageAnalysis]: Checked inductivity of 6084 backedges. 0 proven. 6084 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:36:32,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:36:32,823 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:36:32,823 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:36:32,823 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:36:32,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:36:32,823 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 02:36:32,993 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-03 02:36:32,994 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-10-03 02:36:33,142 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 76 check-sat command(s) [2019-10-03 02:36:33,143 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-03 02:36:33,145 INFO L256 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 40 conjunts are in the unsatisfiable core [2019-10-03 02:36:33,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:36:33,178 INFO L134 CoverageAnalysis]: Checked inductivity of 6084 backedges. 3075 proven. 1369 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2019-10-03 02:36:33,179 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:36:35,639 INFO L134 CoverageAnalysis]: Checked inductivity of 6084 backedges. 3075 proven. 1369 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2019-10-03 02:36:35,643 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:36:35,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 40, 40] total 102 [2019-10-03 02:36:35,644 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:36:35,644 INFO L454 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-10-03 02:36:35,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-10-03 02:36:35,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:36:35,646 INFO L87 Difference]: Start difference. First operand 184 states and 185 transitions. Second operand 90 states. [2019-10-03 02:36:36,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:36:36,141 INFO L93 Difference]: Finished difference Result 187 states and 188 transitions. [2019-10-03 02:36:36,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-10-03 02:36:36,142 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 183 [2019-10-03 02:36:36,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:36:36,143 INFO L225 Difference]: With dead ends: 187 [2019-10-03 02:36:36,143 INFO L226 Difference]: Without dead ends: 187 [2019-10-03 02:36:36,144 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 455 GetRequests, 329 SyntacticMatches, 26 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 637 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:36:36,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-10-03 02:36:36,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 186. [2019-10-03 02:36:36,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-10-03 02:36:36,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 187 transitions. [2019-10-03 02:36:36,147 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 187 transitions. Word has length 183 [2019-10-03 02:36:36,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:36:36,147 INFO L475 AbstractCegarLoop]: Abstraction has 186 states and 187 transitions. [2019-10-03 02:36:36,147 INFO L476 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-10-03 02:36:36,148 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 187 transitions. [2019-10-03 02:36:36,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-10-03 02:36:36,148 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:36:36,148 INFO L411 BasicCegarLoop]: trace histogram [79, 41, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:36:36,149 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:36:36,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:36:36,149 INFO L82 PathProgramCache]: Analyzing trace with hash -791731644, now seen corresponding path program 45 times [2019-10-03 02:36:36,149 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:36:36,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:36:36,150 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-03 02:36:36,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:36:36,150 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:36:36,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:36:38,900 INFO L134 CoverageAnalysis]: Checked inductivity of 6241 backedges. 0 proven. 6241 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:36:38,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:36:38,900 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:36:38,900 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:36:38,900 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:36:38,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:36:38,900 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 02:36:39,091 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-03 02:36:39,091 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-10-03 02:36:39,155 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-03 02:36:39,156 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-03 02:36:39,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 90 conjunts are in the unsatisfiable core [2019-10-03 02:36:39,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:36:39,188 INFO L134 CoverageAnalysis]: Checked inductivity of 6241 backedges. 0 proven. 6241 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:36:39,188 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:36:42,596 INFO L134 CoverageAnalysis]: Checked inductivity of 6241 backedges. 0 proven. 6241 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:36:42,601 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:36:42,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 102 [2019-10-03 02:36:42,601 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:36:42,602 INFO L454 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-10-03 02:36:42,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-10-03 02:36:42,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:36:42,603 INFO L87 Difference]: Start difference. First operand 186 states and 187 transitions. Second operand 91 states. [2019-10-03 02:36:43,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:36:43,129 INFO L93 Difference]: Finished difference Result 189 states and 190 transitions. [2019-10-03 02:36:43,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-10-03 02:36:43,129 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 185 [2019-10-03 02:36:43,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:36:43,130 INFO L225 Difference]: With dead ends: 189 [2019-10-03 02:36:43,130 INFO L226 Difference]: Without dead ends: 189 [2019-10-03 02:36:43,131 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 282 SyntacticMatches, 78 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3861 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:36:43,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-10-03 02:36:43,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 188. [2019-10-03 02:36:43,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-10-03 02:36:43,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 189 transitions. [2019-10-03 02:36:43,135 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 189 transitions. Word has length 185 [2019-10-03 02:36:43,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:36:43,135 INFO L475 AbstractCegarLoop]: Abstraction has 188 states and 189 transitions. [2019-10-03 02:36:43,135 INFO L476 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-10-03 02:36:43,135 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 189 transitions. [2019-10-03 02:36:43,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-10-03 02:36:43,136 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:36:43,136 INFO L411 BasicCegarLoop]: trace histogram [80, 41, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:36:43,136 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:36:43,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:36:43,137 INFO L82 PathProgramCache]: Analyzing trace with hash -652436834, now seen corresponding path program 46 times [2019-10-03 02:36:43,137 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:36:43,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:36:43,139 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-03 02:36:43,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:36:43,139 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:36:43,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:36:45,942 INFO L134 CoverageAnalysis]: Checked inductivity of 6400 backedges. 0 proven. 6400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:36:45,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:36:45,943 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:36:45,943 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:36:45,943 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:36:45,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:36:45,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 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 02:36:46,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:36:46,128 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 02:36:46,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:36:46,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 91 conjunts are in the unsatisfiable core [2019-10-03 02:36:46,191 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:36:46,240 INFO L134 CoverageAnalysis]: Checked inductivity of 6400 backedges. 0 proven. 6400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:36:46,240 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:36:49,569 INFO L134 CoverageAnalysis]: Checked inductivity of 6400 backedges. 0 proven. 6400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:36:49,573 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:36:49,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92, 92] total 102 [2019-10-03 02:36:49,573 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:36:49,574 INFO L454 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-10-03 02:36:49,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-10-03 02:36:49,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:36:49,575 INFO L87 Difference]: Start difference. First operand 188 states and 189 transitions. Second operand 92 states. [2019-10-03 02:36:50,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:36:50,083 INFO L93 Difference]: Finished difference Result 191 states and 192 transitions. [2019-10-03 02:36:50,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-10-03 02:36:50,084 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 187 [2019-10-03 02:36:50,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:36:50,086 INFO L225 Difference]: With dead ends: 191 [2019-10-03 02:36:50,086 INFO L226 Difference]: Without dead ends: 191 [2019-10-03 02:36:50,086 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 465 GetRequests, 285 SyntacticMatches, 80 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3960 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:36:50,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-10-03 02:36:50,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 190. [2019-10-03 02:36:50,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-10-03 02:36:50,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 191 transitions. [2019-10-03 02:36:50,089 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 191 transitions. Word has length 187 [2019-10-03 02:36:50,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:36:50,089 INFO L475 AbstractCegarLoop]: Abstraction has 190 states and 191 transitions. [2019-10-03 02:36:50,089 INFO L476 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-10-03 02:36:50,090 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 191 transitions. [2019-10-03 02:36:50,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-10-03 02:36:50,090 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:36:50,091 INFO L411 BasicCegarLoop]: trace histogram [81, 41, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:36:50,091 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:36:50,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:36:50,091 INFO L82 PathProgramCache]: Analyzing trace with hash 65889400, now seen corresponding path program 47 times [2019-10-03 02:36:50,091 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:36:50,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:36:50,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:36:50,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:36:50,094 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:36:50,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:36:52,935 INFO L134 CoverageAnalysis]: Checked inductivity of 6561 backedges. 0 proven. 6561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:36:52,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:36:52,936 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:36:52,936 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:36:52,936 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:36:52,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:36:52,936 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 02:36:53,125 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-03 02:36:53,126 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-10-03 02:36:53,250 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 82 check-sat command(s) [2019-10-03 02:36:53,250 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-03 02:36:53,252 INFO L256 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 92 conjunts are in the unsatisfiable core [2019-10-03 02:36:53,254 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:36:53,292 INFO L134 CoverageAnalysis]: Checked inductivity of 6561 backedges. 0 proven. 6561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:36:53,292 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:36:56,671 INFO L134 CoverageAnalysis]: Checked inductivity of 6561 backedges. 0 proven. 6561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:36:56,676 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:36:56,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 102 [2019-10-03 02:36:56,676 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:36:56,677 INFO L454 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-10-03 02:36:56,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-10-03 02:36:56,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:36:56,678 INFO L87 Difference]: Start difference. First operand 190 states and 191 transitions. Second operand 93 states. [2019-10-03 02:36:57,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:36:57,204 INFO L93 Difference]: Finished difference Result 193 states and 194 transitions. [2019-10-03 02:36:57,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-10-03 02:36:57,205 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 189 [2019-10-03 02:36:57,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:36:57,206 INFO L225 Difference]: With dead ends: 193 [2019-10-03 02:36:57,206 INFO L226 Difference]: Without dead ends: 193 [2019-10-03 02:36:57,207 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 470 GetRequests, 288 SyntacticMatches, 82 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4059 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:36:57,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-10-03 02:36:57,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 192. [2019-10-03 02:36:57,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-10-03 02:36:57,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 193 transitions. [2019-10-03 02:36:57,211 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 193 transitions. Word has length 189 [2019-10-03 02:36:57,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:36:57,211 INFO L475 AbstractCegarLoop]: Abstraction has 192 states and 193 transitions. [2019-10-03 02:36:57,211 INFO L476 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-10-03 02:36:57,211 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 193 transitions. [2019-10-03 02:36:57,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-10-03 02:36:57,212 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:36:57,212 INFO L411 BasicCegarLoop]: trace histogram [82, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:36:57,213 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:36:57,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:36:57,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1112334382, now seen corresponding path program 48 times [2019-10-03 02:36:57,213 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:36:57,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:36:57,215 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-03 02:36:57,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:36:57,215 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:36:57,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:37:00,156 INFO L134 CoverageAnalysis]: Checked inductivity of 6724 backedges. 0 proven. 6724 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:00,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:37:00,156 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:37:00,156 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:37:00,156 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:37:00,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:37:00,156 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 02:37:00,352 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-03 02:37:00,352 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-10-03 02:37:00,418 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-03 02:37:00,418 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-03 02:37:00,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 93 conjunts are in the unsatisfiable core [2019-10-03 02:37:00,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:37:00,450 INFO L134 CoverageAnalysis]: Checked inductivity of 6724 backedges. 0 proven. 6724 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:00,451 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:37:03,851 INFO L134 CoverageAnalysis]: Checked inductivity of 6724 backedges. 0 proven. 6724 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:03,855 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:37:03,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94, 94] total 102 [2019-10-03 02:37:03,855 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:37:03,856 INFO L454 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-10-03 02:37:03,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-10-03 02:37:03,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:37:03,858 INFO L87 Difference]: Start difference. First operand 192 states and 193 transitions. Second operand 94 states. [2019-10-03 02:37:04,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:37:04,328 INFO L93 Difference]: Finished difference Result 195 states and 196 transitions. [2019-10-03 02:37:04,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-10-03 02:37:04,328 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 191 [2019-10-03 02:37:04,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:37:04,329 INFO L225 Difference]: With dead ends: 195 [2019-10-03 02:37:04,329 INFO L226 Difference]: Without dead ends: 195 [2019-10-03 02:37:04,330 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 475 GetRequests, 291 SyntacticMatches, 84 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4158 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:37:04,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-10-03 02:37:04,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 194. [2019-10-03 02:37:04,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-10-03 02:37:04,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 195 transitions. [2019-10-03 02:37:04,333 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 195 transitions. Word has length 191 [2019-10-03 02:37:04,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:37:04,333 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 195 transitions. [2019-10-03 02:37:04,333 INFO L476 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-10-03 02:37:04,333 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 195 transitions. [2019-10-03 02:37:04,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-10-03 02:37:04,335 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:37:04,335 INFO L411 BasicCegarLoop]: trace histogram [83, 42, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:37:04,335 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:37:04,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:37:04,335 INFO L82 PathProgramCache]: Analyzing trace with hash 485977260, now seen corresponding path program 49 times [2019-10-03 02:37:04,335 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:37:04,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:04,337 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-03 02:37:04,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:04,338 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:37:04,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:37:07,390 INFO L134 CoverageAnalysis]: Checked inductivity of 6889 backedges. 0 proven. 6889 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:07,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:37:07,391 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:37:07,391 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:37:07,391 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:37:07,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:37:07,391 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 02:37:07,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:37:07,590 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 02:37:07,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:37:07,653 INFO L256 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 94 conjunts are in the unsatisfiable core [2019-10-03 02:37:07,655 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:37:07,684 INFO L134 CoverageAnalysis]: Checked inductivity of 6889 backedges. 0 proven. 6889 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:07,685 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:37:11,071 INFO L134 CoverageAnalysis]: Checked inductivity of 6889 backedges. 0 proven. 6889 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:11,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:37:11,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 102 [2019-10-03 02:37:11,075 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:37:11,076 INFO L454 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-10-03 02:37:11,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-10-03 02:37:11,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:37:11,077 INFO L87 Difference]: Start difference. First operand 194 states and 195 transitions. Second operand 95 states. [2019-10-03 02:37:11,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:37:11,596 INFO L93 Difference]: Finished difference Result 197 states and 198 transitions. [2019-10-03 02:37:11,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-10-03 02:37:11,597 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 193 [2019-10-03 02:37:11,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:37:11,598 INFO L225 Difference]: With dead ends: 197 [2019-10-03 02:37:11,598 INFO L226 Difference]: Without dead ends: 197 [2019-10-03 02:37:11,598 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 480 GetRequests, 294 SyntacticMatches, 86 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4257 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:37:11,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-10-03 02:37:11,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 196. [2019-10-03 02:37:11,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-10-03 02:37:11,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 197 transitions. [2019-10-03 02:37:11,602 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 197 transitions. Word has length 193 [2019-10-03 02:37:11,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:37:11,602 INFO L475 AbstractCegarLoop]: Abstraction has 196 states and 197 transitions. [2019-10-03 02:37:11,602 INFO L476 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-10-03 02:37:11,602 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 197 transitions. [2019-10-03 02:37:11,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-10-03 02:37:11,603 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:37:11,603 INFO L411 BasicCegarLoop]: trace histogram [84, 43, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:37:11,604 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:37:11,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:37:11,604 INFO L82 PathProgramCache]: Analyzing trace with hash -1134826746, now seen corresponding path program 50 times [2019-10-03 02:37:11,604 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:37:11,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:11,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:37:11,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:11,606 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:37:11,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:37:14,985 INFO L134 CoverageAnalysis]: Checked inductivity of 7056 backedges. 0 proven. 7056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:14,985 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:37:14,985 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:37:14,985 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:37:14,985 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:37:14,985 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:37:14,986 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 02:37:15,192 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-03 02:37:15,192 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-10-03 02:37:15,326 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 85 check-sat command(s) [2019-10-03 02:37:15,327 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-03 02:37:15,329 INFO L256 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 95 conjunts are in the unsatisfiable core [2019-10-03 02:37:15,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:37:15,374 INFO L134 CoverageAnalysis]: Checked inductivity of 7056 backedges. 0 proven. 7056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:15,375 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:37:18,809 INFO L134 CoverageAnalysis]: Checked inductivity of 7056 backedges. 0 proven. 7056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:18,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:37:18,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 102 [2019-10-03 02:37:18,815 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:37:18,815 INFO L454 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-10-03 02:37:18,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-10-03 02:37:18,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:37:18,816 INFO L87 Difference]: Start difference. First operand 196 states and 197 transitions. Second operand 96 states. [2019-10-03 02:37:19,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:37:19,332 INFO L93 Difference]: Finished difference Result 199 states and 200 transitions. [2019-10-03 02:37:19,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-10-03 02:37:19,333 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 195 [2019-10-03 02:37:19,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:37:19,336 INFO L225 Difference]: With dead ends: 199 [2019-10-03 02:37:19,336 INFO L226 Difference]: Without dead ends: 199 [2019-10-03 02:37:19,337 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 485 GetRequests, 297 SyntacticMatches, 88 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4356 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:37:19,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-10-03 02:37:19,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 198. [2019-10-03 02:37:19,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2019-10-03 02:37:19,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 199 transitions. [2019-10-03 02:37:19,340 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 199 transitions. Word has length 195 [2019-10-03 02:37:19,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:37:19,340 INFO L475 AbstractCegarLoop]: Abstraction has 198 states and 199 transitions. [2019-10-03 02:37:19,340 INFO L476 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-10-03 02:37:19,340 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 199 transitions. [2019-10-03 02:37:19,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-10-03 02:37:19,341 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:37:19,342 INFO L411 BasicCegarLoop]: trace histogram [85, 44, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:37:19,342 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:37:19,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:37:19,342 INFO L82 PathProgramCache]: Analyzing trace with hash 345651936, now seen corresponding path program 51 times [2019-10-03 02:37:19,342 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:37:19,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:19,344 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-03 02:37:19,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:19,344 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:37:19,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:37:22,514 INFO L134 CoverageAnalysis]: Checked inductivity of 7225 backedges. 0 proven. 7225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:22,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:37:22,515 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:37:22,515 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:37:22,515 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:37:22,515 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:37:22,515 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 02:37:22,730 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-03 02:37:22,730 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-10-03 02:37:22,798 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-03 02:37:22,798 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-03 02:37:22,801 INFO L256 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 96 conjunts are in the unsatisfiable core [2019-10-03 02:37:22,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:37:22,832 INFO L134 CoverageAnalysis]: Checked inductivity of 7225 backedges. 0 proven. 7225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:22,833 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:37:26,243 INFO L134 CoverageAnalysis]: Checked inductivity of 7225 backedges. 0 proven. 7225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:26,247 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:37:26,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 102 [2019-10-03 02:37:26,248 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:37:26,248 INFO L454 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-10-03 02:37:26,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-10-03 02:37:26,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:37:26,249 INFO L87 Difference]: Start difference. First operand 198 states and 199 transitions. Second operand 97 states. [2019-10-03 02:37:26,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:37:26,776 INFO L93 Difference]: Finished difference Result 201 states and 202 transitions. [2019-10-03 02:37:26,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-10-03 02:37:26,777 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 197 [2019-10-03 02:37:26,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:37:26,779 INFO L225 Difference]: With dead ends: 201 [2019-10-03 02:37:26,779 INFO L226 Difference]: Without dead ends: 201 [2019-10-03 02:37:26,779 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 490 GetRequests, 300 SyntacticMatches, 90 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4455 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:37:26,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-10-03 02:37:26,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 200. [2019-10-03 02:37:26,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-10-03 02:37:26,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 201 transitions. [2019-10-03 02:37:26,783 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 201 transitions. Word has length 197 [2019-10-03 02:37:26,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:37:26,783 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 201 transitions. [2019-10-03 02:37:26,783 INFO L476 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-10-03 02:37:26,783 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 201 transitions. [2019-10-03 02:37:26,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-10-03 02:37:26,784 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:37:26,784 INFO L411 BasicCegarLoop]: trace histogram [86, 45, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:37:26,784 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:37:26,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:37:26,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1451490362, now seen corresponding path program 52 times [2019-10-03 02:37:26,784 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:37:26,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:26,786 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-03 02:37:26,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:26,787 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:37:26,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:37:30,033 INFO L134 CoverageAnalysis]: Checked inductivity of 7396 backedges. 0 proven. 7396 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:30,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:37:30,034 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:37:30,034 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:37:30,034 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:37:30,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:37:30,034 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 02:37:30,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:37:30,237 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 02:37:30,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:37:30,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 97 conjunts are in the unsatisfiable core [2019-10-03 02:37:30,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:37:30,355 INFO L134 CoverageAnalysis]: Checked inductivity of 7396 backedges. 0 proven. 7396 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:30,355 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:37:33,878 INFO L134 CoverageAnalysis]: Checked inductivity of 7396 backedges. 0 proven. 7396 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:33,882 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:37:33,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 102 [2019-10-03 02:37:33,882 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:37:33,883 INFO L454 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-10-03 02:37:33,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-10-03 02:37:33,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:37:33,884 INFO L87 Difference]: Start difference. First operand 200 states and 201 transitions. Second operand 98 states. [2019-10-03 02:37:34,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:37:34,374 INFO L93 Difference]: Finished difference Result 203 states and 204 transitions. [2019-10-03 02:37:34,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-10-03 02:37:34,375 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 199 [2019-10-03 02:37:34,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:37:34,376 INFO L225 Difference]: With dead ends: 203 [2019-10-03 02:37:34,376 INFO L226 Difference]: Without dead ends: 203 [2019-10-03 02:37:34,377 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 495 GetRequests, 303 SyntacticMatches, 92 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4554 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:37:34,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-10-03 02:37:34,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 202. [2019-10-03 02:37:34,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-10-03 02:37:34,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 203 transitions. [2019-10-03 02:37:34,379 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 203 transitions. Word has length 199 [2019-10-03 02:37:34,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:37:34,380 INFO L475 AbstractCegarLoop]: Abstraction has 202 states and 203 transitions. [2019-10-03 02:37:34,380 INFO L476 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-10-03 02:37:34,380 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 203 transitions. [2019-10-03 02:37:34,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-10-03 02:37:34,381 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:37:34,381 INFO L411 BasicCegarLoop]: trace histogram [87, 46, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:37:34,381 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:37:34,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:37:34,382 INFO L82 PathProgramCache]: Analyzing trace with hash -989671660, now seen corresponding path program 53 times [2019-10-03 02:37:34,382 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:37:34,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:34,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:37:34,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:34,384 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:37:34,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:37:37,658 INFO L134 CoverageAnalysis]: Checked inductivity of 7569 backedges. 0 proven. 7569 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:37,659 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:37:37,659 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:37:37,659 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:37:37,659 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:37:37,659 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:37:37,659 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 02:37:37,865 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-03 02:37:37,865 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-10-03 02:37:37,997 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 88 check-sat command(s) [2019-10-03 02:37:37,997 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-03 02:37:37,999 INFO L256 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 98 conjunts are in the unsatisfiable core [2019-10-03 02:37:38,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:37:38,045 INFO L134 CoverageAnalysis]: Checked inductivity of 7569 backedges. 0 proven. 7569 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:38,046 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:37:41,420 INFO L134 CoverageAnalysis]: Checked inductivity of 7569 backedges. 0 proven. 7569 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:41,424 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:37:41,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99] total 102 [2019-10-03 02:37:41,424 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:37:41,424 INFO L454 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-10-03 02:37:41,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-10-03 02:37:41,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:37:41,425 INFO L87 Difference]: Start difference. First operand 202 states and 203 transitions. Second operand 99 states. [2019-10-03 02:37:41,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:37:41,972 INFO L93 Difference]: Finished difference Result 205 states and 206 transitions. [2019-10-03 02:37:41,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-10-03 02:37:41,972 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 201 [2019-10-03 02:37:41,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:37:41,974 INFO L225 Difference]: With dead ends: 205 [2019-10-03 02:37:41,974 INFO L226 Difference]: Without dead ends: 205 [2019-10-03 02:37:41,975 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 500 GetRequests, 306 SyntacticMatches, 94 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4653 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:37:41,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-10-03 02:37:41,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 204. [2019-10-03 02:37:41,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2019-10-03 02:37:41,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 205 transitions. [2019-10-03 02:37:41,982 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 205 transitions. Word has length 201 [2019-10-03 02:37:41,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:37:41,982 INFO L475 AbstractCegarLoop]: Abstraction has 204 states and 205 transitions. [2019-10-03 02:37:41,982 INFO L476 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-10-03 02:37:41,982 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 205 transitions. [2019-10-03 02:37:41,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-10-03 02:37:41,983 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:37:41,984 INFO L411 BasicCegarLoop]: trace histogram [88, 47, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:37:41,984 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:37:41,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:37:41,984 INFO L82 PathProgramCache]: Analyzing trace with hash -1894231186, now seen corresponding path program 54 times [2019-10-03 02:37:41,984 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:37:41,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:41,986 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-03 02:37:41,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:41,987 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:37:42,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:37:45,278 INFO L134 CoverageAnalysis]: Checked inductivity of 7744 backedges. 0 proven. 7744 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:45,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:37:45,279 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:37:45,279 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:37:45,279 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:37:45,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:37:45,279 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 02:37:45,499 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-03 02:37:45,500 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-10-03 02:37:45,579 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-03 02:37:45,579 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-03 02:37:45,582 INFO L256 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 99 conjunts are in the unsatisfiable core [2019-10-03 02:37:45,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:37:45,630 INFO L134 CoverageAnalysis]: Checked inductivity of 7744 backedges. 0 proven. 7744 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:45,630 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:37:49,016 INFO L134 CoverageAnalysis]: Checked inductivity of 7744 backedges. 0 proven. 7744 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:49,020 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:37:49,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100, 100] total 102 [2019-10-03 02:37:49,020 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:37:49,021 INFO L454 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-10-03 02:37:49,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-10-03 02:37:49,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:37:49,022 INFO L87 Difference]: Start difference. First operand 204 states and 205 transitions. Second operand 100 states. [2019-10-03 02:37:49,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:37:49,607 INFO L93 Difference]: Finished difference Result 207 states and 208 transitions. [2019-10-03 02:37:49,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-10-03 02:37:49,608 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 203 [2019-10-03 02:37:49,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:37:49,609 INFO L225 Difference]: With dead ends: 207 [2019-10-03 02:37:49,609 INFO L226 Difference]: Without dead ends: 207 [2019-10-03 02:37:49,610 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 505 GetRequests, 309 SyntacticMatches, 96 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4752 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:37:49,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-10-03 02:37:49,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 206. [2019-10-03 02:37:49,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-10-03 02:37:49,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 207 transitions. [2019-10-03 02:37:49,612 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 207 transitions. Word has length 203 [2019-10-03 02:37:49,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:37:49,612 INFO L475 AbstractCegarLoop]: Abstraction has 206 states and 207 transitions. [2019-10-03 02:37:49,612 INFO L476 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-10-03 02:37:49,612 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 207 transitions. [2019-10-03 02:37:49,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-10-03 02:37:49,613 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:37:49,613 INFO L411 BasicCegarLoop]: trace histogram [89, 48, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:37:49,613 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:37:49,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:37:49,614 INFO L82 PathProgramCache]: Analyzing trace with hash 702425416, now seen corresponding path program 55 times [2019-10-03 02:37:49,614 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:37:49,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:49,615 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-03 02:37:49,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:49,615 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:37:49,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:37:53,014 INFO L134 CoverageAnalysis]: Checked inductivity of 7921 backedges. 0 proven. 7921 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:53,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:37:53,014 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:37:53,014 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:37:53,015 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:37:53,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:37:53,015 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 02:37:53,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:37:53,233 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 02:37:53,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:37:53,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 100 conjunts are in the unsatisfiable core [2019-10-03 02:37:53,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:37:53,334 INFO L134 CoverageAnalysis]: Checked inductivity of 7921 backedges. 0 proven. 7921 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:53,335 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:37:56,708 INFO L134 CoverageAnalysis]: Checked inductivity of 7921 backedges. 0 proven. 7921 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:56,712 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:37:56,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101, 101] total 102 [2019-10-03 02:37:56,712 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:37:56,713 INFO L454 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-10-03 02:37:56,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-10-03 02:37:56,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:37:56,714 INFO L87 Difference]: Start difference. First operand 206 states and 207 transitions. Second operand 101 states. [2019-10-03 02:37:57,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:37:57,212 INFO L93 Difference]: Finished difference Result 209 states and 210 transitions. [2019-10-03 02:37:57,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-10-03 02:37:57,213 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 205 [2019-10-03 02:37:57,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:37:57,214 INFO L225 Difference]: With dead ends: 209 [2019-10-03 02:37:57,214 INFO L226 Difference]: Without dead ends: 209 [2019-10-03 02:37:57,214 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 510 GetRequests, 312 SyntacticMatches, 98 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4851 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:37:57,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-10-03 02:37:57,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 208. [2019-10-03 02:37:57,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-10-03 02:37:57,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 209 transitions. [2019-10-03 02:37:57,218 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 209 transitions. Word has length 205 [2019-10-03 02:37:57,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:37:57,218 INFO L475 AbstractCegarLoop]: Abstraction has 208 states and 209 transitions. [2019-10-03 02:37:57,218 INFO L476 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-10-03 02:37:57,218 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 209 transitions. [2019-10-03 02:37:57,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-10-03 02:37:57,219 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:37:57,219 INFO L411 BasicCegarLoop]: trace histogram [90, 49, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:37:57,219 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:37:57,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:37:57,219 INFO L82 PathProgramCache]: Analyzing trace with hash 713420962, now seen corresponding path program 56 times [2019-10-03 02:37:57,220 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:37:57,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:57,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:37:57,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:57,221 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:37:57,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:38:00,682 INFO L134 CoverageAnalysis]: Checked inductivity of 8100 backedges. 0 proven. 8100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:38:00,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:38:00,683 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:38:00,683 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:38:00,683 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:38:00,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:38:00,683 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 02:38:00,918 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-03 02:38:00,919 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-10-03 02:38:01,059 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 91 check-sat command(s) [2019-10-03 02:38:01,060 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-03 02:38:01,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 101 conjunts are in the unsatisfiable core [2019-10-03 02:38:01,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:38:01,094 INFO L134 CoverageAnalysis]: Checked inductivity of 8100 backedges. 0 proven. 8100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:38:01,094 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:38:04,482 INFO L134 CoverageAnalysis]: Checked inductivity of 8100 backedges. 0 proven. 8100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:38:04,486 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:38:04,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102, 102, 102] total 102 [2019-10-03 02:38:04,486 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:38:04,487 INFO L454 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-10-03 02:38:04,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-10-03 02:38:04,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:38:04,488 INFO L87 Difference]: Start difference. First operand 208 states and 209 transitions. Second operand 102 states. [2019-10-03 02:38:04,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:38:04,910 INFO L93 Difference]: Finished difference Result 210 states and 211 transitions. [2019-10-03 02:38:04,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-10-03 02:38:04,910 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 207 [2019-10-03 02:38:04,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:38:04,912 INFO L225 Difference]: With dead ends: 210 [2019-10-03 02:38:04,912 INFO L226 Difference]: Without dead ends: 210 [2019-10-03 02:38:04,912 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 515 GetRequests, 315 SyntacticMatches, 100 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4950 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-10-03 02:38:04,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-10-03 02:38:04,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2019-10-03 02:38:04,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-10-03 02:38:04,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 211 transitions. [2019-10-03 02:38:04,914 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 211 transitions. Word has length 207 [2019-10-03 02:38:04,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:38:04,914 INFO L475 AbstractCegarLoop]: Abstraction has 210 states and 211 transitions. [2019-10-03 02:38:04,915 INFO L476 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-10-03 02:38:04,915 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 211 transitions. [2019-10-03 02:38:04,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-10-03 02:38:04,915 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:38:04,916 INFO L411 BasicCegarLoop]: trace histogram [91, 50, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:38:04,916 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:38:04,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:38:04,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1604761220, now seen corresponding path program 57 times [2019-10-03 02:38:04,917 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:38:04,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:04,918 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-03 02:38:04,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:04,918 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:38:04,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:38:06,668 INFO L134 CoverageAnalysis]: Checked inductivity of 8281 backedges. 0 proven. 6559 refuted. 0 times theorem prover too weak. 1722 trivial. 0 not checked. [2019-10-03 02:38:06,668 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:38:06,668 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:38:06,668 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:38:06,669 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:38:06,669 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:38:06,669 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 02:38:06,891 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-03 02:38:06,892 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-10-03 02:38:06,968 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-03 02:38:06,968 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-03 02:38:06,971 INFO L256 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 108 conjunts are in the unsatisfiable core [2019-10-03 02:38:06,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:38:07,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:38:07,141 INFO L134 CoverageAnalysis]: Checked inductivity of 8281 backedges. 0 proven. 6559 refuted. 0 times theorem prover too weak. 1722 trivial. 0 not checked. [2019-10-03 02:38:07,141 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:38:07,311 INFO L134 CoverageAnalysis]: Checked inductivity of 8281 backedges. 0 proven. 6559 refuted. 0 times theorem prover too weak. 1722 trivial. 0 not checked. [2019-10-03 02:38:07,316 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:38:07,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 55 [2019-10-03 02:38:07,317 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:38:07,317 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-10-03 02:38:07,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-10-03 02:38:07,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=2862, Unknown=0, NotChecked=0, Total=2970 [2019-10-03 02:38:07,318 INFO L87 Difference]: Start difference. First operand 210 states and 211 transitions. Second operand 55 states. [2019-10-03 02:38:09,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:38:09,189 INFO L93 Difference]: Finished difference Result 214 states and 215 transitions. [2019-10-03 02:38:09,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-10-03 02:38:09,189 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 209 [2019-10-03 02:38:09,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:38:09,191 INFO L225 Difference]: With dead ends: 214 [2019-10-03 02:38:09,191 INFO L226 Difference]: Without dead ends: 213 [2019-10-03 02:38:09,191 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 472 GetRequests, 416 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=113, Invalid=2967, Unknown=0, NotChecked=0, Total=3080 [2019-10-03 02:38:09,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-10-03 02:38:09,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 212. [2019-10-03 02:38:09,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-10-03 02:38:09,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 213 transitions. [2019-10-03 02:38:09,194 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 213 transitions. Word has length 209 [2019-10-03 02:38:09,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:38:09,195 INFO L475 AbstractCegarLoop]: Abstraction has 212 states and 213 transitions. [2019-10-03 02:38:09,195 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-10-03 02:38:09,195 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 213 transitions. [2019-10-03 02:38:09,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-10-03 02:38:09,196 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:38:09,196 INFO L411 BasicCegarLoop]: trace histogram [92, 51, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:38:09,196 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:38:09,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:38:09,197 INFO L82 PathProgramCache]: Analyzing trace with hash -289811498, now seen corresponding path program 58 times [2019-10-03 02:38:09,197 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:38:09,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:09,199 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-03 02:38:09,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:09,199 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:38:09,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:38:10,303 INFO L134 CoverageAnalysis]: Checked inductivity of 8464 backedges. 6742 proven. 0 refuted. 0 times theorem prover too weak. 1722 trivial. 0 not checked. [2019-10-03 02:38:10,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:38:10,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2019-10-03 02:38:10,304 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:38:10,304 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-10-03 02:38:10,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-10-03 02:38:10,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-10-03 02:38:10,304 INFO L87 Difference]: Start difference. First operand 212 states and 213 transitions. Second operand 52 states. [2019-10-03 02:38:10,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:38:10,610 INFO L93 Difference]: Finished difference Result 207 states and 207 transitions. [2019-10-03 02:38:10,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-10-03 02:38:10,611 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 211 [2019-10-03 02:38:10,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:38:10,611 INFO L225 Difference]: With dead ends: 207 [2019-10-03 02:38:10,611 INFO L226 Difference]: Without dead ends: 0 [2019-10-03 02:38:10,612 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-10-03 02:38:10,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-03 02:38:10,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-03 02:38:10,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-03 02:38:10,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-03 02:38:10,613 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 211 [2019-10-03 02:38:10,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:38:10,613 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-03 02:38:10,614 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-10-03 02:38:10,614 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-03 02:38:10,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-03 02:38:10,620 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 02:38:10 BoogieIcfgContainer [2019-10-03 02:38:10,620 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-03 02:38:10,623 INFO L168 Benchmark]: Toolchain (without parser) took 284487.47 ms. Allocated memory was 132.6 MB in the beginning and 957.3 MB in the end (delta: 824.7 MB). Free memory was 88.1 MB in the beginning and 639.0 MB in the end (delta: -550.9 MB). Peak memory consumption was 273.8 MB. Max. memory is 7.1 GB. [2019-10-03 02:38:10,623 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 132.6 MB. Free memory was 106.8 MB in the beginning and 106.6 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-03 02:38:10,624 INFO L168 Benchmark]: CACSL2BoogieTranslator took 430.33 ms. Allocated memory was 132.6 MB in the beginning and 199.2 MB in the end (delta: 66.6 MB). Free memory was 87.9 MB in the beginning and 176.4 MB in the end (delta: -88.5 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. [2019-10-03 02:38:10,625 INFO L168 Benchmark]: Boogie Preprocessor took 38.11 ms. Allocated memory is still 199.2 MB. Free memory was 176.4 MB in the beginning and 174.1 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. [2019-10-03 02:38:10,625 INFO L168 Benchmark]: RCFGBuilder took 329.22 ms. Allocated memory is still 199.2 MB. Free memory was 174.1 MB in the beginning and 157.4 MB in the end (delta: 16.7 MB). Peak memory consumption was 16.7 MB. Max. memory is 7.1 GB. [2019-10-03 02:38:10,626 INFO L168 Benchmark]: TraceAbstraction took 283677.97 ms. Allocated memory was 199.2 MB in the beginning and 957.3 MB in the end (delta: 758.1 MB). Free memory was 157.4 MB in the beginning and 639.0 MB in the end (delta: -481.6 MB). Peak memory consumption was 276.5 MB. Max. memory is 7.1 GB. [2019-10-03 02:38:10,629 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 132.6 MB. Free memory was 106.8 MB in the beginning and 106.6 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 430.33 ms. Allocated memory was 132.6 MB in the beginning and 199.2 MB in the end (delta: 66.6 MB). Free memory was 87.9 MB in the beginning and 176.4 MB in the end (delta: -88.5 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.11 ms. Allocated memory is still 199.2 MB. Free memory was 176.4 MB in the beginning and 174.1 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 329.22 ms. Allocated memory is still 199.2 MB. Free memory was 174.1 MB in the beginning and 157.4 MB in the end (delta: 16.7 MB). Peak memory consumption was 16.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 283677.97 ms. Allocated memory was 199.2 MB in the beginning and 957.3 MB in the end (delta: 758.1 MB). Free memory was 157.4 MB in the beginning and 639.0 MB in the end (delta: -481.6 MB). Peak memory consumption was 276.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 91]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 33 locations, 1 error locations. SAFE Result, 283.6s OverallTime, 61 OverallIterations, 92 TraceHistogramMax, 24.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 666 SDtfs, 4221 SDslu, 20954 SDs, 0 SdLazy, 20981 SolverSat, 3664 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 20502 GetRequests, 13399 SyntacticMatches, 2158 SemanticMatches, 4945 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103033 ImplicationChecksByTransitivity, 239.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=212occurred in iteration=60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 61 MinimizatonAttempts, 49 StatesRemovedByMinimization, 49 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 4.0s SatisfiabilityAnalysisTime, 245.1s InterpolantComputationTime, 16792 NumberOfCodeBlocks, 16280 NumberOfCodeBlocksAsserted, 998 NumberOfCheckSat, 24866 ConstructedInterpolants, 0 QuantifiedInterpolants, 11246412 SizeOfPredicates, 67 NumberOfNonLiveVariables, 18974 ConjunctsInSsa, 3326 ConjunctsInUnsatCore, 175 InterpolantComputations, 4 PerfectInterpolantSequences, 96377/696572 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...