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-112bae1 [2019-09-10 02:06:03,724 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 02:06:03,726 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 02:06:03,738 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 02:06:03,739 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 02:06:03,740 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 02:06:03,741 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 02:06:03,743 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 02:06:03,745 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 02:06:03,745 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 02:06:03,746 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 02:06:03,747 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 02:06:03,748 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 02:06:03,749 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 02:06:03,750 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 02:06:03,751 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 02:06:03,752 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 02:06:03,752 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 02:06:03,754 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 02:06:03,756 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 02:06:03,758 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 02:06:03,759 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 02:06:03,760 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 02:06:03,761 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 02:06:03,763 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 02:06:03,764 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 02:06:03,764 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 02:06:03,765 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 02:06:03,765 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 02:06:03,766 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 02:06:03,767 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 02:06:03,768 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 02:06:03,768 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 02:06:03,769 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 02:06:03,770 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 02:06:03,770 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 02:06:03,771 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 02:06:03,771 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 02:06:03,771 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 02:06:03,772 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 02:06:03,773 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 02:06:03,774 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 02:06:03,788 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 02:06:03,789 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 02:06:03,789 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 02:06:03,789 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 02:06:03,790 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 02:06:03,790 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 02:06:03,790 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 02:06:03,790 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 02:06:03,791 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 02:06:03,791 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 02:06:03,791 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 02:06:03,792 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 02:06:03,792 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 02:06:03,792 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 02:06:03,792 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 02:06:03,792 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 02:06:03,792 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 02:06:03,793 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 02:06:03,793 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 02:06:03,793 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 02:06:03,793 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 02:06:03,793 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 02:06:03,794 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 02:06:03,794 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 02:06:03,794 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 02:06:03,794 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 02:06:03,795 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 02:06:03,795 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 02:06:03,795 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 02:06:03,795 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 02:06:03,828 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 02:06:03,842 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 02:06:03,845 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 02:06:03,846 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 02:06:03,847 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 02:06:03,849 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-09-10 02:06:03,916 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a7435938/4a642cbf249d4230bf96e33d0c3f16b3/FLAGf8100f40b [2019-09-10 02:06:04,397 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 02:06:04,397 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gj2007.c.i.p+lhb-reducer.c [2019-09-10 02:06:04,404 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a7435938/4a642cbf249d4230bf96e33d0c3f16b3/FLAGf8100f40b [2019-09-10 02:06:04,809 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a7435938/4a642cbf249d4230bf96e33d0c3f16b3 [2019-09-10 02:06:04,818 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 02:06:04,819 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 02:06:04,821 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 02:06:04,821 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 02:06:04,824 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 02:06:04,825 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:06:04" (1/1) ... [2019-09-10 02:06:04,828 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3db1b226 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:06:04, skipping insertion in model container [2019-09-10 02:06:04,828 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:06:04" (1/1) ... [2019-09-10 02:06:04,836 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 02:06:04,864 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 02:06:05,064 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:06:05,070 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 02:06:05,181 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:06:05,198 INFO L192 MainTranslator]: Completed translation [2019-09-10 02:06:05,198 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:06:05 WrapperNode [2019-09-10 02:06:05,198 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 02:06:05,199 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 02:06:05,199 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 02:06:05,200 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 02:06:05,213 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:06:05" (1/1) ... [2019-09-10 02:06:05,213 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:06:05" (1/1) ... [2019-09-10 02:06:05,219 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:06:05" (1/1) ... [2019-09-10 02:06:05,220 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:06:05" (1/1) ... [2019-09-10 02:06:05,225 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:06:05" (1/1) ... [2019-09-10 02:06:05,229 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:06:05" (1/1) ... [2019-09-10 02:06:05,230 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:06:05" (1/1) ... [2019-09-10 02:06:05,232 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 02:06:05,233 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 02:06:05,233 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 02:06:05,233 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 02:06:05,234 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:06:05" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 02:06:05,288 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 02:06:05,288 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 02:06:05,288 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 02:06:05,288 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 02:06:05,289 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 02:06:05,289 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-10 02:06:05,289 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-10 02:06:05,289 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 02:06:05,289 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 02:06:05,289 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 02:06:05,594 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 02:06:05,594 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 02:06:05,595 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:06:05 BoogieIcfgContainer [2019-09-10 02:06:05,595 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 02:06:05,596 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 02:06:05,597 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 02:06:05,599 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 02:06:05,599 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 02:06:04" (1/3) ... [2019-09-10 02:06:05,600 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@121b825 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:06:05, skipping insertion in model container [2019-09-10 02:06:05,600 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:06:05" (2/3) ... [2019-09-10 02:06:05,600 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@121b825 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:06:05, skipping insertion in model container [2019-09-10 02:06:05,600 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:06:05" (3/3) ... [2019-09-10 02:06:05,602 INFO L109 eAbstractionObserver]: Analyzing ICFG gj2007.c.i.p+lhb-reducer.c [2019-09-10 02:06:05,610 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 02:06:05,616 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 02:06:05,630 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 02:06:05,657 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 02:06:05,658 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 02:06:05,658 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 02:06:05,658 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 02:06:05,658 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 02:06:05,658 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 02:06:05,658 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 02:06:05,659 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 02:06:05,672 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2019-09-10 02:06:05,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-10 02:06:05,680 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:06:05,681 INFO L399 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-09-10 02:06:05,683 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:06:05,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:06:05,687 INFO L82 PathProgramCache]: Analyzing trace with hash -535062244, now seen corresponding path program 1 times [2019-09-10 02:06:05,689 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:06:05,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:05,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:06:05,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:05,726 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:06:05,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:06:05,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:06:05,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:06:05,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:06:05,856 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:06:05,861 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:06:05,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:06:05,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:06:05,879 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 3 states. [2019-09-10 02:06:06,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:06:06,171 INFO L93 Difference]: Finished difference Result 51 states and 79 transitions. [2019-09-10 02:06:06,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:06:06,174 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-09-10 02:06:06,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:06:06,190 INFO L225 Difference]: With dead ends: 51 [2019-09-10 02:06:06,190 INFO L226 Difference]: Without dead ends: 47 [2019-09-10 02:06:06,194 INFO L628 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-09-10 02:06:06,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-09-10 02:06:06,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-09-10 02:06:06,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-09-10 02:06:06,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 58 transitions. [2019-09-10 02:06:06,236 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 58 transitions. Word has length 27 [2019-09-10 02:06:06,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:06:06,237 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 58 transitions. [2019-09-10 02:06:06,237 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:06:06,238 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 58 transitions. [2019-09-10 02:06:06,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-10 02:06:06,240 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:06:06,241 INFO L399 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-09-10 02:06:06,242 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:06:06,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:06:06,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1447563500, now seen corresponding path program 1 times [2019-09-10 02:06:06,243 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:06:06,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:06,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:06:06,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:06,245 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:06:06,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:06:06,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:06:06,357 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:06:06,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 02:06:06,358 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:06:06,360 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 02:06:06,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 02:06:06,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:06:06,361 INFO L87 Difference]: Start difference. First operand 47 states and 58 transitions. Second operand 5 states. [2019-09-10 02:06:06,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:06:06,460 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2019-09-10 02:06:06,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 02:06:06,461 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-09-10 02:06:06,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:06:06,462 INFO L225 Difference]: With dead ends: 41 [2019-09-10 02:06:06,463 INFO L226 Difference]: Without dead ends: 41 [2019-09-10 02:06:06,463 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:06:06,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-09-10 02:06:06,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-09-10 02:06:06,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-09-10 02:06:06,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2019-09-10 02:06:06,470 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 27 [2019-09-10 02:06:06,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:06:06,470 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2019-09-10 02:06:06,471 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 02:06:06,471 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2019-09-10 02:06:06,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-10 02:06:06,472 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:06:06,472 INFO L399 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-09-10 02:06:06,472 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:06:06,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:06:06,473 INFO L82 PathProgramCache]: Analyzing trace with hash -646102720, now seen corresponding path program 1 times [2019-09-10 02:06:06,473 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:06:06,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:06,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:06:06,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:06,474 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:06:06,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:06:06,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:06:06,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:06:06,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 02:06:06,556 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:06:06,557 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 02:06:06,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 02:06:06,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:06:06,558 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand 7 states. [2019-09-10 02:06:06,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:06:06,687 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2019-09-10 02:06:06,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 02:06:06,688 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2019-09-10 02:06:06,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:06:06,690 INFO L225 Difference]: With dead ends: 37 [2019-09-10 02:06:06,690 INFO L226 Difference]: Without dead ends: 37 [2019-09-10 02:06:06,690 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:06:06,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-09-10 02:06:06,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-09-10 02:06:06,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-09-10 02:06:06,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2019-09-10 02:06:06,698 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 27 [2019-09-10 02:06:06,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:06:06,699 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2019-09-10 02:06:06,699 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 02:06:06,701 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2019-09-10 02:06:06,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-10 02:06:06,703 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:06:06,703 INFO L399 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-09-10 02:06:06,703 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:06:06,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:06:06,704 INFO L82 PathProgramCache]: Analyzing trace with hash 2117052275, now seen corresponding path program 1 times [2019-09-10 02:06:06,704 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:06:06,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:06,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:06:06,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:06,706 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:06:06,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:06:06,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:06:06,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:06:06,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 02:06:06,867 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:06:06,868 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 02:06:06,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 02:06:06,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-10 02:06:06,868 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand 10 states. [2019-09-10 02:06:06,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:06:06,998 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2019-09-10 02:06:06,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 02:06:06,998 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2019-09-10 02:06:06,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:06:06,999 INFO L225 Difference]: With dead ends: 31 [2019-09-10 02:06:07,000 INFO L226 Difference]: Without dead ends: 31 [2019-09-10 02:06:07,000 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-10 02:06:07,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-09-10 02:06:07,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-09-10 02:06:07,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-10 02:06:07,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2019-09-10 02:06:07,007 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 27 [2019-09-10 02:06:07,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:06:07,010 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2019-09-10 02:06:07,010 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 02:06:07,010 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2019-09-10 02:06:07,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-10 02:06:07,011 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:06:07,011 INFO L399 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-09-10 02:06:07,012 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:06:07,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:06:07,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1286240867, now seen corresponding path program 1 times [2019-09-10 02:06:07,012 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:06:07,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:07,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:06:07,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:07,014 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:06:07,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:06:07,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:06:07,063 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:06:07,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:06:07,064 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:06:07,066 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:06:07,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:06:07,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:06:07,066 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 3 states. [2019-09-10 02:06:07,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:06:07,113 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2019-09-10 02:06:07,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:06:07,114 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-09-10 02:06:07,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:06:07,117 INFO L225 Difference]: With dead ends: 31 [2019-09-10 02:06:07,117 INFO L226 Difference]: Without dead ends: 31 [2019-09-10 02:06:07,118 INFO L628 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-09-10 02:06:07,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-09-10 02:06:07,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-09-10 02:06:07,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-10 02:06:07,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2019-09-10 02:06:07,125 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 27 [2019-09-10 02:06:07,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:06:07,125 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2019-09-10 02:06:07,125 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:06:07,126 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2019-09-10 02:06:07,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-10 02:06:07,128 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:06:07,128 INFO L399 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-09-10 02:06:07,129 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:06:07,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:06:07,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1286806896, now seen corresponding path program 1 times [2019-09-10 02:06:07,131 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:06:07,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:07,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:06:07,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:07,132 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:06:07,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:06:07,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:06:07,262 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:06:07,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 02:06:07,262 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:06:07,262 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 02:06:07,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 02:06:07,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-10 02:06:07,263 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 11 states. [2019-09-10 02:06:07,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:06:07,346 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2019-09-10 02:06:07,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 02:06:07,347 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2019-09-10 02:06:07,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:06:07,348 INFO L225 Difference]: With dead ends: 31 [2019-09-10 02:06:07,348 INFO L226 Difference]: Without dead ends: 31 [2019-09-10 02:06:07,349 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-10 02:06:07,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-09-10 02:06:07,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-09-10 02:06:07,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-10 02:06:07,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2019-09-10 02:06:07,353 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 27 [2019-09-10 02:06:07,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:06:07,355 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2019-09-10 02:06:07,355 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 02:06:07,355 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2019-09-10 02:06:07,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-10 02:06:07,356 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:06:07,356 INFO L399 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-09-10 02:06:07,358 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:06:07,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:06:07,359 INFO L82 PathProgramCache]: Analyzing trace with hash -880646403, now seen corresponding path program 1 times [2019-09-10 02:06:07,359 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:06:07,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:07,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:06:07,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:07,362 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:06:07,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:06:07,487 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:06:07,487 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:06:07,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 02:06:07,487 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:06:07,488 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 02:06:07,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 02:06:07,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-10 02:06:07,489 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 12 states. [2019-09-10 02:06:07,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:06:07,596 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2019-09-10 02:06:07,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 02:06:07,596 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 29 [2019-09-10 02:06:07,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:06:07,597 INFO L225 Difference]: With dead ends: 33 [2019-09-10 02:06:07,597 INFO L226 Difference]: Without dead ends: 33 [2019-09-10 02:06:07,598 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-10 02:06:07,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-09-10 02:06:07,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-09-10 02:06:07,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-10 02:06:07,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2019-09-10 02:06:07,607 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 29 [2019-09-10 02:06:07,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:06:07,607 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2019-09-10 02:06:07,607 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 02:06:07,607 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2019-09-10 02:06:07,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-10 02:06:07,608 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:06:07,609 INFO L399 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-09-10 02:06:07,609 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:06:07,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:06:07,609 INFO L82 PathProgramCache]: Analyzing trace with hash -286061766, now seen corresponding path program 1 times [2019-09-10 02:06:07,610 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:06:07,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:07,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:06:07,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:07,611 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:06:07,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:06:07,755 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:06:07,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:07,756 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:06:07,757 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 32 with the following transitions: [2019-09-10 02:06:07,759 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-09-10 02:06:07,796 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 02:06:07,796 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 02:06:07,914 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 02:06:07,916 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-09-10 02:06:07,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:06:07,922 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 02:06:07,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:07,922 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:06:07,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:06:07,957 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:06:07,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:06:07,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-10 02:06:08,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:06:08,053 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:06:08,053 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:06:08,320 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:06:08,324 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:06:08,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 24 [2019-09-10 02:06:08,325 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:06:08,325 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 02:06:08,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 02:06:08,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-09-10 02:06:08,326 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 13 states. [2019-09-10 02:06:08,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:06:08,437 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2019-09-10 02:06:08,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 02:06:08,438 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 31 [2019-09-10 02:06:08,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:06:08,439 INFO L225 Difference]: With dead ends: 35 [2019-09-10 02:06:08,439 INFO L226 Difference]: Without dead ends: 35 [2019-09-10 02:06:08,442 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-09-10 02:06:08,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-09-10 02:06:08,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-09-10 02:06:08,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-09-10 02:06:08,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2019-09-10 02:06:08,450 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 31 [2019-09-10 02:06:08,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:06:08,451 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2019-09-10 02:06:08,451 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 02:06:08,451 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2019-09-10 02:06:08,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-10 02:06:08,452 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:06:08,452 INFO L399 BasicCegarLoop]: trace histogram [3, 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] [2019-09-10 02:06:08,456 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:06:08,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:06:08,456 INFO L82 PathProgramCache]: Analyzing trace with hash -120875977, now seen corresponding path program 2 times [2019-09-10 02:06:08,456 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:06:08,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:08,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:06:08,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:08,458 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:06:08,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:06:08,600 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:06:08,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:08,600 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:06:08,600 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:06:08,600 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:06:08,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:08,601 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:06:08,626 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:06:08,626 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:06:08,648 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-10 02:06:08,648 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:06:08,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-10 02:06:08,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:06:08,879 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:06:08,879 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:06:09,280 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:06:09,284 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:06:09,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 38 [2019-09-10 02:06:09,285 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:06:09,286 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-10 02:06:09,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-10 02:06:09,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-09-10 02:06:09,287 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 26 states. [2019-09-10 02:06:09,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:06:09,448 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2019-09-10 02:06:09,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 02:06:09,448 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 33 [2019-09-10 02:06:09,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:06:09,449 INFO L225 Difference]: With dead ends: 59 [2019-09-10 02:06:09,449 INFO L226 Difference]: Without dead ends: 59 [2019-09-10 02:06:09,450 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-09-10 02:06:09,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-09-10 02:06:09,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2019-09-10 02:06:09,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-09-10 02:06:09,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2019-09-10 02:06:09,455 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 33 [2019-09-10 02:06:09,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:06:09,455 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2019-09-10 02:06:09,456 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-10 02:06:09,456 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2019-09-10 02:06:09,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-10 02:06:09,457 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:06:09,457 INFO L399 BasicCegarLoop]: trace histogram [15, 12, 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-09-10 02:06:09,457 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:06:09,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:06:09,458 INFO L82 PathProgramCache]: Analyzing trace with hash -1917273006, now seen corresponding path program 3 times [2019-09-10 02:06:09,458 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:06:09,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:09,459 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:06:09,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:09,459 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:06:09,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:06:09,594 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 92 proven. 12 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-09-10 02:06:09,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:09,595 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:06:09,595 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:06:09,595 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:06:09,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:09,595 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:06:09,611 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:06:09,612 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:06:09,637 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:06:09,637 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:06:09,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-10 02:06:09,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:06:09,653 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 92 proven. 12 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-09-10 02:06:09,653 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:06:09,937 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 92 proven. 12 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-09-10 02:06:09,941 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:06:09,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 28 [2019-09-10 02:06:09,942 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:06:09,942 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 02:06:09,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 02:06:09,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-09-10 02:06:09,943 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand 15 states. [2019-09-10 02:06:10,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:06:10,053 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2019-09-10 02:06:10,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 02:06:10,054 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 57 [2019-09-10 02:06:10,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:06:10,055 INFO L225 Difference]: With dead ends: 60 [2019-09-10 02:06:10,055 INFO L226 Difference]: Without dead ends: 60 [2019-09-10 02:06:10,056 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-09-10 02:06:10,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-09-10 02:06:10,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-09-10 02:06:10,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-09-10 02:06:10,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2019-09-10 02:06:10,061 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 57 [2019-09-10 02:06:10,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:06:10,062 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2019-09-10 02:06:10,062 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 02:06:10,062 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2019-09-10 02:06:10,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-10 02:06:10,063 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:06:10,063 INFO L399 BasicCegarLoop]: trace histogram [16, 12, 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-09-10 02:06:10,063 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:06:10,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:06:10,064 INFO L82 PathProgramCache]: Analyzing trace with hash 798282511, now seen corresponding path program 4 times [2019-09-10 02:06:10,064 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:06:10,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:10,065 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:06:10,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:10,065 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:06:10,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:06:10,203 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 115 proven. 20 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-09-10 02:06:10,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:10,204 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:06:10,204 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:06:10,204 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:06:10,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:10,204 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:06:10,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:06:10,215 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:06:10,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:06:10,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-10 02:06:10,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:06:10,255 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 115 proven. 20 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-09-10 02:06:10,256 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:06:10,885 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 115 proven. 20 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-09-10 02:06:10,889 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:06:10,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 30 [2019-09-10 02:06:10,889 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:06:10,890 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 02:06:10,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 02:06:10,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-09-10 02:06:10,891 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 16 states. [2019-09-10 02:06:11,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:06:11,034 INFO L93 Difference]: Finished difference Result 62 states and 63 transitions. [2019-09-10 02:06:11,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 02:06:11,035 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 59 [2019-09-10 02:06:11,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:06:11,036 INFO L225 Difference]: With dead ends: 62 [2019-09-10 02:06:11,036 INFO L226 Difference]: Without dead ends: 62 [2019-09-10 02:06:11,037 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-09-10 02:06:11,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-09-10 02:06:11,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-09-10 02:06:11,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-09-10 02:06:11,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2019-09-10 02:06:11,040 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 59 [2019-09-10 02:06:11,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:06:11,041 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2019-09-10 02:06:11,041 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 02:06:11,041 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2019-09-10 02:06:11,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-10 02:06:11,042 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:06:11,042 INFO L399 BasicCegarLoop]: trace histogram [17, 12, 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-09-10 02:06:11,042 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:06:11,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:06:11,043 INFO L82 PathProgramCache]: Analyzing trace with hash -892981620, now seen corresponding path program 5 times [2019-09-10 02:06:11,043 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:06:11,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:11,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:06:11,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:11,044 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:06:11,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:06:11,206 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 138 proven. 30 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-09-10 02:06:11,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:11,207 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:06:11,207 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:06:11,207 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:06:11,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:11,207 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-09-10 02:06:11,217 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:06:11,217 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:06:11,244 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-09-10 02:06:11,244 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:06:11,245 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-10 02:06:11,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:06:11,258 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 138 proven. 30 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-09-10 02:06:11,258 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:06:11,587 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 138 proven. 30 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-09-10 02:06:11,592 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:06:11,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 32 [2019-09-10 02:06:11,593 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:06:11,593 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 02:06:11,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 02:06:11,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-09-10 02:06:11,594 INFO L87 Difference]: Start difference. First operand 62 states and 63 transitions. Second operand 17 states. [2019-09-10 02:06:11,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:06:11,727 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2019-09-10 02:06:11,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 02:06:11,728 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 61 [2019-09-10 02:06:11,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:06:11,729 INFO L225 Difference]: With dead ends: 64 [2019-09-10 02:06:11,729 INFO L226 Difference]: Without dead ends: 64 [2019-09-10 02:06:11,730 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-09-10 02:06:11,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-09-10 02:06:11,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-09-10 02:06:11,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-09-10 02:06:11,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2019-09-10 02:06:11,738 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 61 [2019-09-10 02:06:11,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:06:11,738 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2019-09-10 02:06:11,738 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 02:06:11,738 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2019-09-10 02:06:11,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-10 02:06:11,739 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:06:11,740 INFO L399 BasicCegarLoop]: trace histogram [18, 12, 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-09-10 02:06:11,740 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:06:11,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:06:11,740 INFO L82 PathProgramCache]: Analyzing trace with hash 1594793673, now seen corresponding path program 6 times [2019-09-10 02:06:11,740 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:06:11,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:11,741 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:06:11,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:11,741 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:06:11,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:06:11,943 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 161 proven. 42 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-09-10 02:06:11,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:11,944 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:06:11,944 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:06:11,944 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:06:11,944 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:11,944 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 02:06:11,961 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:06:11,961 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:06:11,983 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:06:11,984 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:06:11,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-10 02:06:11,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:06:11,999 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 161 proven. 42 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-09-10 02:06:11,999 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:06:12,332 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 161 proven. 42 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-09-10 02:06:12,335 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:06:12,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 34 [2019-09-10 02:06:12,336 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:06:12,337 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 02:06:12,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 02:06:12,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 02:06:12,338 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand 18 states. [2019-09-10 02:06:12,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:06:12,471 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2019-09-10 02:06:12,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 02:06:12,471 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 63 [2019-09-10 02:06:12,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:06:12,472 INFO L225 Difference]: With dead ends: 66 [2019-09-10 02:06:12,472 INFO L226 Difference]: Without dead ends: 66 [2019-09-10 02:06:12,473 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 02:06:12,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-09-10 02:06:12,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-09-10 02:06:12,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-09-10 02:06:12,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 67 transitions. [2019-09-10 02:06:12,476 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 67 transitions. Word has length 63 [2019-09-10 02:06:12,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:06:12,477 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 67 transitions. [2019-09-10 02:06:12,477 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 02:06:12,477 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 67 transitions. [2019-09-10 02:06:12,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-10 02:06:12,478 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:06:12,478 INFO L399 BasicCegarLoop]: trace histogram [19, 12, 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-09-10 02:06:12,479 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:06:12,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:06:12,479 INFO L82 PathProgramCache]: Analyzing trace with hash 50066374, now seen corresponding path program 7 times [2019-09-10 02:06:12,479 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:06:12,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:12,480 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:06:12,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:12,480 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:06:12,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:06:12,651 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 184 proven. 56 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-09-10 02:06:12,651 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:12,651 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:06:12,651 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:06:12,651 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:06:12,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:12,652 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:06:12,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:06:12,665 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:06:12,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:06:12,700 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-10 02:06:12,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:06:12,713 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 184 proven. 56 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-09-10 02:06:12,713 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:06:13,136 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 184 proven. 56 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (8)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 02:06:13,139 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:06:13,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 36 [2019-09-10 02:06:13,140 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:06:13,140 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 02:06:13,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 02:06:13,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-09-10 02:06:13,143 INFO L87 Difference]: Start difference. First operand 66 states and 67 transitions. Second operand 19 states. [2019-09-10 02:06:13,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:06:13,271 INFO L93 Difference]: Finished difference Result 68 states and 69 transitions. [2019-09-10 02:06:13,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 02:06:13,272 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 65 [2019-09-10 02:06:13,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:06:13,273 INFO L225 Difference]: With dead ends: 68 [2019-09-10 02:06:13,273 INFO L226 Difference]: Without dead ends: 68 [2019-09-10 02:06:13,274 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-09-10 02:06:13,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-09-10 02:06:13,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-09-10 02:06:13,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-09-10 02:06:13,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2019-09-10 02:06:13,282 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 65 [2019-09-10 02:06:13,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:06:13,282 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2019-09-10 02:06:13,282 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 02:06:13,282 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2019-09-10 02:06:13,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-10 02:06:13,283 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:06:13,283 INFO L399 BasicCegarLoop]: trace histogram [20, 12, 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-09-10 02:06:13,283 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:06:13,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:06:13,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1625816451, now seen corresponding path program 8 times [2019-09-10 02:06:13,284 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:06:13,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:13,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:06:13,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:13,285 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:06:13,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:06:13,502 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 207 proven. 72 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-09-10 02:06:13,502 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:13,503 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:06:13,503 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:06:13,503 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:06:13,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:13,504 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 02:06:13,535 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:06:13,535 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:06:13,578 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2019-09-10 02:06:13,578 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:06:13,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-10 02:06:13,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:06:13,594 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 207 proven. 72 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-09-10 02:06:13,594 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:06:14,174 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 207 proven. 72 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-09-10 02:06:14,180 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:06:14,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 38 [2019-09-10 02:06:14,180 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:06:14,182 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 02:06:14,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 02:06:14,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-09-10 02:06:14,183 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand 20 states. [2019-09-10 02:06:14,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:06:14,290 INFO L93 Difference]: Finished difference Result 70 states and 71 transitions. [2019-09-10 02:06:14,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 02:06:14,290 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 67 [2019-09-10 02:06:14,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:06:14,291 INFO L225 Difference]: With dead ends: 70 [2019-09-10 02:06:14,291 INFO L226 Difference]: Without dead ends: 70 [2019-09-10 02:06:14,292 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-09-10 02:06:14,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-09-10 02:06:14,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-09-10 02:06:14,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-09-10 02:06:14,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2019-09-10 02:06:14,301 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 67 [2019-09-10 02:06:14,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:06:14,302 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2019-09-10 02:06:14,302 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 02:06:14,302 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2019-09-10 02:06:14,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-10 02:06:14,303 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:06:14,303 INFO L399 BasicCegarLoop]: trace histogram [21, 12, 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-09-10 02:06:14,307 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:06:14,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:06:14,308 INFO L82 PathProgramCache]: Analyzing trace with hash -201815040, now seen corresponding path program 9 times [2019-09-10 02:06:14,308 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:06:14,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:14,309 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:06:14,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:14,309 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:06:14,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:06:14,521 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 230 proven. 90 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-09-10 02:06:14,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:14,521 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:06:14,522 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:06:14,522 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:06:14,522 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:14,522 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:06:14,535 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:06:14,535 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:06:14,559 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:06:14,560 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:06:14,560 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-10 02:06:14,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:06:14,574 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 230 proven. 90 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-09-10 02:06:14,574 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:06:15,155 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 230 proven. 90 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-09-10 02:06:15,159 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:06:15,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 40 [2019-09-10 02:06:15,160 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:06:15,160 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 02:06:15,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 02:06:15,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-09-10 02:06:15,161 INFO L87 Difference]: Start difference. First operand 70 states and 71 transitions. Second operand 21 states. [2019-09-10 02:06:15,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:06:15,291 INFO L93 Difference]: Finished difference Result 72 states and 73 transitions. [2019-09-10 02:06:15,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 02:06:15,292 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 69 [2019-09-10 02:06:15,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:06:15,293 INFO L225 Difference]: With dead ends: 72 [2019-09-10 02:06:15,293 INFO L226 Difference]: Without dead ends: 72 [2019-09-10 02:06:15,294 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 120 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-09-10 02:06:15,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-09-10 02:06:15,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-09-10 02:06:15,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-09-10 02:06:15,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2019-09-10 02:06:15,296 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 69 [2019-09-10 02:06:15,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:06:15,297 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2019-09-10 02:06:15,297 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 02:06:15,297 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2019-09-10 02:06:15,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-10 02:06:15,298 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:06:15,298 INFO L399 BasicCegarLoop]: trace histogram [22, 12, 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-09-10 02:06:15,298 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:06:15,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:06:15,299 INFO L82 PathProgramCache]: Analyzing trace with hash 85946173, now seen corresponding path program 10 times [2019-09-10 02:06:15,299 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:06:15,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:15,300 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:06:15,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:15,300 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:06:15,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:06:15,499 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 253 proven. 110 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-09-10 02:06:15,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:15,500 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:06:15,500 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:06:15,500 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:06:15,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:15,500 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:06:15,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:06:15,512 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:06:15,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:06:15,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-10 02:06:15,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:06:15,550 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 253 proven. 110 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-09-10 02:06:15,550 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:06:16,453 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 253 proven. 110 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-09-10 02:06:16,458 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:06:16,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 42 [2019-09-10 02:06:16,459 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:06:16,459 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 02:06:16,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 02:06:16,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-09-10 02:06:16,460 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand 22 states. [2019-09-10 02:06:16,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:06:16,588 INFO L93 Difference]: Finished difference Result 74 states and 75 transitions. [2019-09-10 02:06:16,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-10 02:06:16,590 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 71 [2019-09-10 02:06:16,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:06:16,591 INFO L225 Difference]: With dead ends: 74 [2019-09-10 02:06:16,591 INFO L226 Difference]: Without dead ends: 74 [2019-09-10 02:06:16,595 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-09-10 02:06:16,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-09-10 02:06:16,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-09-10 02:06:16,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-09-10 02:06:16,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 75 transitions. [2019-09-10 02:06:16,597 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 75 transitions. Word has length 71 [2019-09-10 02:06:16,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:06:16,598 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 75 transitions. [2019-09-10 02:06:16,598 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 02:06:16,598 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 75 transitions. [2019-09-10 02:06:16,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-10 02:06:16,599 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:06:16,599 INFO L399 BasicCegarLoop]: trace histogram [23, 12, 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-09-10 02:06:16,599 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:06:16,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:06:16,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1746564922, now seen corresponding path program 11 times [2019-09-10 02:06:16,600 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:06:16,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:16,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:06:16,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:16,601 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:06:16,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:06:16,812 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 276 proven. 132 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-09-10 02:06:16,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:16,813 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:06:16,813 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:06:16,813 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:06:16,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:16,813 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:06:16,825 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:06:16,825 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:06:16,859 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-09-10 02:06:16,859 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:06:16,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-10 02:06:16,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:06:16,873 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 276 proven. 132 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-09-10 02:06:16,873 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:06:17,393 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 276 proven. 132 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-09-10 02:06:17,396 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:06:17,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 44 [2019-09-10 02:06:17,402 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:06:17,403 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-10 02:06:17,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-10 02:06:17,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-09-10 02:06:17,404 INFO L87 Difference]: Start difference. First operand 74 states and 75 transitions. Second operand 23 states. [2019-09-10 02:06:17,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:06:17,556 INFO L93 Difference]: Finished difference Result 76 states and 77 transitions. [2019-09-10 02:06:17,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 02:06:17,557 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 73 [2019-09-10 02:06:17,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:06:17,558 INFO L225 Difference]: With dead ends: 76 [2019-09-10 02:06:17,558 INFO L226 Difference]: Without dead ends: 76 [2019-09-10 02:06:17,560 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-09-10 02:06:17,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-09-10 02:06:17,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-09-10 02:06:17,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-09-10 02:06:17,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 77 transitions. [2019-09-10 02:06:17,563 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 77 transitions. Word has length 73 [2019-09-10 02:06:17,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:06:17,563 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 77 transitions. [2019-09-10 02:06:17,563 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-10 02:06:17,563 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 77 transitions. [2019-09-10 02:06:17,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-10 02:06:17,564 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:06:17,564 INFO L399 BasicCegarLoop]: trace histogram [24, 12, 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-09-10 02:06:17,564 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:06:17,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:06:17,565 INFO L82 PathProgramCache]: Analyzing trace with hash -126651401, now seen corresponding path program 12 times [2019-09-10 02:06:17,565 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:06:17,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:17,566 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:06:17,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:17,566 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:06:17,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:06:17,809 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 299 proven. 156 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-09-10 02:06:17,809 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:17,809 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:06:17,810 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:06:17,810 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:06:17,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:17,810 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:06:17,821 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:06:17,821 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:06:17,848 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:06:17,849 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:06:17,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-10 02:06:17,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:06:17,862 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 299 proven. 156 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-09-10 02:06:17,863 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:06:18,405 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 299 proven. 156 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (13)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 02:06:18,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:06:18,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 46 [2019-09-10 02:06:18,408 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:06:18,409 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-10 02:06:18,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-10 02:06:18,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-09-10 02:06:18,410 INFO L87 Difference]: Start difference. First operand 76 states and 77 transitions. Second operand 24 states. [2019-09-10 02:06:18,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:06:18,548 INFO L93 Difference]: Finished difference Result 78 states and 79 transitions. [2019-09-10 02:06:18,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-10 02:06:18,549 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 75 [2019-09-10 02:06:18,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:06:18,550 INFO L225 Difference]: With dead ends: 78 [2019-09-10 02:06:18,550 INFO L226 Difference]: Without dead ends: 78 [2019-09-10 02:06:18,551 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-09-10 02:06:18,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-09-10 02:06:18,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-09-10 02:06:18,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-09-10 02:06:18,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 79 transitions. [2019-09-10 02:06:18,555 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 79 transitions. Word has length 75 [2019-09-10 02:06:18,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:06:18,555 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 79 transitions. [2019-09-10 02:06:18,555 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-10 02:06:18,555 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2019-09-10 02:06:18,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-10 02:06:18,556 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:06:18,556 INFO L399 BasicCegarLoop]: trace histogram [25, 13, 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-09-10 02:06:18,556 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:06:18,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:06:18,557 INFO L82 PathProgramCache]: Analyzing trace with hash -696240780, now seen corresponding path program 13 times [2019-09-10 02:06:18,557 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:06:18,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:18,558 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:06:18,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:18,558 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:06:18,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:06:18,819 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 322 proven. 182 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-09-10 02:06:18,820 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:18,820 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:06:18,820 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:06:18,820 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:06:18,820 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:18,820 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:06:18,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:06:18,831 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:06:18,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:06:18,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-10 02:06:18,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:06:18,867 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 322 proven. 182 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-09-10 02:06:18,867 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:06:19,456 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 322 proven. 182 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (14)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 02:06:19,460 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:06:19,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 48 [2019-09-10 02:06:19,460 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:06:19,460 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-10 02:06:19,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-10 02:06:19,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-09-10 02:06:19,461 INFO L87 Difference]: Start difference. First operand 78 states and 79 transitions. Second operand 25 states. [2019-09-10 02:06:19,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:06:19,609 INFO L93 Difference]: Finished difference Result 80 states and 81 transitions. [2019-09-10 02:06:19,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 02:06:19,610 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 77 [2019-09-10 02:06:19,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:06:19,611 INFO L225 Difference]: With dead ends: 80 [2019-09-10 02:06:19,611 INFO L226 Difference]: Without dead ends: 80 [2019-09-10 02:06:19,612 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-09-10 02:06:19,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-09-10 02:06:19,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-09-10 02:06:19,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-09-10 02:06:19,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 81 transitions. [2019-09-10 02:06:19,615 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 81 transitions. Word has length 77 [2019-09-10 02:06:19,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:06:19,615 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 81 transitions. [2019-09-10 02:06:19,615 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-10 02:06:19,615 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2019-09-10 02:06:19,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-10 02:06:19,616 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:06:19,616 INFO L399 BasicCegarLoop]: trace histogram [26, 14, 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-09-10 02:06:19,616 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:06:19,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:06:19,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1684179889, now seen corresponding path program 14 times [2019-09-10 02:06:19,617 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:06:19,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:19,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:06:19,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:19,618 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:06:19,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:06:19,941 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 345 proven. 210 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-09-10 02:06:19,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:19,941 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:06:19,942 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:06:19,942 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:06:19,942 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:19,942 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:06:19,952 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:06:19,953 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:06:19,986 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2019-09-10 02:06:19,986 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:06:19,987 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-10 02:06:19,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:06:20,269 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 350 proven. 144 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2019-09-10 02:06:20,269 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:06:20,659 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 350 proven. 144 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2019-09-10 02:06:20,662 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:06:20,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 15, 15] total 52 [2019-09-10 02:06:20,662 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:06:20,663 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-10 02:06:20,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-10 02:06:20,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:06:20,664 INFO L87 Difference]: Start difference. First operand 80 states and 81 transitions. Second operand 39 states. [2019-09-10 02:06:20,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:06:20,864 INFO L93 Difference]: Finished difference Result 85 states and 86 transitions. [2019-09-10 02:06:20,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-10 02:06:20,865 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 79 [2019-09-10 02:06:20,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:06:20,865 INFO L225 Difference]: With dead ends: 85 [2019-09-10 02:06:20,866 INFO L226 Difference]: Without dead ends: 85 [2019-09-10 02:06:20,867 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:06:20,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-09-10 02:06:20,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2019-09-10 02:06:20,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-09-10 02:06:20,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 85 transitions. [2019-09-10 02:06:20,869 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 85 transitions. Word has length 79 [2019-09-10 02:06:20,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:06:20,870 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 85 transitions. [2019-09-10 02:06:20,870 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-10 02:06:20,870 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 85 transitions. [2019-09-10 02:06:20,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 02:06:20,871 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:06:20,871 INFO L399 BasicCegarLoop]: trace histogram [28, 15, 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-09-10 02:06:20,871 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:06:20,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:06:20,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1637764232, now seen corresponding path program 15 times [2019-09-10 02:06:20,871 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:06:20,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:20,872 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:06:20,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:20,873 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:06:20,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:06:21,173 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 400 proven. 240 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-10 02:06:21,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:21,173 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:06:21,174 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:06:21,174 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:06:21,174 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:21,174 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:06:21,192 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:06:21,192 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:06:21,218 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:06:21,219 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:06:21,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-10 02:06:21,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:06:21,231 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 400 proven. 240 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-10 02:06:21,231 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:06:21,904 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 400 proven. 240 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-10 02:06:21,907 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:06:21,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 52 [2019-09-10 02:06:21,907 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:06:21,908 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-10 02:06:21,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-10 02:06:21,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:06:21,910 INFO L87 Difference]: Start difference. First operand 84 states and 85 transitions. Second operand 27 states. [2019-09-10 02:06:22,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:06:22,093 INFO L93 Difference]: Finished difference Result 86 states and 87 transitions. [2019-09-10 02:06:22,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-10 02:06:22,100 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 83 [2019-09-10 02:06:22,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:06:22,101 INFO L225 Difference]: With dead ends: 86 [2019-09-10 02:06:22,101 INFO L226 Difference]: Without dead ends: 86 [2019-09-10 02:06:22,103 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:06:22,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-09-10 02:06:22,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-09-10 02:06:22,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-09-10 02:06:22,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 87 transitions. [2019-09-10 02:06:22,106 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 87 transitions. Word has length 83 [2019-09-10 02:06:22,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:06:22,107 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 87 transitions. [2019-09-10 02:06:22,107 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-10 02:06:22,107 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 87 transitions. [2019-09-10 02:06:22,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 02:06:22,108 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:06:22,108 INFO L399 BasicCegarLoop]: trace histogram [29, 16, 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-09-10 02:06:22,108 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:06:22,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:06:22,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1891909893, now seen corresponding path program 16 times [2019-09-10 02:06:22,109 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:06:22,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:22,111 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:06:22,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:22,112 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:06:22,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:06:22,503 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 425 proven. 272 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-10 02:06:22,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:22,504 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:06:22,504 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:06:22,504 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:06:22,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:22,505 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 02:06:22,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:06:22,531 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:06:22,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:06:22,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-10 02:06:22,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:06:22,585 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 425 proven. 272 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-10 02:06:22,585 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:06:23,393 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 425 proven. 272 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-10 02:06:23,396 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:06:23,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 52 [2019-09-10 02:06:23,397 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:06:23,397 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-10 02:06:23,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-10 02:06:23,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:06:23,399 INFO L87 Difference]: Start difference. First operand 86 states and 87 transitions. Second operand 28 states. [2019-09-10 02:06:23,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:06:23,566 INFO L93 Difference]: Finished difference Result 88 states and 89 transitions. [2019-09-10 02:06:23,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-10 02:06:23,566 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 85 [2019-09-10 02:06:23,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:06:23,567 INFO L225 Difference]: With dead ends: 88 [2019-09-10 02:06:23,568 INFO L226 Difference]: Without dead ends: 88 [2019-09-10 02:06:23,569 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 145 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:06:23,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-09-10 02:06:23,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-09-10 02:06:23,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-09-10 02:06:23,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 89 transitions. [2019-09-10 02:06:23,572 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 89 transitions. Word has length 85 [2019-09-10 02:06:23,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:06:23,572 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 89 transitions. [2019-09-10 02:06:23,573 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-10 02:06:23,573 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 89 transitions. [2019-09-10 02:06:23,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 02:06:23,573 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:06:23,573 INFO L399 BasicCegarLoop]: trace histogram [30, 17, 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-09-10 02:06:23,574 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:06:23,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:06:23,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1312754242, now seen corresponding path program 17 times [2019-09-10 02:06:23,574 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:06:23,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:23,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:06:23,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:23,575 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:06:23,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:06:23,945 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 450 proven. 306 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-10 02:06:23,946 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:23,946 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:06:23,946 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:06:23,947 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:06:23,947 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:23,947 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 02:06:23,988 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:06:23,988 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:06:24,053 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2019-09-10 02:06:24,053 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:06:24,055 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-10 02:06:24,057 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:06:24,517 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 459 proven. 169 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2019-09-10 02:06:24,517 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:06:25,003 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 459 proven. 169 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2019-09-10 02:06:25,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:06:25,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 16, 16] total 57 [2019-09-10 02:06:25,006 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:06:25,006 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-10 02:06:25,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-10 02:06:25,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-09-10 02:06:25,009 INFO L87 Difference]: Start difference. First operand 88 states and 89 transitions. Second operand 43 states. [2019-09-10 02:06:25,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:06:25,246 INFO L93 Difference]: Finished difference Result 93 states and 94 transitions. [2019-09-10 02:06:25,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-10 02:06:25,247 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 87 [2019-09-10 02:06:25,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:06:25,248 INFO L225 Difference]: With dead ends: 93 [2019-09-10 02:06:25,248 INFO L226 Difference]: Without dead ends: 93 [2019-09-10 02:06:25,249 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-09-10 02:06:25,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-09-10 02:06:25,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2019-09-10 02:06:25,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-09-10 02:06:25,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 93 transitions. [2019-09-10 02:06:25,252 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 93 transitions. Word has length 87 [2019-09-10 02:06:25,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:06:25,253 INFO L475 AbstractCegarLoop]: Abstraction has 92 states and 93 transitions. [2019-09-10 02:06:25,253 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-10 02:06:25,253 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 93 transitions. [2019-09-10 02:06:25,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-10 02:06:25,253 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:06:25,254 INFO L399 BasicCegarLoop]: trace histogram [32, 18, 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-09-10 02:06:25,254 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:06:25,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:06:25,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1585208793, now seen corresponding path program 18 times [2019-09-10 02:06:25,254 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:06:25,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:25,255 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:06:25,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:25,255 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:06:25,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:06:25,755 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 513 proven. 342 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2019-09-10 02:06:25,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:25,755 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:06:25,755 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:06:25,756 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:06:25,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:25,756 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:06:25,782 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:06:25,782 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:06:25,828 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:06:25,829 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:06:25,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-10 02:06:25,833 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:06:25,854 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 513 proven. 342 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2019-09-10 02:06:25,855 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:06:26,801 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 513 proven. 342 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2019-09-10 02:06:26,804 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:06:26,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 52 [2019-09-10 02:06:26,804 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:06:26,805 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-10 02:06:26,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-10 02:06:26,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:06:26,806 INFO L87 Difference]: Start difference. First operand 92 states and 93 transitions. Second operand 30 states. [2019-09-10 02:06:26,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:06:26,963 INFO L93 Difference]: Finished difference Result 94 states and 95 transitions. [2019-09-10 02:06:26,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-10 02:06:26,964 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 91 [2019-09-10 02:06:26,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:06:26,965 INFO L225 Difference]: With dead ends: 94 [2019-09-10 02:06:26,965 INFO L226 Difference]: Without dead ends: 94 [2019-09-10 02:06:26,966 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 155 SyntacticMatches, 6 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:06:26,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-09-10 02:06:26,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2019-09-10 02:06:26,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-09-10 02:06:26,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 95 transitions. [2019-09-10 02:06:26,968 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 95 transitions. Word has length 91 [2019-09-10 02:06:26,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:06:26,969 INFO L475 AbstractCegarLoop]: Abstraction has 94 states and 95 transitions. [2019-09-10 02:06:26,969 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-10 02:06:26,969 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 95 transitions. [2019-09-10 02:06:26,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-10 02:06:26,969 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:06:26,969 INFO L399 BasicCegarLoop]: trace histogram [33, 19, 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-09-10 02:06:26,970 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:06:26,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:06:26,970 INFO L82 PathProgramCache]: Analyzing trace with hash 400065878, now seen corresponding path program 19 times [2019-09-10 02:06:26,970 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:06:26,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:26,971 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:06:26,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:26,971 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:06:26,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:06:27,348 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 540 proven. 380 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2019-09-10 02:06:27,348 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:27,348 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:06:27,348 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:06:27,348 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:06:27,348 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:27,348 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:06:27,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:06:27,361 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:06:27,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:06:27,389 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-10 02:06:27,391 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:06:27,404 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 540 proven. 380 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2019-09-10 02:06:27,404 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:06:28,260 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 540 proven. 380 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2019-09-10 02:06:28,263 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:06:28,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 52 [2019-09-10 02:06:28,264 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:06:28,264 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-10 02:06:28,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-10 02:06:28,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:06:28,265 INFO L87 Difference]: Start difference. First operand 94 states and 95 transitions. Second operand 31 states. [2019-09-10 02:06:28,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:06:28,419 INFO L93 Difference]: Finished difference Result 96 states and 97 transitions. [2019-09-10 02:06:28,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-10 02:06:28,420 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 93 [2019-09-10 02:06:28,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:06:28,421 INFO L225 Difference]: With dead ends: 96 [2019-09-10 02:06:28,421 INFO L226 Difference]: Without dead ends: 96 [2019-09-10 02:06:28,422 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 158 SyntacticMatches, 8 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:06:28,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-09-10 02:06:28,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-09-10 02:06:28,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-09-10 02:06:28,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 97 transitions. [2019-09-10 02:06:28,425 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 97 transitions. Word has length 93 [2019-09-10 02:06:28,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:06:28,425 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 97 transitions. [2019-09-10 02:06:28,426 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-10 02:06:28,426 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 97 transitions. [2019-09-10 02:06:28,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-10 02:06:28,426 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:06:28,426 INFO L399 BasicCegarLoop]: trace histogram [34, 20, 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-09-10 02:06:28,427 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:06:28,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:06:28,427 INFO L82 PathProgramCache]: Analyzing trace with hash -355941997, now seen corresponding path program 20 times [2019-09-10 02:06:28,427 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:06:28,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:28,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:06:28,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:28,428 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:06:28,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:06:28,849 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 567 proven. 420 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2019-09-10 02:06:28,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:28,849 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:06:28,850 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:06:28,850 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:06:28,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:28,850 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:06:28,862 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:06:28,862 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:06:28,904 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2019-09-10 02:06:28,904 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:06:28,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-10 02:06:28,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:06:29,319 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 580 proven. 196 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2019-09-10 02:06:29,320 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:06:29,926 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 580 proven. 196 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2019-09-10 02:06:29,929 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:06:29,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 17, 17] total 62 [2019-09-10 02:06:29,930 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:06:29,930 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-10 02:06:29,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-10 02:06:29,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-09-10 02:06:29,931 INFO L87 Difference]: Start difference. First operand 96 states and 97 transitions. Second operand 47 states. [2019-09-10 02:06:30,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:06:30,177 INFO L93 Difference]: Finished difference Result 101 states and 102 transitions. [2019-09-10 02:06:30,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-10 02:06:30,178 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 95 [2019-09-10 02:06:30,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:06:30,179 INFO L225 Difference]: With dead ends: 101 [2019-09-10 02:06:30,179 INFO L226 Difference]: Without dead ends: 101 [2019-09-10 02:06:30,180 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 161 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-09-10 02:06:30,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-09-10 02:06:30,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2019-09-10 02:06:30,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-09-10 02:06:30,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 101 transitions. [2019-09-10 02:06:30,184 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 101 transitions. Word has length 95 [2019-09-10 02:06:30,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:06:30,184 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 101 transitions. [2019-09-10 02:06:30,184 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-10 02:06:30,184 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2019-09-10 02:06:30,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 02:06:30,185 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:06:30,185 INFO L399 BasicCegarLoop]: trace histogram [36, 21, 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-09-10 02:06:30,186 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:06:30,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:06:30,186 INFO L82 PathProgramCache]: Analyzing trace with hash -2030471190, now seen corresponding path program 21 times [2019-09-10 02:06:30,186 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:06:30,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:30,187 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:06:30,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:30,187 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:06:30,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:06:30,687 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 638 proven. 462 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2019-09-10 02:06:30,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:30,687 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:06:30,687 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:06:30,688 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:06:30,688 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:30,688 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:06:30,699 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:06:30,699 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:06:30,732 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:06:30,733 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:06:30,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-10 02:06:30,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:06:30,751 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 638 proven. 462 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2019-09-10 02:06:30,752 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:06:31,526 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 638 proven. 462 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2019-09-10 02:06:31,529 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:06:31,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 52 [2019-09-10 02:06:31,529 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:06:31,530 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-10 02:06:31,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-10 02:06:31,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:06:31,531 INFO L87 Difference]: Start difference. First operand 100 states and 101 transitions. Second operand 33 states. [2019-09-10 02:06:31,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:06:31,717 INFO L93 Difference]: Finished difference Result 102 states and 103 transitions. [2019-09-10 02:06:31,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-10 02:06:31,717 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 99 [2019-09-10 02:06:31,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:06:31,718 INFO L225 Difference]: With dead ends: 102 [2019-09-10 02:06:31,718 INFO L226 Difference]: Without dead ends: 102 [2019-09-10 02:06:31,719 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 168 SyntacticMatches, 12 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:06:31,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-09-10 02:06:31,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-09-10 02:06:31,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-09-10 02:06:31,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 103 transitions. [2019-09-10 02:06:31,722 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 103 transitions. Word has length 99 [2019-09-10 02:06:31,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:06:31,723 INFO L475 AbstractCegarLoop]: Abstraction has 102 states and 103 transitions. [2019-09-10 02:06:31,723 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-10 02:06:31,723 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 103 transitions. [2019-09-10 02:06:31,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 02:06:31,723 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:06:31,724 INFO L399 BasicCegarLoop]: trace histogram [37, 22, 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-09-10 02:06:31,724 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:06:31,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:06:31,724 INFO L82 PathProgramCache]: Analyzing trace with hash -156708249, now seen corresponding path program 22 times [2019-09-10 02:06:31,724 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:06:31,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:31,725 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:06:31,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:31,725 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:06:31,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:06:32,327 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 667 proven. 506 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2019-09-10 02:06:32,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:32,327 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:06:32,328 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:06:32,328 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:06:32,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:32,328 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:06:32,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:06:32,343 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:06:32,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:06:32,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-10 02:06:32,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:06:32,397 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 667 proven. 506 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2019-09-10 02:06:32,398 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:06:33,220 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 667 proven. 506 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2019-09-10 02:06:33,223 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:06:33,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 52 [2019-09-10 02:06:33,223 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:06:33,224 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-10 02:06:33,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-10 02:06:33,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:06:33,225 INFO L87 Difference]: Start difference. First operand 102 states and 103 transitions. Second operand 34 states. [2019-09-10 02:06:33,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:06:33,383 INFO L93 Difference]: Finished difference Result 104 states and 105 transitions. [2019-09-10 02:06:33,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-10 02:06:33,384 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 101 [2019-09-10 02:06:33,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:06:33,385 INFO L225 Difference]: With dead ends: 104 [2019-09-10 02:06:33,385 INFO L226 Difference]: Without dead ends: 104 [2019-09-10 02:06:33,386 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 171 SyntacticMatches, 14 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:06:33,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-09-10 02:06:33,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-09-10 02:06:33,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-09-10 02:06:33,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 105 transitions. [2019-09-10 02:06:33,390 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 105 transitions. Word has length 101 [2019-09-10 02:06:33,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:06:33,390 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 105 transitions. [2019-09-10 02:06:33,391 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-10 02:06:33,391 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 105 transitions. [2019-09-10 02:06:33,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 02:06:33,391 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:06:33,391 INFO L399 BasicCegarLoop]: trace histogram [38, 23, 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-09-10 02:06:33,392 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:06:33,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:06:33,392 INFO L82 PathProgramCache]: Analyzing trace with hash 938181028, now seen corresponding path program 23 times [2019-09-10 02:06:33,392 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:06:33,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:33,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:06:33,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:33,393 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:06:33,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:06:33,843 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 696 proven. 552 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2019-09-10 02:06:33,843 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:33,843 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:06:33,844 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:06:33,844 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:06:33,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:33,844 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:06:33,854 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:06:33,854 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:06:33,904 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2019-09-10 02:06:33,905 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:06:33,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-10 02:06:33,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:06:34,354 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 713 proven. 225 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2019-09-10 02:06:34,354 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:06:35,028 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 713 proven. 225 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2019-09-10 02:06:35,032 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:06:35,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 18, 18] total 67 [2019-09-10 02:06:35,032 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:06:35,032 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-09-10 02:06:35,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-09-10 02:06:35,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-09-10 02:06:35,034 INFO L87 Difference]: Start difference. First operand 104 states and 105 transitions. Second operand 51 states. [2019-09-10 02:06:35,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:06:35,283 INFO L93 Difference]: Finished difference Result 109 states and 110 transitions. [2019-09-10 02:06:35,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-10 02:06:35,284 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 103 [2019-09-10 02:06:35,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:06:35,285 INFO L225 Difference]: With dead ends: 109 [2019-09-10 02:06:35,285 INFO L226 Difference]: Without dead ends: 109 [2019-09-10 02:06:35,286 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-09-10 02:06:35,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-09-10 02:06:35,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2019-09-10 02:06:35,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-09-10 02:06:35,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 109 transitions. [2019-09-10 02:06:35,290 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 109 transitions. Word has length 103 [2019-09-10 02:06:35,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:06:35,290 INFO L475 AbstractCegarLoop]: Abstraction has 108 states and 109 transitions. [2019-09-10 02:06:35,290 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-09-10 02:06:35,290 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 109 transitions. [2019-09-10 02:06:35,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-10 02:06:35,291 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:06:35,291 INFO L399 BasicCegarLoop]: trace histogram [40, 24, 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-09-10 02:06:35,291 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:06:35,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:06:35,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1615686331, now seen corresponding path program 24 times [2019-09-10 02:06:35,292 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:06:35,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:35,293 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:06:35,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:35,293 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:06:35,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:06:35,773 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 775 proven. 600 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2019-09-10 02:06:35,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:35,774 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:06:35,774 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:06:35,774 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:06:35,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:35,774 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:06:35,786 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:06:35,786 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:06:35,821 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:06:35,821 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:06:35,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-10 02:06:35,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:06:35,841 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 775 proven. 600 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2019-09-10 02:06:35,842 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:06:36,833 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 775 proven. 600 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2019-09-10 02:06:36,837 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:06:36,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 52 [2019-09-10 02:06:36,837 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:06:36,838 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-10 02:06:36,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-10 02:06:36,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:06:36,839 INFO L87 Difference]: Start difference. First operand 108 states and 109 transitions. Second operand 36 states. [2019-09-10 02:06:37,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:06:37,011 INFO L93 Difference]: Finished difference Result 110 states and 111 transitions. [2019-09-10 02:06:37,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-10 02:06:37,012 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 107 [2019-09-10 02:06:37,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:06:37,013 INFO L225 Difference]: With dead ends: 110 [2019-09-10 02:06:37,013 INFO L226 Difference]: Without dead ends: 110 [2019-09-10 02:06:37,014 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 181 SyntacticMatches, 18 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:06:37,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-09-10 02:06:37,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2019-09-10 02:06:37,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-09-10 02:06:37,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 111 transitions. [2019-09-10 02:06:37,018 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 111 transitions. Word has length 107 [2019-09-10 02:06:37,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:06:37,019 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 111 transitions. [2019-09-10 02:06:37,019 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-10 02:06:37,019 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 111 transitions. [2019-09-10 02:06:37,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-10 02:06:37,020 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:06:37,020 INFO L399 BasicCegarLoop]: trace histogram [41, 25, 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-09-10 02:06:37,020 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:06:37,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:06:37,021 INFO L82 PathProgramCache]: Analyzing trace with hash 627898424, now seen corresponding path program 25 times [2019-09-10 02:06:37,021 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:06:37,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:37,022 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:06:37,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:37,022 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:06:37,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:06:37,512 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 806 proven. 650 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2019-09-10 02:06:37,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:37,513 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:06:37,513 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:06:37,513 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:06:37,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:37,513 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:06:37,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:06:37,525 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:06:37,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:06:37,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-10 02:06:37,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:06:37,579 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 806 proven. 650 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2019-09-10 02:06:37,579 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:06:38,409 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 806 proven. 650 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (26)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 02:06:38,412 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:06:38,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 52 [2019-09-10 02:06:38,412 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:06:38,413 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-10 02:06:38,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-10 02:06:38,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:06:38,413 INFO L87 Difference]: Start difference. First operand 110 states and 111 transitions. Second operand 37 states. [2019-09-10 02:06:38,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:06:38,612 INFO L93 Difference]: Finished difference Result 112 states and 113 transitions. [2019-09-10 02:06:38,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-10 02:06:38,613 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 109 [2019-09-10 02:06:38,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:06:38,614 INFO L225 Difference]: With dead ends: 112 [2019-09-10 02:06:38,614 INFO L226 Difference]: Without dead ends: 112 [2019-09-10 02:06:38,615 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 184 SyntacticMatches, 20 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 490 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:06:38,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-09-10 02:06:38,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2019-09-10 02:06:38,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-09-10 02:06:38,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 113 transitions. [2019-09-10 02:06:38,619 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 113 transitions. Word has length 109 [2019-09-10 02:06:38,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:06:38,619 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 113 transitions. [2019-09-10 02:06:38,619 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-10 02:06:38,619 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 113 transitions. [2019-09-10 02:06:38,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-10 02:06:38,620 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:06:38,620 INFO L399 BasicCegarLoop]: trace histogram [42, 26, 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-09-10 02:06:38,620 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:06:38,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:06:38,621 INFO L82 PathProgramCache]: Analyzing trace with hash 551492213, now seen corresponding path program 26 times [2019-09-10 02:06:38,621 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:06:38,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:38,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:06:38,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:38,622 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:06:38,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:06:39,138 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 837 proven. 702 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2019-09-10 02:06:39,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:39,139 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:06:39,139 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:06:39,139 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:06:39,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:39,139 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:06:39,150 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:06:39,150 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:06:39,196 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2019-09-10 02:06:39,196 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:06:39,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-10 02:06:39,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:06:39,718 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 858 proven. 256 refuted. 0 times theorem prover too weak. 650 trivial. 0 not checked. [2019-09-10 02:06:39,718 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:06:40,460 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 858 proven. 256 refuted. 0 times theorem prover too weak. 650 trivial. 0 not checked. [2019-09-10 02:06:40,463 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:06:40,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 19, 19] total 72 [2019-09-10 02:06:40,463 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:06:40,464 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-09-10 02:06:40,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-09-10 02:06:40,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-09-10 02:06:40,465 INFO L87 Difference]: Start difference. First operand 112 states and 113 transitions. Second operand 55 states. [2019-09-10 02:06:40,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:06:40,731 INFO L93 Difference]: Finished difference Result 117 states and 118 transitions. [2019-09-10 02:06:40,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-09-10 02:06:40,731 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 111 [2019-09-10 02:06:40,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:06:40,733 INFO L225 Difference]: With dead ends: 117 [2019-09-10 02:06:40,733 INFO L226 Difference]: Without dead ends: 117 [2019-09-10 02:06:40,733 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-09-10 02:06:40,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-09-10 02:06:40,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 116. [2019-09-10 02:06:40,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-09-10 02:06:40,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 117 transitions. [2019-09-10 02:06:40,737 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 117 transitions. Word has length 111 [2019-09-10 02:06:40,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:06:40,737 INFO L475 AbstractCegarLoop]: Abstraction has 116 states and 117 transitions. [2019-09-10 02:06:40,737 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-09-10 02:06:40,737 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 117 transitions. [2019-09-10 02:06:40,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-10 02:06:40,738 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:06:40,738 INFO L399 BasicCegarLoop]: trace histogram [44, 27, 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-09-10 02:06:40,738 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:06:40,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:06:40,739 INFO L82 PathProgramCache]: Analyzing trace with hash 972817996, now seen corresponding path program 27 times [2019-09-10 02:06:40,739 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:06:40,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:40,739 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:06:40,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:40,740 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:06:40,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:06:41,326 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 924 proven. 756 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2019-09-10 02:06:41,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:41,326 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:06:41,326 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:06:41,327 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:06:41,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:41,327 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:06:41,338 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:06:41,338 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:06:41,373 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:06:41,374 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:06:41,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-10 02:06:41,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:06:41,391 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 924 proven. 756 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2019-09-10 02:06:41,391 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:06:42,230 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 924 proven. 756 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2019-09-10 02:06:42,233 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:06:42,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 52 [2019-09-10 02:06:42,233 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:06:42,234 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-10 02:06:42,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-10 02:06:42,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:06:42,234 INFO L87 Difference]: Start difference. First operand 116 states and 117 transitions. Second operand 39 states. [2019-09-10 02:06:42,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:06:42,445 INFO L93 Difference]: Finished difference Result 118 states and 119 transitions. [2019-09-10 02:06:42,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-10 02:06:42,446 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 115 [2019-09-10 02:06:42,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:06:42,447 INFO L225 Difference]: With dead ends: 118 [2019-09-10 02:06:42,447 INFO L226 Difference]: Without dead ends: 118 [2019-09-10 02:06:42,448 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 194 SyntacticMatches, 24 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 588 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:06:42,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-09-10 02:06:42,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2019-09-10 02:06:42,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-09-10 02:06:42,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 119 transitions. [2019-09-10 02:06:42,451 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 119 transitions. Word has length 115 [2019-09-10 02:06:42,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:06:42,451 INFO L475 AbstractCegarLoop]: Abstraction has 118 states and 119 transitions. [2019-09-10 02:06:42,451 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-10 02:06:42,451 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 119 transitions. [2019-09-10 02:06:42,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-10 02:06:42,452 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:06:42,452 INFO L399 BasicCegarLoop]: trace histogram [45, 28, 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-09-10 02:06:42,453 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:06:42,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:06:42,453 INFO L82 PathProgramCache]: Analyzing trace with hash -2035759415, now seen corresponding path program 28 times [2019-09-10 02:06:42,453 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:06:42,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:42,454 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:06:42,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:42,454 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:06:42,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:06:43,028 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 957 proven. 812 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2019-09-10 02:06:43,028 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:43,028 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:06:43,028 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:06:43,029 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:06:43,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:43,029 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:06:43,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:06:43,043 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:06:43,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:06:43,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-10 02:06:43,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:06:43,107 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 957 proven. 812 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2019-09-10 02:06:43,107 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:06:43,907 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 957 proven. 812 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2019-09-10 02:06:43,910 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:06:43,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 52 [2019-09-10 02:06:43,910 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:06:43,911 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-09-10 02:06:43,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-09-10 02:06:43,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:06:43,912 INFO L87 Difference]: Start difference. First operand 118 states and 119 transitions. Second operand 40 states. [2019-09-10 02:06:44,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:06:44,168 INFO L93 Difference]: Finished difference Result 120 states and 121 transitions. [2019-09-10 02:06:44,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-10 02:06:44,169 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 117 [2019-09-10 02:06:44,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:06:44,170 INFO L225 Difference]: With dead ends: 120 [2019-09-10 02:06:44,171 INFO L226 Difference]: Without dead ends: 120 [2019-09-10 02:06:44,171 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 197 SyntacticMatches, 26 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 637 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:06:44,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-09-10 02:06:44,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2019-09-10 02:06:44,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-09-10 02:06:44,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 121 transitions. [2019-09-10 02:06:44,177 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 121 transitions. Word has length 117 [2019-09-10 02:06:44,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:06:44,177 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 121 transitions. [2019-09-10 02:06:44,178 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-09-10 02:06:44,178 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 121 transitions. [2019-09-10 02:06:44,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-10 02:06:44,179 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:06:44,179 INFO L399 BasicCegarLoop]: trace histogram [46, 29, 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-09-10 02:06:44,180 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:06:44,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:06:44,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1529306118, now seen corresponding path program 29 times [2019-09-10 02:06:44,180 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:06:44,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:44,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:06:44,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:44,184 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:06:44,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:06:45,324 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 990 proven. 870 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2019-09-10 02:06:45,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:45,325 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:06:45,325 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:06:45,326 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:06:45,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:45,326 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) [2019-09-10 02:06:45,345 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:06:45,346 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:06:45,443 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2019-09-10 02:06:45,443 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:06:45,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-10 02:06:45,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:06:46,151 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 1015 proven. 289 refuted. 0 times theorem prover too weak. 812 trivial. 0 not checked. [2019-09-10 02:06:46,152 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:06:46,975 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 1015 proven. 289 refuted. 0 times theorem prover too weak. 812 trivial. 0 not checked. [2019-09-10 02:06:46,978 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:06:46,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 20, 20] total 77 [2019-09-10 02:06:46,979 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:06:46,980 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-09-10 02:06:46,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-09-10 02:06:46,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-09-10 02:06:46,981 INFO L87 Difference]: Start difference. First operand 120 states and 121 transitions. Second operand 59 states. [2019-09-10 02:06:47,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:06:47,261 INFO L93 Difference]: Finished difference Result 125 states and 126 transitions. [2019-09-10 02:06:47,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-09-10 02:06:47,262 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 119 [2019-09-10 02:06:47,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:06:47,263 INFO L225 Difference]: With dead ends: 125 [2019-09-10 02:06:47,263 INFO L226 Difference]: Without dead ends: 125 [2019-09-10 02:06:47,264 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-09-10 02:06:47,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-09-10 02:06:47,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2019-09-10 02:06:47,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-09-10 02:06:47,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 125 transitions. [2019-09-10 02:06:47,267 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 125 transitions. Word has length 119 [2019-09-10 02:06:47,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:06:47,268 INFO L475 AbstractCegarLoop]: Abstraction has 124 states and 125 transitions. [2019-09-10 02:06:47,268 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-09-10 02:06:47,268 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 125 transitions. [2019-09-10 02:06:47,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-10 02:06:47,269 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:06:47,269 INFO L399 BasicCegarLoop]: trace histogram [48, 30, 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-09-10 02:06:47,269 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:06:47,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:06:47,269 INFO L82 PathProgramCache]: Analyzing trace with hash -892003683, now seen corresponding path program 30 times [2019-09-10 02:06:47,269 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:06:47,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:47,270 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:06:47,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:47,270 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:06:47,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:06:47,903 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 1085 proven. 930 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2019-09-10 02:06:47,904 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:47,904 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:06:47,904 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:06:47,904 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:06:47,904 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:47,904 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:06:47,913 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:06:47,914 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:06:47,959 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:06:47,960 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:06:47,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-10 02:06:47,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:06:47,981 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 1085 proven. 930 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2019-09-10 02:06:47,981 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:06:49,025 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 1085 proven. 930 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (31)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 02:06:49,037 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:06:49,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 52 [2019-09-10 02:06:49,038 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:06:49,038 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-09-10 02:06:49,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-09-10 02:06:49,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:06:49,039 INFO L87 Difference]: Start difference. First operand 124 states and 125 transitions. Second operand 42 states. [2019-09-10 02:06:49,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:06:49,226 INFO L93 Difference]: Finished difference Result 126 states and 127 transitions. [2019-09-10 02:06:49,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-10 02:06:49,227 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 123 [2019-09-10 02:06:49,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:06:49,228 INFO L225 Difference]: With dead ends: 126 [2019-09-10 02:06:49,228 INFO L226 Difference]: Without dead ends: 126 [2019-09-10 02:06:49,232 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 207 SyntacticMatches, 30 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 735 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:06:49,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-09-10 02:06:49,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2019-09-10 02:06:49,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-09-10 02:06:49,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 127 transitions. [2019-09-10 02:06:49,235 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 127 transitions. Word has length 123 [2019-09-10 02:06:49,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:06:49,235 INFO L475 AbstractCegarLoop]: Abstraction has 126 states and 127 transitions. [2019-09-10 02:06:49,236 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-09-10 02:06:49,236 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 127 transitions. [2019-09-10 02:06:49,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-10 02:06:49,236 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:06:49,237 INFO L399 BasicCegarLoop]: trace histogram [49, 31, 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-09-10 02:06:49,237 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:06:49,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:06:49,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1680608794, now seen corresponding path program 31 times [2019-09-10 02:06:49,237 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:06:49,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:49,238 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:06:49,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:49,238 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:06:49,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:06:49,991 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 1120 proven. 992 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2019-09-10 02:06:49,992 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:49,992 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:06:49,992 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:06:49,992 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:06:49,992 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:49,992 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:06:50,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:06:50,002 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:06:50,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:06:50,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-10 02:06:50,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:06:50,062 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 1120 proven. 992 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2019-09-10 02:06:50,062 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:06:50,914 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 1120 proven. 992 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (32)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 02:06:50,919 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:06:50,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 52 [2019-09-10 02:06:50,920 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:06:50,920 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-10 02:06:50,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-10 02:06:50,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:06:50,921 INFO L87 Difference]: Start difference. First operand 126 states and 127 transitions. Second operand 43 states. [2019-09-10 02:06:51,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:06:51,128 INFO L93 Difference]: Finished difference Result 128 states and 129 transitions. [2019-09-10 02:06:51,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-10 02:06:51,128 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 125 [2019-09-10 02:06:51,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:06:51,129 INFO L225 Difference]: With dead ends: 128 [2019-09-10 02:06:51,129 INFO L226 Difference]: Without dead ends: 128 [2019-09-10 02:06:51,130 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 210 SyntacticMatches, 32 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 784 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:06:51,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-09-10 02:06:51,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2019-09-10 02:06:51,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-09-10 02:06:51,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 129 transitions. [2019-09-10 02:06:51,132 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 129 transitions. Word has length 125 [2019-09-10 02:06:51,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:06:51,133 INFO L475 AbstractCegarLoop]: Abstraction has 128 states and 129 transitions. [2019-09-10 02:06:51,133 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-10 02:06:51,133 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 129 transitions. [2019-09-10 02:06:51,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-10 02:06:51,134 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:06:51,134 INFO L399 BasicCegarLoop]: trace histogram [50, 32, 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-09-10 02:06:51,134 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:06:51,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:06:51,135 INFO L82 PathProgramCache]: Analyzing trace with hash 60036695, now seen corresponding path program 32 times [2019-09-10 02:06:51,135 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:06:51,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:51,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:06:51,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:51,138 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:06:51,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:06:52,122 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 1155 proven. 1056 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2019-09-10 02:06:52,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:52,122 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:06:52,122 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:06:52,122 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:06:52,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:52,122 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:06:52,132 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:06:52,133 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:06:52,184 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2019-09-10 02:06:52,184 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:06:52,185 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-10 02:06:52,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:06:52,868 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 1184 proven. 324 refuted. 0 times theorem prover too weak. 992 trivial. 0 not checked. [2019-09-10 02:06:52,868 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:06:53,784 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 1184 proven. 324 refuted. 0 times theorem prover too weak. 992 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (33)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 02:06:53,799 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:06:53,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 21, 21] total 82 [2019-09-10 02:06:53,799 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:06:53,800 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-09-10 02:06:53,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-09-10 02:06:53,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-09-10 02:06:53,802 INFO L87 Difference]: Start difference. First operand 128 states and 129 transitions. Second operand 63 states. [2019-09-10 02:06:54,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:06:54,094 INFO L93 Difference]: Finished difference Result 133 states and 134 transitions. [2019-09-10 02:06:54,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-09-10 02:06:54,094 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 127 [2019-09-10 02:06:54,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:06:54,096 INFO L225 Difference]: With dead ends: 133 [2019-09-10 02:06:54,096 INFO L226 Difference]: Without dead ends: 133 [2019-09-10 02:06:54,097 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-09-10 02:06:54,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-09-10 02:06:54,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 132. [2019-09-10 02:06:54,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-09-10 02:06:54,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 133 transitions. [2019-09-10 02:06:54,100 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 133 transitions. Word has length 127 [2019-09-10 02:06:54,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:06:54,101 INFO L475 AbstractCegarLoop]: Abstraction has 132 states and 133 transitions. [2019-09-10 02:06:54,101 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-09-10 02:06:54,101 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 133 transitions. [2019-09-10 02:06:54,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-10 02:06:54,102 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:06:54,102 INFO L399 BasicCegarLoop]: trace histogram [52, 33, 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-09-10 02:06:54,102 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:06:54,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:06:54,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1913358418, now seen corresponding path program 33 times [2019-09-10 02:06:54,103 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:06:54,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:54,103 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:06:54,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:54,104 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:06:54,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:06:55,022 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 1258 proven. 1122 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2019-09-10 02:06:55,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:55,023 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:06:55,023 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:06:55,023 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:06:55,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:55,024 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 02:06:55,046 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:06:55,046 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:06:55,090 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:06:55,090 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:06:55,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-10 02:06:55,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:06:55,116 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 1258 proven. 1122 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2019-09-10 02:06:55,117 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:06:56,019 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 1258 proven. 1122 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2019-09-10 02:06:56,022 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:06:56,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 52 [2019-09-10 02:06:56,023 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:06:56,023 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-09-10 02:06:56,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-09-10 02:06:56,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:06:56,024 INFO L87 Difference]: Start difference. First operand 132 states and 133 transitions. Second operand 45 states. [2019-09-10 02:06:56,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:06:56,221 INFO L93 Difference]: Finished difference Result 134 states and 135 transitions. [2019-09-10 02:06:56,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-10 02:06:56,226 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 131 [2019-09-10 02:06:56,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:06:56,226 INFO L225 Difference]: With dead ends: 134 [2019-09-10 02:06:56,227 INFO L226 Difference]: Without dead ends: 134 [2019-09-10 02:06:56,227 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 220 SyntacticMatches, 36 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 882 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:06:56,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-09-10 02:06:56,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2019-09-10 02:06:56,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-09-10 02:06:56,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 135 transitions. [2019-09-10 02:06:56,230 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 135 transitions. Word has length 131 [2019-09-10 02:06:56,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:06:56,230 INFO L475 AbstractCegarLoop]: Abstraction has 134 states and 135 transitions. [2019-09-10 02:06:56,231 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-09-10 02:06:56,231 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 135 transitions. [2019-09-10 02:06:56,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-10 02:06:56,231 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:06:56,232 INFO L399 BasicCegarLoop]: trace histogram [53, 34, 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-09-10 02:06:56,232 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:06:56,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:06:56,232 INFO L82 PathProgramCache]: Analyzing trace with hash -871195093, now seen corresponding path program 34 times [2019-09-10 02:06:56,232 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:06:56,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:56,233 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:06:56,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:56,233 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:06:56,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:06:56,963 INFO L134 CoverageAnalysis]: Checked inductivity of 2809 backedges. 1295 proven. 1190 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2019-09-10 02:06:56,963 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:56,963 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:06:56,963 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:06:56,963 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:06:56,963 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:56,964 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:06:56,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:06:56,975 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:06:57,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:06:57,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 45 conjunts are in the unsatisfiable core [2019-09-10 02:06:57,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:06:57,034 INFO L134 CoverageAnalysis]: Checked inductivity of 2809 backedges. 1295 proven. 1190 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2019-09-10 02:06:57,034 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:06:57,894 INFO L134 CoverageAnalysis]: Checked inductivity of 2809 backedges. 1295 proven. 1190 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2019-09-10 02:06:57,897 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:06:57,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 52 [2019-09-10 02:06:57,897 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:06:57,900 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-09-10 02:06:57,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-09-10 02:06:57,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:06:57,901 INFO L87 Difference]: Start difference. First operand 134 states and 135 transitions. Second operand 46 states. [2019-09-10 02:06:58,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:06:58,142 INFO L93 Difference]: Finished difference Result 136 states and 137 transitions. [2019-09-10 02:06:58,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-09-10 02:06:58,143 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 133 [2019-09-10 02:06:58,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:06:58,143 INFO L225 Difference]: With dead ends: 136 [2019-09-10 02:06:58,144 INFO L226 Difference]: Without dead ends: 136 [2019-09-10 02:06:58,144 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 223 SyntacticMatches, 38 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 931 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:06:58,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-09-10 02:06:58,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2019-09-10 02:06:58,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-09-10 02:06:58,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 137 transitions. [2019-09-10 02:06:58,146 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 137 transitions. Word has length 133 [2019-09-10 02:06:58,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:06:58,146 INFO L475 AbstractCegarLoop]: Abstraction has 136 states and 137 transitions. [2019-09-10 02:06:58,146 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-09-10 02:06:58,147 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 137 transitions. [2019-09-10 02:06:58,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-10 02:06:58,147 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:06:58,147 INFO L399 BasicCegarLoop]: trace histogram [54, 35, 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-09-10 02:06:58,147 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:06:58,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:06:58,148 INFO L82 PathProgramCache]: Analyzing trace with hash -79619736, now seen corresponding path program 35 times [2019-09-10 02:06:58,148 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:06:58,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:58,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:06:58,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:06:58,149 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:06:58,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:06:58,944 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 1332 proven. 1260 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2019-09-10 02:06:58,944 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:58,944 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:06:58,945 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:06:58,945 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:06:58,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:06:58,945 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:06:58,955 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:06:58,955 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:06:59,006 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2019-09-10 02:06:59,006 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:06:59,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-10 02:06:59,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:06:59,798 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 1365 proven. 361 refuted. 0 times theorem prover too weak. 1190 trivial. 0 not checked. [2019-09-10 02:06:59,798 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:07:00,833 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 1365 proven. 361 refuted. 0 times theorem prover too weak. 1190 trivial. 0 not checked. [2019-09-10 02:07:00,836 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:07:00,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 22, 22] total 87 [2019-09-10 02:07:00,836 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:07:00,837 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-09-10 02:07:00,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-09-10 02:07:00,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-09-10 02:07:00,837 INFO L87 Difference]: Start difference. First operand 136 states and 137 transitions. Second operand 67 states. [2019-09-10 02:07:01,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:07:01,185 INFO L93 Difference]: Finished difference Result 141 states and 142 transitions. [2019-09-10 02:07:01,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-09-10 02:07:01,185 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 135 [2019-09-10 02:07:01,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:07:01,186 INFO L225 Difference]: With dead ends: 141 [2019-09-10 02:07:01,186 INFO L226 Difference]: Without dead ends: 141 [2019-09-10 02:07:01,187 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-09-10 02:07:01,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-09-10 02:07:01,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 140. [2019-09-10 02:07:01,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-09-10 02:07:01,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 141 transitions. [2019-09-10 02:07:01,190 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 141 transitions. Word has length 135 [2019-09-10 02:07:01,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:07:01,190 INFO L475 AbstractCegarLoop]: Abstraction has 140 states and 141 transitions. [2019-09-10 02:07:01,190 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-09-10 02:07:01,190 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 141 transitions. [2019-09-10 02:07:01,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-10 02:07:01,191 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:07:01,191 INFO L399 BasicCegarLoop]: trace histogram [56, 36, 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-09-10 02:07:01,192 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:07:01,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:07:01,193 INFO L82 PathProgramCache]: Analyzing trace with hash -540938881, now seen corresponding path program 36 times [2019-09-10 02:07:01,193 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:07:01,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:01,195 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:07:01,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:01,195 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:07:01,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:02,054 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 1443 proven. 1332 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2019-09-10 02:07:02,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:02,055 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:07:02,055 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:07:02,055 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:07:02,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:02,055 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:07:02,065 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:07:02,065 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:07:02,107 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:07:02,107 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:07:02,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 47 conjunts are in the unsatisfiable core [2019-09-10 02:07:02,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:07:02,133 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 1443 proven. 1332 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2019-09-10 02:07:02,134 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:07:03,036 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 1443 proven. 1332 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2019-09-10 02:07:03,040 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:07:03,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 52 [2019-09-10 02:07:03,040 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:07:03,041 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-09-10 02:07:03,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-09-10 02:07:03,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:07:03,041 INFO L87 Difference]: Start difference. First operand 140 states and 141 transitions. Second operand 48 states. [2019-09-10 02:07:03,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:07:03,273 INFO L93 Difference]: Finished difference Result 142 states and 143 transitions. [2019-09-10 02:07:03,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-09-10 02:07:03,274 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 139 [2019-09-10 02:07:03,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:07:03,275 INFO L225 Difference]: With dead ends: 142 [2019-09-10 02:07:03,275 INFO L226 Difference]: Without dead ends: 142 [2019-09-10 02:07:03,276 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 233 SyntacticMatches, 42 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1029 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:07:03,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-09-10 02:07:03,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2019-09-10 02:07:03,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-09-10 02:07:03,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 143 transitions. [2019-09-10 02:07:03,283 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 143 transitions. Word has length 139 [2019-09-10 02:07:03,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:07:03,283 INFO L475 AbstractCegarLoop]: Abstraction has 142 states and 143 transitions. [2019-09-10 02:07:03,283 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-09-10 02:07:03,283 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 143 transitions. [2019-09-10 02:07:03,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-10 02:07:03,284 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:07:03,284 INFO L399 BasicCegarLoop]: trace histogram [57, 37, 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-09-10 02:07:03,285 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:07:03,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:07:03,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1379645700, now seen corresponding path program 37 times [2019-09-10 02:07:03,287 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:07:03,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:03,288 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:07:03,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:03,288 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:07:03,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:04,243 INFO L134 CoverageAnalysis]: Checked inductivity of 3249 backedges. 1482 proven. 1406 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2019-09-10 02:07:04,244 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:04,244 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:07:04,244 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:07:04,244 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:07:04,244 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:04,244 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:07:04,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:07:04,255 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:07:04,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:04,299 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 48 conjunts are in the unsatisfiable core [2019-09-10 02:07:04,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:07:04,324 INFO L134 CoverageAnalysis]: Checked inductivity of 3249 backedges. 1482 proven. 1406 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2019-09-10 02:07:04,324 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:07:05,464 INFO L134 CoverageAnalysis]: Checked inductivity of 3249 backedges. 1482 proven. 1406 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2019-09-10 02:07:05,468 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:07:05,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 52 [2019-09-10 02:07:05,468 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:07:05,469 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-10 02:07:05,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-10 02:07:05,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:07:05,470 INFO L87 Difference]: Start difference. First operand 142 states and 143 transitions. Second operand 49 states. [2019-09-10 02:07:05,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:07:05,719 INFO L93 Difference]: Finished difference Result 144 states and 145 transitions. [2019-09-10 02:07:05,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-10 02:07:05,719 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 141 [2019-09-10 02:07:05,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:07:05,720 INFO L225 Difference]: With dead ends: 144 [2019-09-10 02:07:05,720 INFO L226 Difference]: Without dead ends: 144 [2019-09-10 02:07:05,721 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 236 SyntacticMatches, 44 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1078 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:07:05,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-09-10 02:07:05,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2019-09-10 02:07:05,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-09-10 02:07:05,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 145 transitions. [2019-09-10 02:07:05,725 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 145 transitions. Word has length 141 [2019-09-10 02:07:05,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:07:05,725 INFO L475 AbstractCegarLoop]: Abstraction has 144 states and 145 transitions. [2019-09-10 02:07:05,725 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-10 02:07:05,725 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 145 transitions. [2019-09-10 02:07:05,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-10 02:07:05,726 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:07:05,726 INFO L399 BasicCegarLoop]: trace histogram [58, 38, 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-09-10 02:07:05,727 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:07:05,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:07:05,727 INFO L82 PathProgramCache]: Analyzing trace with hash 76952889, now seen corresponding path program 38 times [2019-09-10 02:07:05,727 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:07:05,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:05,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:07:05,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:05,728 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:07:05,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:06,613 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 1521 proven. 1482 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2019-09-10 02:07:06,613 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:06,613 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:07:06,614 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:07:06,614 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:07:06,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:06,614 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:07:06,623 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:07:06,624 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:07:06,678 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 42 check-sat command(s) [2019-09-10 02:07:06,679 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:07:06,680 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-10 02:07:06,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:07:07,496 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 1558 proven. 400 refuted. 0 times theorem prover too weak. 1406 trivial. 0 not checked. [2019-09-10 02:07:07,496 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:07:08,632 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 1558 proven. 400 refuted. 0 times theorem prover too weak. 1406 trivial. 0 not checked. [2019-09-10 02:07:08,636 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:07:08,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 23, 23] total 92 [2019-09-10 02:07:08,636 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:07:08,637 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-09-10 02:07:08,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-09-10 02:07:08,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-09-10 02:07:08,638 INFO L87 Difference]: Start difference. First operand 144 states and 145 transitions. Second operand 71 states. [2019-09-10 02:07:08,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:07:08,968 INFO L93 Difference]: Finished difference Result 149 states and 150 transitions. [2019-09-10 02:07:08,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-09-10 02:07:08,969 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 143 [2019-09-10 02:07:08,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:07:08,970 INFO L225 Difference]: With dead ends: 149 [2019-09-10 02:07:08,970 INFO L226 Difference]: Without dead ends: 149 [2019-09-10 02:07:08,971 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-09-10 02:07:08,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-09-10 02:07:08,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 148. [2019-09-10 02:07:08,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-09-10 02:07:08,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 149 transitions. [2019-09-10 02:07:08,975 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 149 transitions. Word has length 143 [2019-09-10 02:07:08,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:07:08,975 INFO L475 AbstractCegarLoop]: Abstraction has 148 states and 149 transitions. [2019-09-10 02:07:08,975 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-09-10 02:07:08,975 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 149 transitions. [2019-09-10 02:07:08,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-10 02:07:08,976 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:07:08,976 INFO L399 BasicCegarLoop]: trace histogram [60, 39, 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-09-10 02:07:08,977 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:07:08,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:07:08,977 INFO L82 PathProgramCache]: Analyzing trace with hash -621720560, now seen corresponding path program 39 times [2019-09-10 02:07:08,977 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:07:08,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:08,978 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:07:08,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:08,978 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:07:08,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:09,931 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 1640 proven. 1560 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2019-09-10 02:07:09,931 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:09,931 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:07:09,931 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:07:09,932 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:07:09,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:09,932 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-09-10 02:07:09,942 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:07:09,942 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:07:09,990 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:07:09,990 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:07:09,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 50 conjunts are in the unsatisfiable core [2019-09-10 02:07:09,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:07:10,018 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 1640 proven. 1560 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2019-09-10 02:07:10,018 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:07:10,881 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 1640 proven. 1560 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2019-09-10 02:07:10,884 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:07:10,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 52 [2019-09-10 02:07:10,884 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:07:10,885 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-09-10 02:07:10,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-09-10 02:07:10,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:07:10,885 INFO L87 Difference]: Start difference. First operand 148 states and 149 transitions. Second operand 51 states. [2019-09-10 02:07:11,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:07:11,142 INFO L93 Difference]: Finished difference Result 150 states and 151 transitions. [2019-09-10 02:07:11,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-10 02:07:11,142 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 147 [2019-09-10 02:07:11,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:07:11,144 INFO L225 Difference]: With dead ends: 150 [2019-09-10 02:07:11,144 INFO L226 Difference]: Without dead ends: 150 [2019-09-10 02:07:11,144 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 246 SyntacticMatches, 48 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1176 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:07:11,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-09-10 02:07:11,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2019-09-10 02:07:11,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-09-10 02:07:11,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 151 transitions. [2019-09-10 02:07:11,147 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 151 transitions. Word has length 147 [2019-09-10 02:07:11,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:07:11,148 INFO L475 AbstractCegarLoop]: Abstraction has 150 states and 151 transitions. [2019-09-10 02:07:11,148 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-09-10 02:07:11,148 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 151 transitions. [2019-09-10 02:07:11,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-09-10 02:07:11,149 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:07:11,149 INFO L399 BasicCegarLoop]: trace histogram [61, 40, 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-09-10 02:07:11,149 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:07:11,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:07:11,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1225467763, now seen corresponding path program 40 times [2019-09-10 02:07:11,149 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:07:11,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:11,150 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:07:11,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:11,150 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:07:11,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:12,117 INFO L134 CoverageAnalysis]: Checked inductivity of 3721 backedges. 1681 proven. 1640 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2019-09-10 02:07:12,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:12,117 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:07:12,117 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:07:12,117 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:07:12,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:12,118 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:07:12,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:07:12,128 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:07:12,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:12,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 51 conjunts are in the unsatisfiable core [2019-09-10 02:07:12,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:07:12,204 INFO L134 CoverageAnalysis]: Checked inductivity of 3721 backedges. 1681 proven. 1640 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2019-09-10 02:07:12,204 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:07:13,094 INFO L134 CoverageAnalysis]: Checked inductivity of 3721 backedges. 1681 proven. 1640 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2019-09-10 02:07:13,097 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:07:13,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 52 [2019-09-10 02:07:13,098 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:07:13,098 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-09-10 02:07:13,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-09-10 02:07:13,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:07:13,099 INFO L87 Difference]: Start difference. First operand 150 states and 151 transitions. Second operand 52 states. [2019-09-10 02:07:13,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:07:13,337 INFO L93 Difference]: Finished difference Result 152 states and 153 transitions. [2019-09-10 02:07:13,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-10 02:07:13,338 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 149 [2019-09-10 02:07:13,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:07:13,339 INFO L225 Difference]: With dead ends: 152 [2019-09-10 02:07:13,339 INFO L226 Difference]: Without dead ends: 152 [2019-09-10 02:07:13,339 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 249 SyntacticMatches, 50 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1225 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:07:13,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-09-10 02:07:13,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2019-09-10 02:07:13,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-09-10 02:07:13,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 153 transitions. [2019-09-10 02:07:13,342 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 153 transitions. Word has length 149 [2019-09-10 02:07:13,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:07:13,343 INFO L475 AbstractCegarLoop]: Abstraction has 152 states and 153 transitions. [2019-09-10 02:07:13,343 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-09-10 02:07:13,343 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 153 transitions. [2019-09-10 02:07:13,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-10 02:07:13,344 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:07:13,344 INFO L399 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-09-10 02:07:13,344 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:07:13,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:07:13,345 INFO L82 PathProgramCache]: Analyzing trace with hash -1605944886, now seen corresponding path program 41 times [2019-09-10 02:07:13,345 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:07:13,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:13,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:07:13,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:13,347 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:07:13,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:15,571 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 0 proven. 3844 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:07:15,571 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:15,571 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:07:15,571 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:07:15,571 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:07:15,571 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:15,572 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:07:15,581 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:07:15,581 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:07:15,671 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 44 check-sat command(s) [2019-09-10 02:07:15,671 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:07:15,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-10 02:07:15,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:07:15,694 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 1763 proven. 441 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2019-09-10 02:07:15,694 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:07:16,958 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 1763 proven. 441 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2019-09-10 02:07:16,961 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:07:16,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 24, 24] total 96 [2019-09-10 02:07:16,961 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:07:16,962 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-09-10 02:07:16,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-09-10 02:07:16,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-09-10 02:07:16,963 INFO L87 Difference]: Start difference. First operand 152 states and 153 transitions. Second operand 74 states. [2019-09-10 02:07:17,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:07:17,417 INFO L93 Difference]: Finished difference Result 155 states and 156 transitions. [2019-09-10 02:07:17,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-09-10 02:07:17,418 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 151 [2019-09-10 02:07:17,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:07:17,419 INFO L225 Difference]: With dead ends: 155 [2019-09-10 02:07:17,419 INFO L226 Difference]: Without dead ends: 155 [2019-09-10 02:07:17,420 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 281 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-09-10 02:07:17,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-09-10 02:07:17,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 154. [2019-09-10 02:07:17,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-09-10 02:07:17,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 155 transitions. [2019-09-10 02:07:17,424 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 155 transitions. Word has length 151 [2019-09-10 02:07:17,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:07:17,424 INFO L475 AbstractCegarLoop]: Abstraction has 154 states and 155 transitions. [2019-09-10 02:07:17,424 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-09-10 02:07:17,424 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 155 transitions. [2019-09-10 02:07:17,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-10 02:07:17,425 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:07:17,425 INFO L399 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-09-10 02:07:17,425 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:07:17,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:07:17,426 INFO L82 PathProgramCache]: Analyzing trace with hash -1427314524, now seen corresponding path program 42 times [2019-09-10 02:07:17,426 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:07:17,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:17,427 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:07:17,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:17,427 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:07:17,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:19,303 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 0 proven. 3969 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:07:19,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:19,304 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:07:19,304 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:07:19,304 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:07:19,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:19,304 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:07:19,314 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:07:19,315 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:07:19,360 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:07:19,361 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:07:19,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 74 conjunts are in the unsatisfiable core [2019-09-10 02:07:19,364 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:07:19,398 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 0 proven. 3969 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:07:19,398 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:07:22,607 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 0 proven. 3969 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:07:22,610 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:07:22,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 102 [2019-09-10 02:07:22,611 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:07:22,611 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-09-10 02:07:22,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-09-10 02:07:22,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:07:22,612 INFO L87 Difference]: Start difference. First operand 154 states and 155 transitions. Second operand 75 states. [2019-09-10 02:07:22,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:07:22,974 INFO L93 Difference]: Finished difference Result 157 states and 158 transitions. [2019-09-10 02:07:22,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-09-10 02:07:22,975 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 153 [2019-09-10 02:07:22,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:07:22,976 INFO L225 Difference]: With dead ends: 157 [2019-09-10 02:07:22,976 INFO L226 Difference]: Without dead ends: 157 [2019-09-10 02:07:22,977 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 234 SyntacticMatches, 46 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2277 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:07:22,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-09-10 02:07:22,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 156. [2019-09-10 02:07:22,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-09-10 02:07:22,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 157 transitions. [2019-09-10 02:07:22,980 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 157 transitions. Word has length 153 [2019-09-10 02:07:22,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:07:22,980 INFO L475 AbstractCegarLoop]: Abstraction has 156 states and 157 transitions. [2019-09-10 02:07:22,980 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-09-10 02:07:22,980 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 157 transitions. [2019-09-10 02:07:22,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-10 02:07:22,981 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:07:22,981 INFO L399 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-09-10 02:07:22,982 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:07:22,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:07:22,982 INFO L82 PathProgramCache]: Analyzing trace with hash -1562228482, now seen corresponding path program 43 times [2019-09-10 02:07:22,982 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:07:22,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:22,983 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:07:22,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:22,983 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:07:23,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:24,987 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 0 proven. 4096 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:07:24,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:24,988 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:07:24,988 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:07:24,988 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:07:24,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:24,988 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:07:24,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:07:24,999 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:07:25,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:25,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 75 conjunts are in the unsatisfiable core [2019-09-10 02:07:25,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:07:25,085 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 0 proven. 4096 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:07:25,085 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:07:28,384 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 0 proven. 4096 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:07:28,387 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:07:28,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 102 [2019-09-10 02:07:28,388 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:07:28,388 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-09-10 02:07:28,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-09-10 02:07:28,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:07:28,389 INFO L87 Difference]: Start difference. First operand 156 states and 157 transitions. Second operand 76 states. [2019-09-10 02:07:28,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:07:28,811 INFO L93 Difference]: Finished difference Result 159 states and 160 transitions. [2019-09-10 02:07:28,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-09-10 02:07:28,812 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 155 [2019-09-10 02:07:28,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:07:28,813 INFO L225 Difference]: With dead ends: 159 [2019-09-10 02:07:28,813 INFO L226 Difference]: Without dead ends: 159 [2019-09-10 02:07:28,814 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 237 SyntacticMatches, 48 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2376 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:07:28,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-09-10 02:07:28,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 158. [2019-09-10 02:07:28,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-09-10 02:07:28,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 159 transitions. [2019-09-10 02:07:28,817 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 159 transitions. Word has length 155 [2019-09-10 02:07:28,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:07:28,817 INFO L475 AbstractCegarLoop]: Abstraction has 158 states and 159 transitions. [2019-09-10 02:07:28,817 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-09-10 02:07:28,817 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 159 transitions. [2019-09-10 02:07:28,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-10 02:07:28,818 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:07:28,818 INFO L399 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-09-10 02:07:28,818 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:07:28,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:07:28,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1929444056, now seen corresponding path program 44 times [2019-09-10 02:07:28,818 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:07:28,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:28,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:07:28,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:28,819 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:07:28,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:31,123 INFO L134 CoverageAnalysis]: Checked inductivity of 4225 backedges. 0 proven. 4225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:07:31,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:31,124 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:07:31,124 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:07:31,124 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:07:31,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:31,124 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:07:31,134 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:07:31,134 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:07:31,226 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 50 check-sat command(s) [2019-09-10 02:07:31,226 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:07:31,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-10 02:07:31,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:07:31,241 INFO L134 CoverageAnalysis]: Checked inductivity of 4225 backedges. 2009 proven. 576 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2019-09-10 02:07:31,241 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:07:32,710 INFO L134 CoverageAnalysis]: Checked inductivity of 4225 backedges. 2009 proven. 576 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2019-09-10 02:07:32,715 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:07:32,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 27, 27] total 102 [2019-09-10 02:07:32,716 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:07:32,716 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-09-10 02:07:32,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-09-10 02:07:32,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:07:32,717 INFO L87 Difference]: Start difference. First operand 158 states and 159 transitions. Second operand 77 states. [2019-09-10 02:07:33,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:07:33,118 INFO L93 Difference]: Finished difference Result 161 states and 162 transitions. [2019-09-10 02:07:33,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-09-10 02:07:33,119 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 157 [2019-09-10 02:07:33,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:07:33,121 INFO L225 Difference]: With dead ends: 161 [2019-09-10 02:07:33,121 INFO L226 Difference]: Without dead ends: 161 [2019-09-10 02:07:33,122 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 290 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:07:33,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-09-10 02:07:33,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 160. [2019-09-10 02:07:33,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-09-10 02:07:33,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 161 transitions. [2019-09-10 02:07:33,125 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 161 transitions. Word has length 157 [2019-09-10 02:07:33,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:07:33,125 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 161 transitions. [2019-09-10 02:07:33,125 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-09-10 02:07:33,126 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 161 transitions. [2019-09-10 02:07:33,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-10 02:07:33,126 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:07:33,127 INFO L399 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-09-10 02:07:33,127 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:07:33,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:07:33,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1237672398, now seen corresponding path program 45 times [2019-09-10 02:07:33,127 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:07:33,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:33,128 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:07:33,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:33,128 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:07:33,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:35,216 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 0 proven. 4356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:07:35,217 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:35,217 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:07:35,217 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:07:35,217 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:07:35,217 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:35,217 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:07:35,228 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:07:35,228 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:07:35,277 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:07:35,277 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:07:35,279 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 77 conjunts are in the unsatisfiable core [2019-09-10 02:07:35,281 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:07:35,313 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 0 proven. 4356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:07:35,313 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:07:38,469 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 0 proven. 4356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:07:38,473 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:07:38,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 102 [2019-09-10 02:07:38,474 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:07:38,474 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-09-10 02:07:38,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-09-10 02:07:38,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:07:38,475 INFO L87 Difference]: Start difference. First operand 160 states and 161 transitions. Second operand 78 states. [2019-09-10 02:07:38,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:07:38,895 INFO L93 Difference]: Finished difference Result 163 states and 164 transitions. [2019-09-10 02:07:38,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-09-10 02:07:38,895 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 159 [2019-09-10 02:07:38,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:07:38,896 INFO L225 Difference]: With dead ends: 163 [2019-09-10 02:07:38,896 INFO L226 Difference]: Without dead ends: 163 [2019-09-10 02:07:38,897 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 243 SyntacticMatches, 52 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2574 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:07:38,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-09-10 02:07:38,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 162. [2019-09-10 02:07:38,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-09-10 02:07:38,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 163 transitions. [2019-09-10 02:07:38,900 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 163 transitions. Word has length 159 [2019-09-10 02:07:38,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:07:38,900 INFO L475 AbstractCegarLoop]: Abstraction has 162 states and 163 transitions. [2019-09-10 02:07:38,900 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-09-10 02:07:38,901 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 163 transitions. [2019-09-10 02:07:38,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-10 02:07:38,901 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:07:38,902 INFO L399 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-09-10 02:07:38,902 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:07:38,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:07:38,902 INFO L82 PathProgramCache]: Analyzing trace with hash 295228172, now seen corresponding path program 46 times [2019-09-10 02:07:38,902 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:07:38,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:38,903 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:07:38,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:38,903 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:07:38,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:40,950 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 0 proven. 4489 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:07:40,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:40,950 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:07:40,951 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:07:40,951 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:07:40,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:40,951 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:07:40,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:07:40,960 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:07:41,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:41,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 78 conjunts are in the unsatisfiable core [2019-09-10 02:07:41,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:07:41,042 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 0 proven. 4489 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:07:41,043 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:07:44,203 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 0 proven. 4489 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:07:44,206 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:07:44,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 102 [2019-09-10 02:07:44,207 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:07:44,207 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-09-10 02:07:44,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-09-10 02:07:44,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:07:44,209 INFO L87 Difference]: Start difference. First operand 162 states and 163 transitions. Second operand 79 states. [2019-09-10 02:07:44,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:07:44,647 INFO L93 Difference]: Finished difference Result 165 states and 166 transitions. [2019-09-10 02:07:44,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-09-10 02:07:44,647 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 161 [2019-09-10 02:07:44,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:07:44,648 INFO L225 Difference]: With dead ends: 165 [2019-09-10 02:07:44,649 INFO L226 Difference]: Without dead ends: 165 [2019-09-10 02:07:44,649 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 400 GetRequests, 246 SyntacticMatches, 54 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2673 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:07:44,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-09-10 02:07:44,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 164. [2019-09-10 02:07:44,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-09-10 02:07:44,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 165 transitions. [2019-09-10 02:07:44,652 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 165 transitions. Word has length 161 [2019-09-10 02:07:44,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:07:44,653 INFO L475 AbstractCegarLoop]: Abstraction has 164 states and 165 transitions. [2019-09-10 02:07:44,653 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-09-10 02:07:44,653 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 165 transitions. [2019-09-10 02:07:44,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-09-10 02:07:44,653 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:07:44,654 INFO L399 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-09-10 02:07:44,654 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:07:44,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:07:44,654 INFO L82 PathProgramCache]: Analyzing trace with hash 238893414, now seen corresponding path program 47 times [2019-09-10 02:07:44,654 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:07:44,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:44,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:07:44,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:44,655 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:07:44,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:46,902 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 0 proven. 4624 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:07:46,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:46,903 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:07:46,903 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:07:46,903 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:07:46,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:46,903 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:07:46,913 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:07:46,913 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:07:46,988 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 56 check-sat command(s) [2019-09-10 02:07:46,988 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:07:46,989 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-10 02:07:46,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:07:47,004 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 2255 proven. 729 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2019-09-10 02:07:47,004 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:07:48,606 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 2255 proven. 729 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2019-09-10 02:07:48,609 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:07:48,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 30, 30] total 102 [2019-09-10 02:07:48,610 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:07:48,610 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-09-10 02:07:48,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-09-10 02:07:48,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:07:48,611 INFO L87 Difference]: Start difference. First operand 164 states and 165 transitions. Second operand 80 states. [2019-09-10 02:07:49,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:07:49,027 INFO L93 Difference]: Finished difference Result 167 states and 168 transitions. [2019-09-10 02:07:49,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-09-10 02:07:49,028 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 163 [2019-09-10 02:07:49,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:07:49,029 INFO L225 Difference]: With dead ends: 167 [2019-09-10 02:07:49,029 INFO L226 Difference]: Without dead ends: 167 [2019-09-10 02:07:49,029 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 299 SyntacticMatches, 6 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:07:49,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-09-10 02:07:49,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 166. [2019-09-10 02:07:49,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-09-10 02:07:49,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 167 transitions. [2019-09-10 02:07:49,033 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 167 transitions. Word has length 163 [2019-09-10 02:07:49,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:07:49,033 INFO L475 AbstractCegarLoop]: Abstraction has 166 states and 167 transitions. [2019-09-10 02:07:49,033 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-09-10 02:07:49,034 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 167 transitions. [2019-09-10 02:07:49,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-10 02:07:49,034 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:07:49,035 INFO L399 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-09-10 02:07:49,035 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:07:49,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:07:49,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1935765824, now seen corresponding path program 48 times [2019-09-10 02:07:49,035 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:07:49,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:49,036 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:07:49,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:49,036 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:07:49,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:51,296 INFO L134 CoverageAnalysis]: Checked inductivity of 4761 backedges. 0 proven. 4761 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:07:51,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:51,297 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:07:51,297 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:07:51,297 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:07:51,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:51,297 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:07:51,306 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:07:51,307 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:07:51,356 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:07:51,356 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:07:51,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 80 conjunts are in the unsatisfiable core [2019-09-10 02:07:51,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:07:51,400 INFO L134 CoverageAnalysis]: Checked inductivity of 4761 backedges. 0 proven. 4761 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:07:51,401 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:07:54,632 INFO L134 CoverageAnalysis]: Checked inductivity of 4761 backedges. 0 proven. 4761 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:07:54,643 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:07:54,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 102 [2019-09-10 02:07:54,643 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:07:54,644 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-09-10 02:07:54,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-09-10 02:07:54,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:07:54,645 INFO L87 Difference]: Start difference. First operand 166 states and 167 transitions. Second operand 81 states. [2019-09-10 02:07:55,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:07:55,068 INFO L93 Difference]: Finished difference Result 169 states and 170 transitions. [2019-09-10 02:07:55,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-09-10 02:07:55,069 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 165 [2019-09-10 02:07:55,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:07:55,071 INFO L225 Difference]: With dead ends: 169 [2019-09-10 02:07:55,071 INFO L226 Difference]: Without dead ends: 169 [2019-09-10 02:07:55,072 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 252 SyntacticMatches, 58 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2871 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:07:55,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-09-10 02:07:55,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 168. [2019-09-10 02:07:55,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-09-10 02:07:55,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 169 transitions. [2019-09-10 02:07:55,075 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 169 transitions. Word has length 165 [2019-09-10 02:07:55,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:07:55,075 INFO L475 AbstractCegarLoop]: Abstraction has 168 states and 169 transitions. [2019-09-10 02:07:55,075 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-09-10 02:07:55,076 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 169 transitions. [2019-09-10 02:07:55,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-10 02:07:55,076 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:07:55,077 INFO L399 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-09-10 02:07:55,077 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:07:55,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:07:55,077 INFO L82 PathProgramCache]: Analyzing trace with hash 542579354, now seen corresponding path program 49 times [2019-09-10 02:07:55,077 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:07:55,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:55,078 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:07:55,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:55,078 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:07:55,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:57,301 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 4900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:07:57,301 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:57,301 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:07:57,301 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:07:57,302 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:07:57,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:57,302 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-09-10 02:07:57,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:07:57,313 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:07:57,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:57,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 81 conjunts are in the unsatisfiable core [2019-09-10 02:07:57,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:07:57,401 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 4900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:07:57,401 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:08:00,713 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 4900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (50)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 02:08:00,716 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:08:00,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 102 [2019-09-10 02:08:00,716 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:08:00,717 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-09-10 02:08:00,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-09-10 02:08:00,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:08:00,718 INFO L87 Difference]: Start difference. First operand 168 states and 169 transitions. Second operand 82 states. [2019-09-10 02:08:01,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:08:01,163 INFO L93 Difference]: Finished difference Result 171 states and 172 transitions. [2019-09-10 02:08:01,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-09-10 02:08:01,163 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 167 [2019-09-10 02:08:01,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:08:01,165 INFO L225 Difference]: With dead ends: 171 [2019-09-10 02:08:01,165 INFO L226 Difference]: Without dead ends: 171 [2019-09-10 02:08:01,165 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 255 SyntacticMatches, 60 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2970 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:08:01,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-09-10 02:08:01,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 170. [2019-09-10 02:08:01,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-09-10 02:08:01,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 171 transitions. [2019-09-10 02:08:01,169 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 171 transitions. Word has length 167 [2019-09-10 02:08:01,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:08:01,169 INFO L475 AbstractCegarLoop]: Abstraction has 170 states and 171 transitions. [2019-09-10 02:08:01,169 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-09-10 02:08:01,169 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 171 transitions. [2019-09-10 02:08:01,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-09-10 02:08:01,170 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:08:01,170 INFO L399 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-09-10 02:08:01,171 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:08:01,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:08:01,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1720178036, now seen corresponding path program 50 times [2019-09-10 02:08:01,171 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:08:01,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:01,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:08:01,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:01,172 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:08:01,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:03,462 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 0 proven. 5041 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:08:03,462 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:03,462 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:08:03,463 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:08:03,463 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:08:03,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:03,463 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:08:03,472 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:08:03,472 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:08:03,610 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 62 check-sat command(s) [2019-09-10 02:08:03,611 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:08:03,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-10 02:08:03,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:08:03,650 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 2501 proven. 900 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2019-09-10 02:08:03,651 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:08:05,537 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 2501 proven. 900 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2019-09-10 02:08:05,541 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:08:05,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 33, 33] total 102 [2019-09-10 02:08:05,542 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:08:05,542 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-09-10 02:08:05,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-09-10 02:08:05,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:08:05,543 INFO L87 Difference]: Start difference. First operand 170 states and 171 transitions. Second operand 83 states. [2019-09-10 02:08:06,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:08:06,000 INFO L93 Difference]: Finished difference Result 173 states and 174 transitions. [2019-09-10 02:08:06,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-09-10 02:08:06,001 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 169 [2019-09-10 02:08:06,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:08:06,002 INFO L225 Difference]: With dead ends: 173 [2019-09-10 02:08:06,002 INFO L226 Difference]: Without dead ends: 173 [2019-09-10 02:08:06,003 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 308 SyntacticMatches, 12 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:08:06,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-09-10 02:08:06,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 172. [2019-09-10 02:08:06,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-09-10 02:08:06,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 173 transitions. [2019-09-10 02:08:06,006 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 173 transitions. Word has length 169 [2019-09-10 02:08:06,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:08:06,006 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 173 transitions. [2019-09-10 02:08:06,006 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-09-10 02:08:06,006 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 173 transitions. [2019-09-10 02:08:06,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-09-10 02:08:06,007 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:08:06,008 INFO L399 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-09-10 02:08:06,008 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:08:06,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:08:06,008 INFO L82 PathProgramCache]: Analyzing trace with hash -478854706, now seen corresponding path program 51 times [2019-09-10 02:08:06,008 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:08:06,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:06,009 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:08:06,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:06,009 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:08:06,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:08,472 INFO L134 CoverageAnalysis]: Checked inductivity of 5184 backedges. 0 proven. 5184 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:08:08,472 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:08,472 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:08:08,472 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:08:08,472 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:08:08,472 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:08,472 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:08:08,484 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:08:08,484 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:08:08,533 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:08:08,533 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:08:08,535 INFO L256 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 83 conjunts are in the unsatisfiable core [2019-09-10 02:08:08,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:08:08,572 INFO L134 CoverageAnalysis]: Checked inductivity of 5184 backedges. 0 proven. 5184 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:08:08,573 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:08:12,015 INFO L134 CoverageAnalysis]: Checked inductivity of 5184 backedges. 0 proven. 5184 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:08:12,018 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:08:12,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 102 [2019-09-10 02:08:12,018 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:08:12,019 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-09-10 02:08:12,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-09-10 02:08:12,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:08:12,020 INFO L87 Difference]: Start difference. First operand 172 states and 173 transitions. Second operand 84 states. [2019-09-10 02:08:12,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:08:12,417 INFO L93 Difference]: Finished difference Result 175 states and 176 transitions. [2019-09-10 02:08:12,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-09-10 02:08:12,417 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 171 [2019-09-10 02:08:12,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:08:12,418 INFO L225 Difference]: With dead ends: 175 [2019-09-10 02:08:12,418 INFO L226 Difference]: Without dead ends: 175 [2019-09-10 02:08:12,419 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 425 GetRequests, 261 SyntacticMatches, 64 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3168 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:08:12,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-09-10 02:08:12,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 174. [2019-09-10 02:08:12,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-09-10 02:08:12,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 175 transitions. [2019-09-10 02:08:12,422 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 175 transitions. Word has length 171 [2019-09-10 02:08:12,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:08:12,422 INFO L475 AbstractCegarLoop]: Abstraction has 174 states and 175 transitions. [2019-09-10 02:08:12,422 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-09-10 02:08:12,422 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 175 transitions. [2019-09-10 02:08:12,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-10 02:08:12,423 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:08:12,423 INFO L399 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-09-10 02:08:12,423 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:08:12,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:08:12,424 INFO L82 PathProgramCache]: Analyzing trace with hash -625410136, now seen corresponding path program 52 times [2019-09-10 02:08:12,424 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:08:12,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:12,424 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:08:12,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:12,425 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:08:12,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:14,787 INFO L134 CoverageAnalysis]: Checked inductivity of 5329 backedges. 0 proven. 5329 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:08:14,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:14,787 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:08:14,787 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:08:14,787 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:08:14,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:14,788 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:08:14,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:08:14,799 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:08:14,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:14,858 INFO L256 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 84 conjunts are in the unsatisfiable core [2019-09-10 02:08:14,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:08:14,897 INFO L134 CoverageAnalysis]: Checked inductivity of 5329 backedges. 0 proven. 5329 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:08:14,897 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:08:18,413 INFO L134 CoverageAnalysis]: Checked inductivity of 5329 backedges. 0 proven. 5329 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:08:18,416 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:08:18,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 102 [2019-09-10 02:08:18,417 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:08:18,417 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-09-10 02:08:18,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-09-10 02:08:18,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:08:18,419 INFO L87 Difference]: Start difference. First operand 174 states and 175 transitions. Second operand 85 states. [2019-09-10 02:08:18,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:08:18,906 INFO L93 Difference]: Finished difference Result 177 states and 178 transitions. [2019-09-10 02:08:18,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-09-10 02:08:18,906 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 173 [2019-09-10 02:08:18,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:08:18,907 INFO L225 Difference]: With dead ends: 177 [2019-09-10 02:08:18,908 INFO L226 Difference]: Without dead ends: 177 [2019-09-10 02:08:18,908 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 430 GetRequests, 264 SyntacticMatches, 66 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3267 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:08:18,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-09-10 02:08:18,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 176. [2019-09-10 02:08:18,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-09-10 02:08:18,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 177 transitions. [2019-09-10 02:08:18,911 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 177 transitions. Word has length 173 [2019-09-10 02:08:18,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:08:18,911 INFO L475 AbstractCegarLoop]: Abstraction has 176 states and 177 transitions. [2019-09-10 02:08:18,911 INFO L476 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-09-10 02:08:18,911 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 177 transitions. [2019-09-10 02:08:18,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-10 02:08:18,912 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:08:18,912 INFO L399 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-09-10 02:08:18,912 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:08:18,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:08:18,913 INFO L82 PathProgramCache]: Analyzing trace with hash 268742402, now seen corresponding path program 53 times [2019-09-10 02:08:18,913 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:08:18,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:18,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:08:18,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:18,914 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:08:18,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:21,378 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 0 proven. 5476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:08:21,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:21,378 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:08:21,379 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:08:21,379 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:08:21,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:21,379 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:08:21,388 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:08:21,389 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:08:21,480 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 68 check-sat command(s) [2019-09-10 02:08:21,480 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:08:21,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-10 02:08:21,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:08:21,502 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 2747 proven. 1089 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2019-09-10 02:08:21,503 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:08:23,422 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 2747 proven. 1089 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2019-09-10 02:08:23,425 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:08:23,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 36, 36] total 102 [2019-09-10 02:08:23,426 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:08:23,426 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-09-10 02:08:23,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-09-10 02:08:23,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:08:23,428 INFO L87 Difference]: Start difference. First operand 176 states and 177 transitions. Second operand 86 states. [2019-09-10 02:08:23,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:08:23,863 INFO L93 Difference]: Finished difference Result 179 states and 180 transitions. [2019-09-10 02:08:23,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-09-10 02:08:23,863 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 175 [2019-09-10 02:08:23,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:08:23,865 INFO L225 Difference]: With dead ends: 179 [2019-09-10 02:08:23,865 INFO L226 Difference]: Without dead ends: 179 [2019-09-10 02:08:23,865 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 317 SyntacticMatches, 18 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:08:23,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-09-10 02:08:23,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 178. [2019-09-10 02:08:23,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-09-10 02:08:23,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 179 transitions. [2019-09-10 02:08:23,869 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 179 transitions. Word has length 175 [2019-09-10 02:08:23,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:08:23,869 INFO L475 AbstractCegarLoop]: Abstraction has 178 states and 179 transitions. [2019-09-10 02:08:23,869 INFO L476 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-09-10 02:08:23,869 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 179 transitions. [2019-09-10 02:08:23,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-09-10 02:08:23,870 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:08:23,871 INFO L399 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-09-10 02:08:23,871 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:08:23,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:08:23,871 INFO L82 PathProgramCache]: Analyzing trace with hash 555872220, now seen corresponding path program 54 times [2019-09-10 02:08:23,871 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:08:23,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:23,872 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:08:23,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:23,872 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:08:23,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:26,402 INFO L134 CoverageAnalysis]: Checked inductivity of 5625 backedges. 0 proven. 5625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:08:26,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:26,402 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:08:26,403 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:08:26,403 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:08:26,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:26,403 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:08:26,413 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:08:26,414 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:08:26,469 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:08:26,469 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:08:26,471 INFO L256 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 86 conjunts are in the unsatisfiable core [2019-09-10 02:08:26,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:08:26,501 INFO L134 CoverageAnalysis]: Checked inductivity of 5625 backedges. 0 proven. 5625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:08:26,502 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:08:29,822 INFO L134 CoverageAnalysis]: Checked inductivity of 5625 backedges. 0 proven. 5625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:08:29,825 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:08:29,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 102 [2019-09-10 02:08:29,826 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:08:29,826 INFO L454 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-09-10 02:08:29,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-09-10 02:08:29,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:08:29,828 INFO L87 Difference]: Start difference. First operand 178 states and 179 transitions. Second operand 87 states. [2019-09-10 02:08:30,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:08:30,293 INFO L93 Difference]: Finished difference Result 181 states and 182 transitions. [2019-09-10 02:08:30,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-09-10 02:08:30,293 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 177 [2019-09-10 02:08:30,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:08:30,294 INFO L225 Difference]: With dead ends: 181 [2019-09-10 02:08:30,295 INFO L226 Difference]: Without dead ends: 181 [2019-09-10 02:08:30,295 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 440 GetRequests, 270 SyntacticMatches, 70 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3465 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:08:30,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-09-10 02:08:30,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 180. [2019-09-10 02:08:30,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-09-10 02:08:30,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 181 transitions. [2019-09-10 02:08:30,298 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 181 transitions. Word has length 177 [2019-09-10 02:08:30,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:08:30,298 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 181 transitions. [2019-09-10 02:08:30,298 INFO L476 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-09-10 02:08:30,298 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 181 transitions. [2019-09-10 02:08:30,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-10 02:08:30,299 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:08:30,300 INFO L399 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-09-10 02:08:30,300 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:08:30,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:08:30,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1609720374, now seen corresponding path program 55 times [2019-09-10 02:08:30,300 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:08:30,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:30,301 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:08:30,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:30,301 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:08:30,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:32,946 INFO L134 CoverageAnalysis]: Checked inductivity of 5776 backedges. 0 proven. 5776 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:08:32,946 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:32,946 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:08:32,947 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:08:32,947 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:08:32,947 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:32,947 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:08:32,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:08:32,957 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:08:33,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:33,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 87 conjunts are in the unsatisfiable core [2019-09-10 02:08:33,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:08:33,041 INFO L134 CoverageAnalysis]: Checked inductivity of 5776 backedges. 0 proven. 5776 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:08:33,041 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:08:36,347 INFO L134 CoverageAnalysis]: Checked inductivity of 5776 backedges. 0 proven. 5776 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:08:36,350 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:08:36,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 102 [2019-09-10 02:08:36,350 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:08:36,352 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-09-10 02:08:36,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-09-10 02:08:36,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:08:36,353 INFO L87 Difference]: Start difference. First operand 180 states and 181 transitions. Second operand 88 states. [2019-09-10 02:08:36,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:08:36,810 INFO L93 Difference]: Finished difference Result 183 states and 184 transitions. [2019-09-10 02:08:36,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-09-10 02:08:36,810 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 179 [2019-09-10 02:08:36,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:08:36,812 INFO L225 Difference]: With dead ends: 183 [2019-09-10 02:08:36,812 INFO L226 Difference]: Without dead ends: 183 [2019-09-10 02:08:36,813 INFO L628 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-09-10 02:08:36,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-09-10 02:08:36,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 182. [2019-09-10 02:08:36,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-09-10 02:08:36,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 183 transitions. [2019-09-10 02:08:36,816 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 183 transitions. Word has length 179 [2019-09-10 02:08:36,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:08:36,816 INFO L475 AbstractCegarLoop]: Abstraction has 182 states and 183 transitions. [2019-09-10 02:08:36,816 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-09-10 02:08:36,817 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 183 transitions. [2019-09-10 02:08:36,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-10 02:08:36,817 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:08:36,818 INFO L399 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-09-10 02:08:36,818 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:08:36,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:08:36,818 INFO L82 PathProgramCache]: Analyzing trace with hash 745514512, now seen corresponding path program 56 times [2019-09-10 02:08:36,818 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:08:36,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:36,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:08:36,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:36,819 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:08:36,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:39,523 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 0 proven. 5929 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:08:39,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:39,523 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:08:39,524 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:08:39,524 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:08:39,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:39,524 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:08:39,537 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:08:39,537 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:08:39,638 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 74 check-sat command(s) [2019-09-10 02:08:39,639 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:08:39,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-10 02:08:39,642 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:08:39,670 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 2993 proven. 1296 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2019-09-10 02:08:39,670 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:08:41,713 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 2993 proven. 1296 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2019-09-10 02:08:41,716 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:08:41,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 39, 39] total 102 [2019-09-10 02:08:41,716 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:08:41,717 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-09-10 02:08:41,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-09-10 02:08:41,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:08:41,718 INFO L87 Difference]: Start difference. First operand 182 states and 183 transitions. Second operand 89 states. [2019-09-10 02:08:42,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:08:42,185 INFO L93 Difference]: Finished difference Result 185 states and 186 transitions. [2019-09-10 02:08:42,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-09-10 02:08:42,186 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 181 [2019-09-10 02:08:42,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:08:42,187 INFO L225 Difference]: With dead ends: 185 [2019-09-10 02:08:42,187 INFO L226 Difference]: Without dead ends: 185 [2019-09-10 02:08:42,188 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 326 SyntacticMatches, 24 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 588 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:08:42,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-09-10 02:08:42,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 184. [2019-09-10 02:08:42,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-09-10 02:08:42,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 185 transitions. [2019-09-10 02:08:42,192 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 185 transitions. Word has length 181 [2019-09-10 02:08:42,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:08:42,192 INFO L475 AbstractCegarLoop]: Abstraction has 184 states and 185 transitions. [2019-09-10 02:08:42,192 INFO L476 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-09-10 02:08:42,192 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 185 transitions. [2019-09-10 02:08:42,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-09-10 02:08:42,193 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:08:42,193 INFO L399 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-09-10 02:08:42,193 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:08:42,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:08:42,194 INFO L82 PathProgramCache]: Analyzing trace with hash -827630742, now seen corresponding path program 57 times [2019-09-10 02:08:42,194 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:08:42,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:42,195 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:08:42,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:42,195 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:08:42,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:44,907 INFO L134 CoverageAnalysis]: Checked inductivity of 6084 backedges. 0 proven. 6084 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:08:44,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:44,907 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:08:44,908 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:08:44,908 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:08:44,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:44,908 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:08:44,917 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:08:44,917 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:08:44,972 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:08:44,973 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:08:44,975 INFO L256 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 89 conjunts are in the unsatisfiable core [2019-09-10 02:08:44,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:08:45,013 INFO L134 CoverageAnalysis]: Checked inductivity of 6084 backedges. 0 proven. 6084 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:08:45,013 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:08:48,285 INFO L134 CoverageAnalysis]: Checked inductivity of 6084 backedges. 0 proven. 6084 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:08:48,288 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:08:48,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90, 90] total 102 [2019-09-10 02:08:48,289 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:08:48,289 INFO L454 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-09-10 02:08:48,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-09-10 02:08:48,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:08:48,291 INFO L87 Difference]: Start difference. First operand 184 states and 185 transitions. Second operand 90 states. [2019-09-10 02:08:48,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:08:48,727 INFO L93 Difference]: Finished difference Result 187 states and 188 transitions. [2019-09-10 02:08:48,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-09-10 02:08:48,728 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 183 [2019-09-10 02:08:48,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:08:48,729 INFO L225 Difference]: With dead ends: 187 [2019-09-10 02:08:48,729 INFO L226 Difference]: Without dead ends: 187 [2019-09-10 02:08:48,730 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 455 GetRequests, 279 SyntacticMatches, 76 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3762 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:08:48,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-09-10 02:08:48,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 186. [2019-09-10 02:08:48,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-09-10 02:08:48,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 187 transitions. [2019-09-10 02:08:48,733 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 187 transitions. Word has length 183 [2019-09-10 02:08:48,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:08:48,733 INFO L475 AbstractCegarLoop]: Abstraction has 186 states and 187 transitions. [2019-09-10 02:08:48,734 INFO L476 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-09-10 02:08:48,734 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 187 transitions. [2019-09-10 02:08:48,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-09-10 02:08:48,734 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:08:48,734 INFO L399 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-09-10 02:08:48,735 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:08:48,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:08:48,735 INFO L82 PathProgramCache]: Analyzing trace with hash -791731644, now seen corresponding path program 58 times [2019-09-10 02:08:48,735 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:08:48,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:48,735 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:08:48,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:48,736 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:08:48,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:51,603 INFO L134 CoverageAnalysis]: Checked inductivity of 6241 backedges. 0 proven. 6241 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:08:51,603 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:51,603 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:08:51,603 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:08:51,604 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:08:51,604 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:51,604 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:08:51,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:08:51,614 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:08:51,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:51,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 90 conjunts are in the unsatisfiable core [2019-09-10 02:08:51,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:08:51,702 INFO L134 CoverageAnalysis]: Checked inductivity of 6241 backedges. 0 proven. 6241 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:08:51,702 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:08:55,055 INFO L134 CoverageAnalysis]: Checked inductivity of 6241 backedges. 0 proven. 6241 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:08:55,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:08:55,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 102 [2019-09-10 02:08:55,058 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:08:55,058 INFO L454 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-09-10 02:08:55,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-09-10 02:08:55,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:08:55,059 INFO L87 Difference]: Start difference. First operand 186 states and 187 transitions. Second operand 91 states. [2019-09-10 02:08:55,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:08:55,563 INFO L93 Difference]: Finished difference Result 189 states and 190 transitions. [2019-09-10 02:08:55,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-09-10 02:08:55,563 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 185 [2019-09-10 02:08:55,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:08:55,564 INFO L225 Difference]: With dead ends: 189 [2019-09-10 02:08:55,565 INFO L226 Difference]: Without dead ends: 189 [2019-09-10 02:08:55,565 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 282 SyntacticMatches, 78 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3861 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:08:55,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-09-10 02:08:55,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 188. [2019-09-10 02:08:55,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-09-10 02:08:55,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 189 transitions. [2019-09-10 02:08:55,568 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 189 transitions. Word has length 185 [2019-09-10 02:08:55,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:08:55,569 INFO L475 AbstractCegarLoop]: Abstraction has 188 states and 189 transitions. [2019-09-10 02:08:55,569 INFO L476 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-09-10 02:08:55,569 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 189 transitions. [2019-09-10 02:08:55,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-09-10 02:08:55,570 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:08:55,570 INFO L399 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-09-10 02:08:55,570 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:08:55,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:08:55,571 INFO L82 PathProgramCache]: Analyzing trace with hash -652436834, now seen corresponding path program 59 times [2019-09-10 02:08:55,571 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:08:55,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:55,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:08:55,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:08:55,572 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:08:55,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:08:58,397 INFO L134 CoverageAnalysis]: Checked inductivity of 6400 backedges. 0 proven. 6400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:08:58,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:58,397 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:08:58,397 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:08:58,397 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:08:58,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:08:58,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 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:08:58,408 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:08:58,408 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:08:58,523 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 80 check-sat command(s) [2019-09-10 02:08:58,523 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:08:58,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-10 02:08:58,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:08:58,544 INFO L134 CoverageAnalysis]: Checked inductivity of 6400 backedges. 3239 proven. 1521 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2019-09-10 02:08:58,544 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:09:00,672 INFO L134 CoverageAnalysis]: Checked inductivity of 6400 backedges. 3239 proven. 1521 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2019-09-10 02:09:00,676 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:09:00,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 42, 42] total 102 [2019-09-10 02:09:00,676 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:09:00,676 INFO L454 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-09-10 02:09:00,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-09-10 02:09:00,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:09:00,678 INFO L87 Difference]: Start difference. First operand 188 states and 189 transitions. Second operand 92 states. [2019-09-10 02:09:01,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:09:01,211 INFO L93 Difference]: Finished difference Result 191 states and 192 transitions. [2019-09-10 02:09:01,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-09-10 02:09:01,212 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 187 [2019-09-10 02:09:01,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:09:01,213 INFO L225 Difference]: With dead ends: 191 [2019-09-10 02:09:01,213 INFO L226 Difference]: Without dead ends: 191 [2019-09-10 02:09:01,213 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 465 GetRequests, 335 SyntacticMatches, 30 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 735 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:09:01,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-09-10 02:09:01,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 190. [2019-09-10 02:09:01,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-09-10 02:09:01,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 191 transitions. [2019-09-10 02:09:01,216 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 191 transitions. Word has length 187 [2019-09-10 02:09:01,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:09:01,216 INFO L475 AbstractCegarLoop]: Abstraction has 190 states and 191 transitions. [2019-09-10 02:09:01,216 INFO L476 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-09-10 02:09:01,217 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 191 transitions. [2019-09-10 02:09:01,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-09-10 02:09:01,218 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:09:01,218 INFO L399 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-09-10 02:09:01,218 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:09:01,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:09:01,218 INFO L82 PathProgramCache]: Analyzing trace with hash 65889400, now seen corresponding path program 60 times [2019-09-10 02:09:01,219 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:09:01,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:09:01,219 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:09:01,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:09:01,219 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:09:01,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:09:04,139 INFO L134 CoverageAnalysis]: Checked inductivity of 6561 backedges. 0 proven. 6561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:09:04,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:09:04,140 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:09:04,140 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:09:04,140 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:09:04,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:09:04,140 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:09:04,151 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:09:04,151 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:09:04,210 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:09:04,210 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:09:04,212 INFO L256 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 92 conjunts are in the unsatisfiable core [2019-09-10 02:09:04,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:09:04,241 INFO L134 CoverageAnalysis]: Checked inductivity of 6561 backedges. 0 proven. 6561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:09:04,241 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:09:07,575 INFO L134 CoverageAnalysis]: Checked inductivity of 6561 backedges. 0 proven. 6561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:09:07,577 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:09:07,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 102 [2019-09-10 02:09:07,578 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:09:07,578 INFO L454 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-09-10 02:09:07,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-09-10 02:09:07,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:09:07,579 INFO L87 Difference]: Start difference. First operand 190 states and 191 transitions. Second operand 93 states. [2019-09-10 02:09:08,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:09:08,068 INFO L93 Difference]: Finished difference Result 193 states and 194 transitions. [2019-09-10 02:09:08,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-09-10 02:09:08,068 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 189 [2019-09-10 02:09:08,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:09:08,069 INFO L225 Difference]: With dead ends: 193 [2019-09-10 02:09:08,069 INFO L226 Difference]: Without dead ends: 193 [2019-09-10 02:09:08,070 INFO L628 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-09-10 02:09:08,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-09-10 02:09:08,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 192. [2019-09-10 02:09:08,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-09-10 02:09:08,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 193 transitions. [2019-09-10 02:09:08,073 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 193 transitions. Word has length 189 [2019-09-10 02:09:08,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:09:08,074 INFO L475 AbstractCegarLoop]: Abstraction has 192 states and 193 transitions. [2019-09-10 02:09:08,074 INFO L476 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-09-10 02:09:08,074 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 193 transitions. [2019-09-10 02:09:08,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-09-10 02:09:08,075 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:09:08,075 INFO L399 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-09-10 02:09:08,075 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:09:08,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:09:08,076 INFO L82 PathProgramCache]: Analyzing trace with hash -1112334382, now seen corresponding path program 61 times [2019-09-10 02:09:08,076 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:09:08,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:09:08,077 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:09:08,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:09:08,077 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:09:08,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:09:10,997 INFO L134 CoverageAnalysis]: Checked inductivity of 6724 backedges. 0 proven. 6724 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:09:10,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:09:10,997 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:09:10,997 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:09:10,997 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:09:10,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:09:10,998 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:09:11,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:09:11,014 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:09:11,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:09:11,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 93 conjunts are in the unsatisfiable core [2019-09-10 02:09:11,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:09:11,103 INFO L134 CoverageAnalysis]: Checked inductivity of 6724 backedges. 0 proven. 6724 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:09:11,103 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:09:14,447 INFO L134 CoverageAnalysis]: Checked inductivity of 6724 backedges. 0 proven. 6724 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:09:14,450 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:09:14,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94, 94] total 102 [2019-09-10 02:09:14,450 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:09:14,451 INFO L454 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-09-10 02:09:14,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-09-10 02:09:14,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:09:14,452 INFO L87 Difference]: Start difference. First operand 192 states and 193 transitions. Second operand 94 states. [2019-09-10 02:09:14,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:09:14,952 INFO L93 Difference]: Finished difference Result 195 states and 196 transitions. [2019-09-10 02:09:14,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-09-10 02:09:14,952 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 191 [2019-09-10 02:09:14,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:09:14,954 INFO L225 Difference]: With dead ends: 195 [2019-09-10 02:09:14,954 INFO L226 Difference]: Without dead ends: 195 [2019-09-10 02:09:14,955 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 475 GetRequests, 291 SyntacticMatches, 84 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4158 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:09:14,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-09-10 02:09:14,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 194. [2019-09-10 02:09:14,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-10 02:09:14,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 195 transitions. [2019-09-10 02:09:14,958 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 195 transitions. Word has length 191 [2019-09-10 02:09:14,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:09:14,958 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 195 transitions. [2019-09-10 02:09:14,958 INFO L476 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-09-10 02:09:14,958 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 195 transitions. [2019-09-10 02:09:14,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-09-10 02:09:14,959 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:09:14,959 INFO L399 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-09-10 02:09:14,959 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:09:14,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:09:14,960 INFO L82 PathProgramCache]: Analyzing trace with hash 485977260, now seen corresponding path program 62 times [2019-09-10 02:09:14,960 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:09:14,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:09:14,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:09:14,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:09:14,961 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:09:14,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:09:17,957 INFO L134 CoverageAnalysis]: Checked inductivity of 6889 backedges. 0 proven. 6889 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:09:17,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:09:17,958 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:09:17,958 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:09:17,958 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:09:17,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:09:17,958 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:09:17,968 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:09:17,968 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:09:18,099 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 84 check-sat command(s) [2019-09-10 02:09:18,099 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:09:18,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 94 conjunts are in the unsatisfiable core [2019-09-10 02:09:18,105 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:09:18,133 INFO L134 CoverageAnalysis]: Checked inductivity of 6889 backedges. 0 proven. 6889 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:09:18,134 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:09:21,511 INFO L134 CoverageAnalysis]: Checked inductivity of 6889 backedges. 0 proven. 6889 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:09:21,515 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:09:21,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 102 [2019-09-10 02:09:21,515 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:09:21,515 INFO L454 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-09-10 02:09:21,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-09-10 02:09:21,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:09:21,516 INFO L87 Difference]: Start difference. First operand 194 states and 195 transitions. Second operand 95 states. [2019-09-10 02:09:22,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:09:22,048 INFO L93 Difference]: Finished difference Result 197 states and 198 transitions. [2019-09-10 02:09:22,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-09-10 02:09:22,048 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 193 [2019-09-10 02:09:22,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:09:22,049 INFO L225 Difference]: With dead ends: 197 [2019-09-10 02:09:22,049 INFO L226 Difference]: Without dead ends: 197 [2019-09-10 02:09:22,050 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 480 GetRequests, 294 SyntacticMatches, 86 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4257 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:09:22,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-09-10 02:09:22,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 196. [2019-09-10 02:09:22,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-09-10 02:09:22,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 197 transitions. [2019-09-10 02:09:22,053 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 197 transitions. Word has length 193 [2019-09-10 02:09:22,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:09:22,053 INFO L475 AbstractCegarLoop]: Abstraction has 196 states and 197 transitions. [2019-09-10 02:09:22,053 INFO L476 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-09-10 02:09:22,053 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 197 transitions. [2019-09-10 02:09:22,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-10 02:09:22,054 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:09:22,054 INFO L399 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-09-10 02:09:22,054 INFO L418 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:09:22,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:09:22,055 INFO L82 PathProgramCache]: Analyzing trace with hash -1134826746, now seen corresponding path program 63 times [2019-09-10 02:09:22,055 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:09:22,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:09:22,055 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:09:22,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:09:22,056 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:09:22,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:09:25,102 INFO L134 CoverageAnalysis]: Checked inductivity of 7056 backedges. 0 proven. 7056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:09:25,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:09:25,103 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:09:25,103 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:09:25,103 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:09:25,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:09:25,103 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:09:25,116 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:09:25,116 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:09:25,179 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:09:25,179 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:09:25,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 95 conjunts are in the unsatisfiable core [2019-09-10 02:09:25,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:09:25,212 INFO L134 CoverageAnalysis]: Checked inductivity of 7056 backedges. 0 proven. 7056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:09:25,212 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:09:28,627 INFO L134 CoverageAnalysis]: Checked inductivity of 7056 backedges. 0 proven. 7056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:09:28,630 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:09:28,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 102 [2019-09-10 02:09:28,630 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:09:28,631 INFO L454 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-09-10 02:09:28,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-09-10 02:09:28,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:09:28,632 INFO L87 Difference]: Start difference. First operand 196 states and 197 transitions. Second operand 96 states. [2019-09-10 02:09:29,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:09:29,156 INFO L93 Difference]: Finished difference Result 199 states and 200 transitions. [2019-09-10 02:09:29,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-09-10 02:09:29,157 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 195 [2019-09-10 02:09:29,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:09:29,158 INFO L225 Difference]: With dead ends: 199 [2019-09-10 02:09:29,158 INFO L226 Difference]: Without dead ends: 199 [2019-09-10 02:09:29,158 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 485 GetRequests, 297 SyntacticMatches, 88 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4356 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:09:29,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-09-10 02:09:29,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 198. [2019-09-10 02:09:29,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2019-09-10 02:09:29,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 199 transitions. [2019-09-10 02:09:29,161 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 199 transitions. Word has length 195 [2019-09-10 02:09:29,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:09:29,161 INFO L475 AbstractCegarLoop]: Abstraction has 198 states and 199 transitions. [2019-09-10 02:09:29,161 INFO L476 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-09-10 02:09:29,161 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 199 transitions. [2019-09-10 02:09:29,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-09-10 02:09:29,162 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:09:29,162 INFO L399 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-09-10 02:09:29,163 INFO L418 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:09:29,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:09:29,163 INFO L82 PathProgramCache]: Analyzing trace with hash 345651936, now seen corresponding path program 64 times [2019-09-10 02:09:29,163 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:09:29,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:09:29,164 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:09:29,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:09:29,164 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:09:29,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:09:32,281 INFO L134 CoverageAnalysis]: Checked inductivity of 7225 backedges. 0 proven. 7225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:09:32,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:09:32,281 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:09:32,282 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:09:32,282 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:09:32,282 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:09:32,282 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:09:32,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:09:32,292 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:09:32,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:09:32,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 96 conjunts are in the unsatisfiable core [2019-09-10 02:09:32,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:09:32,388 INFO L134 CoverageAnalysis]: Checked inductivity of 7225 backedges. 0 proven. 7225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:09:32,389 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:09:35,805 INFO L134 CoverageAnalysis]: Checked inductivity of 7225 backedges. 0 proven. 7225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:09:35,808 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:09:35,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 102 [2019-09-10 02:09:35,809 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:09:35,809 INFO L454 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-09-10 02:09:35,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-09-10 02:09:35,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:09:35,810 INFO L87 Difference]: Start difference. First operand 198 states and 199 transitions. Second operand 97 states. [2019-09-10 02:09:36,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:09:36,323 INFO L93 Difference]: Finished difference Result 201 states and 202 transitions. [2019-09-10 02:09:36,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-09-10 02:09:36,324 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 197 [2019-09-10 02:09:36,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:09:36,325 INFO L225 Difference]: With dead ends: 201 [2019-09-10 02:09:36,325 INFO L226 Difference]: Without dead ends: 201 [2019-09-10 02:09:36,326 INFO L628 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-09-10 02:09:36,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-09-10 02:09:36,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 200. [2019-09-10 02:09:36,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-09-10 02:09:36,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 201 transitions. [2019-09-10 02:09:36,329 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 201 transitions. Word has length 197 [2019-09-10 02:09:36,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:09:36,329 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 201 transitions. [2019-09-10 02:09:36,330 INFO L476 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-09-10 02:09:36,330 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 201 transitions. [2019-09-10 02:09:36,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-09-10 02:09:36,331 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:09:36,331 INFO L399 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-09-10 02:09:36,331 INFO L418 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:09:36,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:09:36,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1451490362, now seen corresponding path program 65 times [2019-09-10 02:09:36,332 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:09:36,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:09:36,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:09:36,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:09:36,333 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:09:36,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:09:39,474 INFO L134 CoverageAnalysis]: Checked inductivity of 7396 backedges. 0 proven. 7396 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:09:39,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:09:39,474 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:09:39,474 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:09:39,474 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:09:39,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:09:39,475 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:09:39,485 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:09:39,485 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:09:39,634 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 87 check-sat command(s) [2019-09-10 02:09:39,634 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:09:39,636 INFO L256 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 97 conjunts are in the unsatisfiable core [2019-09-10 02:09:39,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:09:39,681 INFO L134 CoverageAnalysis]: Checked inductivity of 7396 backedges. 0 proven. 7396 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:09:39,681 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:09:43,126 INFO L134 CoverageAnalysis]: Checked inductivity of 7396 backedges. 0 proven. 7396 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:09:43,130 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:09:43,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 102 [2019-09-10 02:09:43,131 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:09:43,131 INFO L454 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-09-10 02:09:43,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-09-10 02:09:43,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:09:43,132 INFO L87 Difference]: Start difference. First operand 200 states and 201 transitions. Second operand 98 states. [2019-09-10 02:09:43,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:09:43,635 INFO L93 Difference]: Finished difference Result 203 states and 204 transitions. [2019-09-10 02:09:43,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-09-10 02:09:43,635 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 199 [2019-09-10 02:09:43,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:09:43,637 INFO L225 Difference]: With dead ends: 203 [2019-09-10 02:09:43,637 INFO L226 Difference]: Without dead ends: 203 [2019-09-10 02:09:43,637 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 495 GetRequests, 303 SyntacticMatches, 92 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4554 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:09:43,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-09-10 02:09:43,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 202. [2019-09-10 02:09:43,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-09-10 02:09:43,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 203 transitions. [2019-09-10 02:09:43,641 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 203 transitions. Word has length 199 [2019-09-10 02:09:43,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:09:43,641 INFO L475 AbstractCegarLoop]: Abstraction has 202 states and 203 transitions. [2019-09-10 02:09:43,641 INFO L476 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-09-10 02:09:43,641 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 203 transitions. [2019-09-10 02:09:43,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-09-10 02:09:43,642 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:09:43,643 INFO L399 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-09-10 02:09:43,643 INFO L418 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:09:43,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:09:43,643 INFO L82 PathProgramCache]: Analyzing trace with hash -989671660, now seen corresponding path program 66 times [2019-09-10 02:09:43,643 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:09:43,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:09:43,644 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:09:43,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:09:43,644 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:09:43,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:09:46,915 INFO L134 CoverageAnalysis]: Checked inductivity of 7569 backedges. 0 proven. 7569 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:09:46,915 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:09:46,915 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:09:46,915 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:09:46,915 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:09:46,916 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:09:46,916 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:09:46,926 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:09:46,926 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:09:46,988 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:09:46,988 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:09:46,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 98 conjunts are in the unsatisfiable core [2019-09-10 02:09:46,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:09:47,022 INFO L134 CoverageAnalysis]: Checked inductivity of 7569 backedges. 0 proven. 7569 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:09:47,023 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:09:50,399 INFO L134 CoverageAnalysis]: Checked inductivity of 7569 backedges. 0 proven. 7569 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:09:50,402 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:09:50,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99] total 102 [2019-09-10 02:09:50,403 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:09:50,403 INFO L454 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-09-10 02:09:50,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-09-10 02:09:50,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:09:50,405 INFO L87 Difference]: Start difference. First operand 202 states and 203 transitions. Second operand 99 states. [2019-09-10 02:09:50,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:09:50,919 INFO L93 Difference]: Finished difference Result 205 states and 206 transitions. [2019-09-10 02:09:50,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-09-10 02:09:50,920 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 201 [2019-09-10 02:09:50,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:09:50,922 INFO L225 Difference]: With dead ends: 205 [2019-09-10 02:09:50,922 INFO L226 Difference]: Without dead ends: 205 [2019-09-10 02:09:50,922 INFO L628 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-09-10 02:09:50,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-09-10 02:09:50,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 204. [2019-09-10 02:09:50,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2019-09-10 02:09:50,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 205 transitions. [2019-09-10 02:09:50,926 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 205 transitions. Word has length 201 [2019-09-10 02:09:50,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:09:50,926 INFO L475 AbstractCegarLoop]: Abstraction has 204 states and 205 transitions. [2019-09-10 02:09:50,926 INFO L476 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-09-10 02:09:50,927 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 205 transitions. [2019-09-10 02:09:50,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-09-10 02:09:50,928 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:09:50,928 INFO L399 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-09-10 02:09:50,928 INFO L418 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:09:50,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:09:50,928 INFO L82 PathProgramCache]: Analyzing trace with hash -1894231186, now seen corresponding path program 67 times [2019-09-10 02:09:50,928 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:09:50,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:09:50,929 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:09:50,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:09:50,929 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:09:50,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:09:54,262 INFO L134 CoverageAnalysis]: Checked inductivity of 7744 backedges. 0 proven. 7744 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:09:54,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:09:54,263 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:09:54,263 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:09:54,263 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:09:54,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:09:54,263 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:09:54,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:09:54,274 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:09:54,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:09:54,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 99 conjunts are in the unsatisfiable core [2019-09-10 02:09:54,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:09:54,375 INFO L134 CoverageAnalysis]: Checked inductivity of 7744 backedges. 0 proven. 7744 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:09:54,375 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:09:57,750 INFO L134 CoverageAnalysis]: Checked inductivity of 7744 backedges. 0 proven. 7744 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:09:57,753 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:09:57,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100, 100] total 102 [2019-09-10 02:09:57,754 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:09:57,754 INFO L454 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-09-10 02:09:57,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-09-10 02:09:57,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:09:57,755 INFO L87 Difference]: Start difference. First operand 204 states and 205 transitions. Second operand 100 states. [2019-09-10 02:09:58,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:09:58,295 INFO L93 Difference]: Finished difference Result 207 states and 208 transitions. [2019-09-10 02:09:58,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-09-10 02:09:58,295 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 203 [2019-09-10 02:09:58,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:09:58,296 INFO L225 Difference]: With dead ends: 207 [2019-09-10 02:09:58,296 INFO L226 Difference]: Without dead ends: 207 [2019-09-10 02:09:58,296 INFO L628 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-09-10 02:09:58,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-09-10 02:09:58,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 206. [2019-09-10 02:09:58,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-09-10 02:09:58,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 207 transitions. [2019-09-10 02:09:58,300 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 207 transitions. Word has length 203 [2019-09-10 02:09:58,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:09:58,300 INFO L475 AbstractCegarLoop]: Abstraction has 206 states and 207 transitions. [2019-09-10 02:09:58,300 INFO L476 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-09-10 02:09:58,300 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 207 transitions. [2019-09-10 02:09:58,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-09-10 02:09:58,301 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:09:58,302 INFO L399 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-09-10 02:09:58,302 INFO L418 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:09:58,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:09:58,302 INFO L82 PathProgramCache]: Analyzing trace with hash 702425416, now seen corresponding path program 68 times [2019-09-10 02:09:58,302 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:09:58,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:09:58,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:09:58,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:09:58,303 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:09:58,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:10:01,719 INFO L134 CoverageAnalysis]: Checked inductivity of 7921 backedges. 0 proven. 7921 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:10:01,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:10:01,719 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:10:01,719 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:10:01,719 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:10:01,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:10:01,719 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:10:01,730 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:10:01,731 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:10:01,865 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 90 check-sat command(s) [2019-09-10 02:10:01,865 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:10:01,868 INFO L256 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 100 conjunts are in the unsatisfiable core [2019-09-10 02:10:01,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:10:01,901 INFO L134 CoverageAnalysis]: Checked inductivity of 7921 backedges. 0 proven. 7921 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:10:01,901 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:10:05,282 INFO L134 CoverageAnalysis]: Checked inductivity of 7921 backedges. 0 proven. 7921 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:10:05,285 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:10:05,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101, 101] total 102 [2019-09-10 02:10:05,286 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:10:05,286 INFO L454 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-09-10 02:10:05,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-09-10 02:10:05,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:10:05,288 INFO L87 Difference]: Start difference. First operand 206 states and 207 transitions. Second operand 101 states. [2019-09-10 02:10:05,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:10:05,789 INFO L93 Difference]: Finished difference Result 209 states and 210 transitions. [2019-09-10 02:10:05,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-09-10 02:10:05,790 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 205 [2019-09-10 02:10:05,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:10:05,791 INFO L225 Difference]: With dead ends: 209 [2019-09-10 02:10:05,791 INFO L226 Difference]: Without dead ends: 209 [2019-09-10 02:10:05,792 INFO L628 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-09-10 02:10:05,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-09-10 02:10:05,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 208. [2019-09-10 02:10:05,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-09-10 02:10:05,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 209 transitions. [2019-09-10 02:10:05,795 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 209 transitions. Word has length 205 [2019-09-10 02:10:05,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:10:05,795 INFO L475 AbstractCegarLoop]: Abstraction has 208 states and 209 transitions. [2019-09-10 02:10:05,795 INFO L476 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-09-10 02:10:05,795 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 209 transitions. [2019-09-10 02:10:05,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-09-10 02:10:05,796 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:10:05,796 INFO L399 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-09-10 02:10:05,796 INFO L418 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:10:05,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:10:05,796 INFO L82 PathProgramCache]: Analyzing trace with hash 713420962, now seen corresponding path program 69 times [2019-09-10 02:10:05,796 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:10:05,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:10:05,797 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:10:05,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:10:05,797 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:10:05,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:10:09,641 INFO L134 CoverageAnalysis]: Checked inductivity of 8100 backedges. 0 proven. 8100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:10:09,641 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:10:09,641 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:10:09,641 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:10:09,641 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:10:09,642 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:10:09,642 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:10:09,651 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:10:09,651 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:10:09,716 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:10:09,717 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:10:09,719 INFO L256 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 101 conjunts are in the unsatisfiable core [2019-09-10 02:10:09,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:10:09,752 INFO L134 CoverageAnalysis]: Checked inductivity of 8100 backedges. 0 proven. 8100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:10:09,752 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:10:13,135 INFO L134 CoverageAnalysis]: Checked inductivity of 8100 backedges. 0 proven. 8100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:10:13,138 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:10:13,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102, 102, 102] total 102 [2019-09-10 02:10:13,138 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:10:13,138 INFO L454 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-09-10 02:10:13,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-09-10 02:10:13,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:10:13,140 INFO L87 Difference]: Start difference. First operand 208 states and 209 transitions. Second operand 102 states. [2019-09-10 02:10:13,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:10:13,693 INFO L93 Difference]: Finished difference Result 210 states and 211 transitions. [2019-09-10 02:10:13,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-09-10 02:10:13,693 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 207 [2019-09-10 02:10:13,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:10:13,695 INFO L225 Difference]: With dead ends: 210 [2019-09-10 02:10:13,695 INFO L226 Difference]: Without dead ends: 210 [2019-09-10 02:10:13,695 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 515 GetRequests, 315 SyntacticMatches, 100 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4950 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 02:10:13,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-09-10 02:10:13,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2019-09-10 02:10:13,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-09-10 02:10:13,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 211 transitions. [2019-09-10 02:10:13,698 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 211 transitions. Word has length 207 [2019-09-10 02:10:13,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:10:13,698 INFO L475 AbstractCegarLoop]: Abstraction has 210 states and 211 transitions. [2019-09-10 02:10:13,698 INFO L476 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-09-10 02:10:13,698 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 211 transitions. [2019-09-10 02:10:13,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-09-10 02:10:13,699 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:10:13,699 INFO L399 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-09-10 02:10:13,699 INFO L418 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:10:13,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:10:13,700 INFO L82 PathProgramCache]: Analyzing trace with hash -1604761220, now seen corresponding path program 70 times [2019-09-10 02:10:13,700 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:10:13,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:10:13,700 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:10:13,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:10:13,701 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:10:13,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:10:15,599 INFO L134 CoverageAnalysis]: Checked inductivity of 8281 backedges. 0 proven. 6559 refuted. 0 times theorem prover too weak. 1722 trivial. 0 not checked. [2019-09-10 02:10:15,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:10:15,600 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:10:15,600 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:10:15,600 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:10:15,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:10:15,600 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:10:15,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:10:15,612 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:10:15,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:10:15,682 INFO L256 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 108 conjunts are in the unsatisfiable core [2019-09-10 02:10:15,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:10:15,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:10:15,895 INFO L134 CoverageAnalysis]: Checked inductivity of 8281 backedges. 0 proven. 6559 refuted. 0 times theorem prover too weak. 1722 trivial. 0 not checked. [2019-09-10 02:10:15,895 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:10:16,041 INFO L134 CoverageAnalysis]: Checked inductivity of 8281 backedges. 0 proven. 6559 refuted. 0 times theorem prover too weak. 1722 trivial. 0 not checked. [2019-09-10 02:10:16,044 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:10:16,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 55 [2019-09-10 02:10:16,045 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:10:16,045 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-09-10 02:10:16,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-09-10 02:10:16,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=2862, Unknown=0, NotChecked=0, Total=2970 [2019-09-10 02:10:16,046 INFO L87 Difference]: Start difference. First operand 210 states and 211 transitions. Second operand 55 states. [2019-09-10 02:10:17,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:10:17,898 INFO L93 Difference]: Finished difference Result 214 states and 215 transitions. [2019-09-10 02:10:17,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-09-10 02:10:17,899 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 209 [2019-09-10 02:10:17,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:10:17,900 INFO L225 Difference]: With dead ends: 214 [2019-09-10 02:10:17,900 INFO L226 Difference]: Without dead ends: 213 [2019-09-10 02:10:17,901 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 472 GetRequests, 416 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=113, Invalid=2967, Unknown=0, NotChecked=0, Total=3080 [2019-09-10 02:10:17,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-09-10 02:10:17,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 212. [2019-09-10 02:10:17,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-09-10 02:10:17,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 213 transitions. [2019-09-10 02:10:17,903 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 213 transitions. Word has length 209 [2019-09-10 02:10:17,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:10:17,904 INFO L475 AbstractCegarLoop]: Abstraction has 212 states and 213 transitions. [2019-09-10 02:10:17,904 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-09-10 02:10:17,904 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 213 transitions. [2019-09-10 02:10:17,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-09-10 02:10:17,905 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:10:17,905 INFO L399 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-09-10 02:10:17,905 INFO L418 AbstractCegarLoop]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:10:17,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:10:17,906 INFO L82 PathProgramCache]: Analyzing trace with hash -289811498, now seen corresponding path program 71 times [2019-09-10 02:10:17,906 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:10:17,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:10:17,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:10:17,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:10:17,907 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:10:17,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:10:19,027 INFO L134 CoverageAnalysis]: Checked inductivity of 8464 backedges. 6742 proven. 0 refuted. 0 times theorem prover too weak. 1722 trivial. 0 not checked. [2019-09-10 02:10:19,027 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:10:19,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2019-09-10 02:10:19,028 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:10:19,028 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-09-10 02:10:19,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-09-10 02:10:19,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 02:10:19,029 INFO L87 Difference]: Start difference. First operand 212 states and 213 transitions. Second operand 52 states. [2019-09-10 02:10:19,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:10:19,260 INFO L93 Difference]: Finished difference Result 207 states and 207 transitions. [2019-09-10 02:10:19,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-10 02:10:19,260 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 211 [2019-09-10 02:10:19,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:10:19,260 INFO L225 Difference]: With dead ends: 207 [2019-09-10 02:10:19,261 INFO L226 Difference]: Without dead ends: 0 [2019-09-10 02:10:19,261 INFO L628 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-09-10 02:10:19,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-10 02:10:19,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-10 02:10:19,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-10 02:10:19,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-10 02:10:19,262 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 211 [2019-09-10 02:10:19,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:10:19,262 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-10 02:10:19,262 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-09-10 02:10:19,262 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-10 02:10:19,262 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-10 02:10:19,267 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 02:10:19 BoogieIcfgContainer [2019-09-10 02:10:19,267 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-10 02:10:19,270 INFO L168 Benchmark]: Toolchain (without parser) took 254449.99 ms. Allocated memory was 135.8 MB in the beginning and 410.0 MB in the end (delta: 274.2 MB). Free memory was 90.6 MB in the beginning and 251.1 MB in the end (delta: -160.5 MB). Peak memory consumption was 113.7 MB. Max. memory is 7.1 GB. [2019-09-10 02:10:19,270 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 135.8 MB. Free memory is still 108.7 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-09-10 02:10:19,271 INFO L168 Benchmark]: CACSL2BoogieTranslator took 378.37 ms. Allocated memory was 135.8 MB in the beginning and 201.9 MB in the end (delta: 66.1 MB). Free memory was 90.6 MB in the beginning and 178.8 MB in the end (delta: -88.2 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. [2019-09-10 02:10:19,272 INFO L168 Benchmark]: Boogie Preprocessor took 33.22 ms. Allocated memory is still 201.9 MB. Free memory was 178.8 MB in the beginning and 177.1 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-09-10 02:10:19,276 INFO L168 Benchmark]: RCFGBuilder took 362.73 ms. Allocated memory is still 201.9 MB. Free memory was 177.1 MB in the beginning and 160.4 MB in the end (delta: 16.7 MB). Peak memory consumption was 16.7 MB. Max. memory is 7.1 GB. [2019-09-10 02:10:19,277 INFO L168 Benchmark]: TraceAbstraction took 253671.13 ms. Allocated memory was 201.9 MB in the beginning and 410.0 MB in the end (delta: 208.1 MB). Free memory was 160.4 MB in the beginning and 251.1 MB in the end (delta: -90.7 MB). Peak memory consumption was 117.4 MB. Max. memory is 7.1 GB. [2019-09-10 02:10:19,285 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.23 ms. Allocated memory is still 135.8 MB. Free memory is still 108.7 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 378.37 ms. Allocated memory was 135.8 MB in the beginning and 201.9 MB in the end (delta: 66.1 MB). Free memory was 90.6 MB in the beginning and 178.8 MB in the end (delta: -88.2 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 33.22 ms. Allocated memory is still 201.9 MB. Free memory was 178.8 MB in the beginning and 177.1 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 362.73 ms. Allocated memory is still 201.9 MB. Free memory was 177.1 MB in the beginning and 160.4 MB in the end (delta: 16.7 MB). Peak memory consumption was 16.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 253671.13 ms. Allocated memory was 201.9 MB in the beginning and 410.0 MB in the end (delta: 208.1 MB). Free memory was 160.4 MB in the beginning and 251.1 MB in the end (delta: -90.7 MB). Peak memory consumption was 117.4 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, 253.6s OverallTime, 78 OverallIterations, 92 TraceHistogramMax, 24.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 887 SDtfs, 3733 SDslu, 20443 SDs, 0 SdLazy, 22178 SolverSat, 3573 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 22516 GetRequests, 15301 SyntacticMatches, 2196 SemanticMatches, 5019 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95103 ImplicationChecksByTransitivity, 214.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=212occurred in iteration=77, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 78 MinimizatonAttempts, 39 StatesRemovedByMinimization, 39 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 4.5s SatisfiabilityAnalysisTime, 220.5s InterpolantComputationTime, 18978 NumberOfCodeBlocks, 18662 NumberOfCodeBlocksAsserted, 1209 NumberOfCheckSat, 28048 ConstructedInterpolants, 0 QuantifiedInterpolants, 11277004 SizeOfPredicates, 59 NumberOfNonLiveVariables, 22348 ConjunctsInSsa, 3387 ConjunctsInUnsatCore, 218 InterpolantComputations, 8 PerfectInterpolantSequences, 188491/718694 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...