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-0883e75 [2019-09-05 13:02:03,822 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-05 13:02:03,824 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-05 13:02:03,836 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-05 13:02:03,837 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-05 13:02:03,838 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-05 13:02:03,839 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-05 13:02:03,841 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-05 13:02:03,843 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-05 13:02:03,843 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-05 13:02:03,844 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-05 13:02:03,846 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-05 13:02:03,846 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-05 13:02:03,847 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-05 13:02:03,848 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-05 13:02:03,849 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-05 13:02:03,850 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-05 13:02:03,851 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-05 13:02:03,853 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-05 13:02:03,855 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-05 13:02:03,856 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-05 13:02:03,857 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-05 13:02:03,859 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-05 13:02:03,859 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-05 13:02:03,862 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-05 13:02:03,862 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-05 13:02:03,862 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-05 13:02:03,863 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-05 13:02:03,863 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-05 13:02:03,864 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-05 13:02:03,865 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-05 13:02:03,865 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-05 13:02:03,866 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-05 13:02:03,867 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-05 13:02:03,868 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-05 13:02:03,868 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-05 13:02:03,869 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-05 13:02:03,869 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-05 13:02:03,869 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-05 13:02:03,870 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-05 13:02:03,871 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-05 13:02:03,872 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-05 13:02:03,888 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-05 13:02:03,890 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-05 13:02:03,891 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-05 13:02:03,891 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-05 13:02:03,892 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-05 13:02:03,892 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-05 13:02:03,892 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-05 13:02:03,893 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-05 13:02:03,893 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-05 13:02:03,893 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-05 13:02:03,894 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-05 13:02:03,894 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-05 13:02:03,894 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-05 13:02:03,894 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-05 13:02:03,894 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-05 13:02:03,895 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-05 13:02:03,895 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-05 13:02:03,895 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-05 13:02:03,895 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-05 13:02:03,895 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-05 13:02:03,896 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-05 13:02:03,896 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-05 13:02:03,896 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-05 13:02:03,898 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-05 13:02:03,898 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-05 13:02:03,898 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-05 13:02:03,898 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-05 13:02:03,898 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-05 13:02:03,899 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-05 13:02:03,899 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-05 13:02:03,935 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-05 13:02:03,952 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-05 13:02:03,955 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-05 13:02:03,956 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-05 13:02:03,957 INFO L275 PluginConnector]: CDTParser initialized [2019-09-05 13:02:03,957 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-05 13:02:04,018 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a3d6b6a9/bffa501bb85049fa8e6b71304fe852e6/FLAGa42a0c9e5 [2019-09-05 13:02:04,449 INFO L306 CDTParser]: Found 1 translation units. [2019-09-05 13:02:04,450 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gj2007.c.i.p+lhb-reducer.c [2019-09-05 13:02:04,459 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a3d6b6a9/bffa501bb85049fa8e6b71304fe852e6/FLAGa42a0c9e5 [2019-09-05 13:02:04,812 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a3d6b6a9/bffa501bb85049fa8e6b71304fe852e6 [2019-09-05 13:02:04,823 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-05 13:02:04,825 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-05 13:02:04,829 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-05 13:02:04,830 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-05 13:02:04,833 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-05 13:02:04,834 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 01:02:04" (1/1) ... [2019-09-05 13:02:04,838 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bece2f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:02:04, skipping insertion in model container [2019-09-05 13:02:04,838 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 01:02:04" (1/1) ... [2019-09-05 13:02:04,846 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-05 13:02:04,871 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-05 13:02:05,054 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 13:02:05,060 INFO L188 MainTranslator]: Completed pre-run [2019-09-05 13:02:05,093 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 13:02:05,121 INFO L192 MainTranslator]: Completed translation [2019-09-05 13:02:05,123 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:02:05 WrapperNode [2019-09-05 13:02:05,124 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-05 13:02:05,126 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-05 13:02:05,126 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-05 13:02:05,126 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-05 13:02:05,232 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:02:05" (1/1) ... [2019-09-05 13:02:05,233 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:02:05" (1/1) ... [2019-09-05 13:02:05,239 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:02:05" (1/1) ... [2019-09-05 13:02:05,239 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:02:05" (1/1) ... [2019-09-05 13:02:05,244 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:02:05" (1/1) ... [2019-09-05 13:02:05,249 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:02:05" (1/1) ... [2019-09-05 13:02:05,250 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:02:05" (1/1) ... [2019-09-05 13:02:05,258 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-05 13:02:05,259 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-05 13:02:05,259 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-05 13:02:05,259 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-05 13:02:05,263 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:02: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-05 13:02:05,323 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-05 13:02:05,324 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-05 13:02:05,324 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-05 13:02:05,324 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-05 13:02:05,324 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-05 13:02:05,324 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-05 13:02:05,324 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-05 13:02:05,324 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-05 13:02:05,324 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-05 13:02:05,325 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-05 13:02:05,605 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-05 13:02:05,606 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-05 13:02:05,607 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 01:02:05 BoogieIcfgContainer [2019-09-05 13:02:05,610 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-05 13:02:05,611 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-05 13:02:05,611 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-05 13:02:05,614 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-05 13:02:05,615 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.09 01:02:04" (1/3) ... [2019-09-05 13:02:05,616 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b4d3871 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 01:02:05, skipping insertion in model container [2019-09-05 13:02:05,616 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:02:05" (2/3) ... [2019-09-05 13:02:05,616 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b4d3871 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 01:02:05, skipping insertion in model container [2019-09-05 13:02:05,616 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 01:02:05" (3/3) ... [2019-09-05 13:02:05,618 INFO L109 eAbstractionObserver]: Analyzing ICFG gj2007.c.i.p+lhb-reducer.c [2019-09-05 13:02:05,629 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-05 13:02:05,638 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-05 13:02:05,659 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-05 13:02:05,695 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-05 13:02:05,695 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-05 13:02:05,695 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-05 13:02:05,695 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-05 13:02:05,695 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-05 13:02:05,696 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-05 13:02:05,696 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-05 13:02:05,696 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-05 13:02:05,708 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2019-09-05 13:02:05,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-05 13:02:05,718 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:02:05,719 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-05 13:02:05,720 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:02:05,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:02:05,725 INFO L82 PathProgramCache]: Analyzing trace with hash -535062244, now seen corresponding path program 1 times [2019-09-05 13:02:05,727 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:02:05,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:05,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:02:05,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:05,768 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:02:05,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:05,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:02:05,926 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:02:05,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-05 13:02:05,927 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:02:05,931 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-05 13:02:05,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-05 13:02:05,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-05 13:02:05,945 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 3 states. [2019-09-05 13:02:06,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:02:06,168 INFO L93 Difference]: Finished difference Result 51 states and 79 transitions. [2019-09-05 13:02:06,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-05 13:02:06,170 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-09-05 13:02:06,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:02:06,181 INFO L225 Difference]: With dead ends: 51 [2019-09-05 13:02:06,181 INFO L226 Difference]: Without dead ends: 47 [2019-09-05 13:02:06,183 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-05 13:02:06,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-09-05 13:02:06,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-09-05 13:02:06,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-09-05 13:02:06,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 58 transitions. [2019-09-05 13:02:06,226 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 58 transitions. Word has length 27 [2019-09-05 13:02:06,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:02:06,227 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 58 transitions. [2019-09-05 13:02:06,227 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-05 13:02:06,227 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 58 transitions. [2019-09-05 13:02:06,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-05 13:02:06,229 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:02:06,229 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-05 13:02:06,229 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:02:06,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:02:06,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1447563500, now seen corresponding path program 1 times [2019-09-05 13:02:06,230 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:02:06,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:06,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:02:06,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:06,232 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:02:06,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:06,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:02:06,332 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:02:06,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-05 13:02:06,333 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:02:06,337 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 13:02:06,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 13:02:06,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-05 13:02:06,338 INFO L87 Difference]: Start difference. First operand 47 states and 58 transitions. Second operand 5 states. [2019-09-05 13:02:06,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:02:06,465 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2019-09-05 13:02:06,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-05 13:02:06,466 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-09-05 13:02:06,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:02:06,467 INFO L225 Difference]: With dead ends: 41 [2019-09-05 13:02:06,467 INFO L226 Difference]: Without dead ends: 41 [2019-09-05 13:02:06,469 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-05 13:02:06,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-09-05 13:02:06,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-09-05 13:02:06,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-09-05 13:02:06,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2019-09-05 13:02:06,480 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 27 [2019-09-05 13:02:06,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:02:06,481 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2019-09-05 13:02:06,481 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 13:02:06,482 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2019-09-05 13:02:06,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-05 13:02:06,483 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:02:06,483 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-05 13:02:06,484 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:02:06,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:02:06,484 INFO L82 PathProgramCache]: Analyzing trace with hash -646102720, now seen corresponding path program 1 times [2019-09-05 13:02:06,484 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:02:06,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:06,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:02:06,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:06,488 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:02:06,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:06,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:02:06,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:02:06,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-05 13:02:06,606 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:02:06,606 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-05 13:02:06,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-05 13:02:06,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-05 13:02:06,607 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand 7 states. [2019-09-05 13:02:06,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:02:06,734 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2019-09-05 13:02:06,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-05 13:02:06,735 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2019-09-05 13:02:06,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:02:06,736 INFO L225 Difference]: With dead ends: 37 [2019-09-05 13:02:06,736 INFO L226 Difference]: Without dead ends: 37 [2019-09-05 13:02:06,737 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-05 13:02:06,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-09-05 13:02:06,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-09-05 13:02:06,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-09-05 13:02:06,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2019-09-05 13:02:06,743 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 27 [2019-09-05 13:02:06,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:02:06,743 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2019-09-05 13:02:06,744 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-05 13:02:06,744 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2019-09-05 13:02:06,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-05 13:02:06,745 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:02:06,745 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-05 13:02:06,746 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:02:06,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:02:06,746 INFO L82 PathProgramCache]: Analyzing trace with hash 2117052275, now seen corresponding path program 1 times [2019-09-05 13:02:06,746 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:02:06,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:06,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:02:06,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:06,748 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:02:06,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:06,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-05 13:02:06,855 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:02:06,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-05 13:02:06,855 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:02:06,855 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-05 13:02:06,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-05 13:02:06,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-05 13:02:06,856 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand 10 states. [2019-09-05 13:02:06,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:02:06,993 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2019-09-05 13:02:06,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-05 13:02:06,993 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2019-09-05 13:02:06,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:02:06,994 INFO L225 Difference]: With dead ends: 31 [2019-09-05 13:02:06,994 INFO L226 Difference]: Without dead ends: 31 [2019-09-05 13:02:06,995 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-05 13:02:06,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-09-05 13:02:06,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-09-05 13:02:06,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-05 13:02:06,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2019-09-05 13:02:06,999 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 27 [2019-09-05 13:02:06,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:02:07,000 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2019-09-05 13:02:07,000 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-05 13:02:07,000 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2019-09-05 13:02:07,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-05 13:02:07,001 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:02:07,001 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-05 13:02:07,001 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:02:07,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:02:07,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1286240867, now seen corresponding path program 1 times [2019-09-05 13:02:07,002 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:02:07,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:07,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:02:07,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:07,003 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:02:07,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:07,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:02:07,034 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:02:07,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-05 13:02:07,034 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:02:07,034 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-05 13:02:07,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-05 13:02:07,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-05 13:02:07,035 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 3 states. [2019-09-05 13:02:07,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:02:07,074 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2019-09-05 13:02:07,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-05 13:02:07,075 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-09-05 13:02:07,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:02:07,076 INFO L225 Difference]: With dead ends: 31 [2019-09-05 13:02:07,076 INFO L226 Difference]: Without dead ends: 31 [2019-09-05 13:02:07,077 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-05 13:02:07,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-09-05 13:02:07,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-09-05 13:02:07,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-05 13:02:07,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2019-09-05 13:02:07,080 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 27 [2019-09-05 13:02:07,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:02:07,081 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2019-09-05 13:02:07,081 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-05 13:02:07,081 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2019-09-05 13:02:07,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-05 13:02:07,082 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:02:07,082 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-05 13:02:07,082 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:02:07,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:02:07,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1286806896, now seen corresponding path program 1 times [2019-09-05 13:02:07,083 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:02:07,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:07,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:02:07,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:07,084 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:02:07,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:07,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:02:07,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:02:07,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-05 13:02:07,213 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:02:07,214 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-05 13:02:07,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-05 13:02:07,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-05 13:02:07,215 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 11 states. [2019-09-05 13:02:07,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:02:07,320 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2019-09-05 13:02:07,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-05 13:02:07,320 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2019-09-05 13:02:07,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:02:07,321 INFO L225 Difference]: With dead ends: 31 [2019-09-05 13:02:07,321 INFO L226 Difference]: Without dead ends: 31 [2019-09-05 13:02:07,322 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-05 13:02:07,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-09-05 13:02:07,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-09-05 13:02:07,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-05 13:02:07,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2019-09-05 13:02:07,329 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 27 [2019-09-05 13:02:07,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:02:07,330 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2019-09-05 13:02:07,330 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-05 13:02:07,330 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2019-09-05 13:02:07,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-05 13:02:07,332 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:02:07,332 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-05 13:02:07,333 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:02:07,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:02:07,333 INFO L82 PathProgramCache]: Analyzing trace with hash -880646403, now seen corresponding path program 1 times [2019-09-05 13:02:07,333 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:02:07,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:07,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:02:07,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:07,339 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:02:07,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:07,476 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-05 13:02:07,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:02:07,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-05 13:02:07,477 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:02:07,480 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-05 13:02:07,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-05 13:02:07,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-05 13:02:07,481 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 12 states. [2019-09-05 13:02:07,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:02:07,609 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2019-09-05 13:02:07,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-05 13:02:07,609 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 29 [2019-09-05 13:02:07,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:02:07,610 INFO L225 Difference]: With dead ends: 33 [2019-09-05 13:02:07,610 INFO L226 Difference]: Without dead ends: 33 [2019-09-05 13:02:07,611 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-05 13:02:07,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-09-05 13:02:07,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-09-05 13:02:07,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-05 13:02:07,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2019-09-05 13:02:07,615 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 29 [2019-09-05 13:02:07,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:02:07,615 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2019-09-05 13:02:07,615 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-05 13:02:07,615 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2019-09-05 13:02:07,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-05 13:02:07,616 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:02:07,616 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-05 13:02:07,616 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:02:07,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:02:07,617 INFO L82 PathProgramCache]: Analyzing trace with hash -286061766, now seen corresponding path program 1 times [2019-09-05 13:02:07,617 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:02:07,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:07,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:02:07,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:07,618 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:02:07,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:07,779 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-05 13:02:07,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:07,780 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:02:07,781 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 32 with the following transitions: [2019-09-05 13:02:07,784 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-05 13:02:07,829 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-05 13:02:07,829 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-05 13:02:08,012 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-05 13:02:08,014 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-05 13:02:08,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:02:08,018 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-05 13:02:08,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:08,019 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:02:08,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:02:08,030 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:02:08,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:08,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-05 13:02:08,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:02:08,139 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-05 13:02:08,139 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:02:08,437 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-05 13:02:08,444 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:02:08,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 24 [2019-09-05 13:02:08,445 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:02:08,445 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-05 13:02:08,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-05 13:02:08,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-09-05 13:02:08,446 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 13 states. [2019-09-05 13:02:08,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:02:08,586 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2019-09-05 13:02:08,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-05 13:02:08,587 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 31 [2019-09-05 13:02:08,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:02:08,588 INFO L225 Difference]: With dead ends: 35 [2019-09-05 13:02:08,588 INFO L226 Difference]: Without dead ends: 35 [2019-09-05 13:02:08,589 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-05 13:02:08,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-09-05 13:02:08,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-09-05 13:02:08,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-09-05 13:02:08,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2019-09-05 13:02:08,598 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 31 [2019-09-05 13:02:08,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:02:08,598 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2019-09-05 13:02:08,598 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-05 13:02:08,599 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2019-09-05 13:02:08,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-05 13:02:08,599 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:02:08,599 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-05 13:02:08,600 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:02:08,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:02:08,600 INFO L82 PathProgramCache]: Analyzing trace with hash -120875977, now seen corresponding path program 2 times [2019-09-05 13:02:08,602 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:02:08,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:08,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:02:08,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:08,604 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:02:08,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:08,755 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-05 13:02:08,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:08,755 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:02:08,756 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:02:08,756 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:02:08,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:08,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 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:02:08,783 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:02:08,784 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 13:02:08,801 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-05 13:02:08,802 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:02:08,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-05 13:02:08,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:02:09,026 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:02:09,026 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:02:09,412 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:02:09,415 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:02:09,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 38 [2019-09-05 13:02:09,416 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:02:09,416 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-05 13:02:09,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-05 13:02:09,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-09-05 13:02:09,418 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 26 states. [2019-09-05 13:02:09,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:02:09,606 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2019-09-05 13:02:09,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-05 13:02:09,607 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 33 [2019-09-05 13:02:09,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:02:09,608 INFO L225 Difference]: With dead ends: 59 [2019-09-05 13:02:09,608 INFO L226 Difference]: Without dead ends: 59 [2019-09-05 13:02:09,609 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-09-05 13:02:09,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-09-05 13:02:09,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2019-09-05 13:02:09,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-09-05 13:02:09,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2019-09-05 13:02:09,614 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 33 [2019-09-05 13:02:09,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:02:09,615 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2019-09-05 13:02:09,615 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-05 13:02:09,615 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2019-09-05 13:02:09,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-05 13:02:09,616 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:02:09,616 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-05 13:02:09,617 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:02:09,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:02:09,617 INFO L82 PathProgramCache]: Analyzing trace with hash -1917273006, now seen corresponding path program 3 times [2019-09-05 13:02:09,617 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:02:09,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:09,618 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:02:09,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:09,619 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:02:09,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:09,758 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-05 13:02:09,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:09,759 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:02:09,759 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:02:09,759 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:02:09,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:09,759 INFO 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-05 13:02:09,769 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:02:09,770 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 13:02:09,794 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:02:09,795 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:02:09,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-05 13:02:09,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:02:09,811 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-05 13:02:09,811 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:02:10,081 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-05 13:02:10,085 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:02:10,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 28 [2019-09-05 13:02:10,085 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:02:10,086 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-05 13:02:10,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-05 13:02:10,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-09-05 13:02:10,087 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand 15 states. [2019-09-05 13:02:10,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:02:10,218 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2019-09-05 13:02:10,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-05 13:02:10,220 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 57 [2019-09-05 13:02:10,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:02:10,220 INFO L225 Difference]: With dead ends: 60 [2019-09-05 13:02:10,221 INFO L226 Difference]: Without dead ends: 60 [2019-09-05 13:02:10,221 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-05 13:02:10,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-09-05 13:02:10,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-09-05 13:02:10,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-09-05 13:02:10,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2019-09-05 13:02:10,226 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 57 [2019-09-05 13:02:10,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:02:10,226 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2019-09-05 13:02:10,226 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-05 13:02:10,235 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2019-09-05 13:02:10,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-05 13:02:10,242 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:02:10,242 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-05 13:02:10,243 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:02:10,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:02:10,243 INFO L82 PathProgramCache]: Analyzing trace with hash 798282511, now seen corresponding path program 4 times [2019-09-05 13:02:10,245 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:02:10,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:10,246 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:02:10,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:10,246 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:02:10,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:10,381 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-05 13:02:10,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:10,381 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:02:10,381 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:02:10,381 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:02:10,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:10,381 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:02:10,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:02:10,392 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:02:10,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:10,431 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-05 13:02:10,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:02:10,446 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-05 13:02:10,446 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:02:10,745 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-05 13:02:10,748 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:02:10,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 30 [2019-09-05 13:02:10,749 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:02:10,749 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-05 13:02:10,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-05 13:02:10,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-09-05 13:02:10,751 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 16 states. [2019-09-05 13:02:10,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:02:10,885 INFO L93 Difference]: Finished difference Result 62 states and 63 transitions. [2019-09-05 13:02:10,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-05 13:02:10,886 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 59 [2019-09-05 13:02:10,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:02:10,887 INFO L225 Difference]: With dead ends: 62 [2019-09-05 13:02:10,887 INFO L226 Difference]: Without dead ends: 62 [2019-09-05 13:02:10,887 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-09-05 13:02:10,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-09-05 13:02:10,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-09-05 13:02:10,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-09-05 13:02:10,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2019-09-05 13:02:10,892 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 59 [2019-09-05 13:02:10,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:02:10,892 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2019-09-05 13:02:10,892 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-05 13:02:10,892 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2019-09-05 13:02:10,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-05 13:02:10,893 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:02:10,894 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-05 13:02:10,894 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:02:10,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:02:10,894 INFO L82 PathProgramCache]: Analyzing trace with hash -892981620, now seen corresponding path program 5 times [2019-09-05 13:02:10,894 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:02:10,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:10,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:02:10,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:10,896 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:02:10,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:11,034 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-05 13:02:11,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:11,034 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:02:11,034 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:02:11,035 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:02:11,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:11,035 INFO 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-05 13:02:11,049 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:02:11,049 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 13:02:11,085 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-09-05 13:02:11,085 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:02:11,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-05 13:02:11,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:02:11,104 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-05 13:02:11,104 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:02:11,471 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 138 proven. 30 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (6)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 13:02:11,474 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:02:11,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 32 [2019-09-05 13:02:11,475 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:02:11,475 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-05 13:02:11,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-05 13:02:11,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-09-05 13:02:11,476 INFO L87 Difference]: Start difference. First operand 62 states and 63 transitions. Second operand 17 states. [2019-09-05 13:02:11,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:02:11,613 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2019-09-05 13:02:11,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-05 13:02:11,613 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 61 [2019-09-05 13:02:11,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:02:11,614 INFO L225 Difference]: With dead ends: 64 [2019-09-05 13:02:11,614 INFO L226 Difference]: Without dead ends: 64 [2019-09-05 13:02:11,614 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-05 13:02:11,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-09-05 13:02:11,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-09-05 13:02:11,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-09-05 13:02:11,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2019-09-05 13:02:11,620 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 61 [2019-09-05 13:02:11,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:02:11,620 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2019-09-05 13:02:11,620 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-05 13:02:11,620 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2019-09-05 13:02:11,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-05 13:02:11,621 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:02:11,621 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-05 13:02:11,622 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:02:11,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:02:11,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1594793673, now seen corresponding path program 6 times [2019-09-05 13:02:11,622 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:02:11,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:11,623 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:02:11,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:11,623 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:02:11,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:11,822 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-05 13:02:11,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:11,822 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:02:11,823 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:02:11,823 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:02:11,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:11,823 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 13:02:11,844 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:02:11,844 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-05 13:02:11,874 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:02:11,875 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:02:11,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-05 13:02:11,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:02:11,897 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-05 13:02:11,897 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:02:12,246 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-05 13:02:12,249 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:02:12,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 34 [2019-09-05 13:02:12,250 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:02:12,250 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-05 13:02:12,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-05 13:02:12,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-09-05 13:02:12,251 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand 18 states. [2019-09-05 13:02:12,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:02:12,376 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2019-09-05 13:02:12,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-05 13:02:12,376 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 63 [2019-09-05 13:02:12,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:02:12,377 INFO L225 Difference]: With dead ends: 66 [2019-09-05 13:02:12,377 INFO L226 Difference]: Without dead ends: 66 [2019-09-05 13:02:12,378 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-05 13:02:12,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-09-05 13:02:12,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-09-05 13:02:12,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-09-05 13:02:12,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 67 transitions. [2019-09-05 13:02:12,382 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 67 transitions. Word has length 63 [2019-09-05 13:02:12,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:02:12,382 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 67 transitions. [2019-09-05 13:02:12,382 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-05 13:02:12,383 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 67 transitions. [2019-09-05 13:02:12,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-05 13:02:12,384 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:02:12,384 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-05 13:02:12,384 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:02:12,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:02:12,384 INFO L82 PathProgramCache]: Analyzing trace with hash 50066374, now seen corresponding path program 7 times [2019-09-05 13:02:12,385 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:02:12,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:12,385 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:02:12,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:12,386 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:02:12,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:12,591 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-05 13:02:12,591 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:12,591 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:02:12,591 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:02:12,592 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:02:12,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:12,592 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 13:02:12,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:02:12,614 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:02:12,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:12,639 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-05 13:02:12,642 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:02:12,653 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-05 13:02:12,653 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:02:13,037 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-05 13:02:13,040 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:02:13,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 36 [2019-09-05 13:02:13,041 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:02:13,041 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-05 13:02:13,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-05 13:02:13,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-09-05 13:02:13,042 INFO L87 Difference]: Start difference. First operand 66 states and 67 transitions. Second operand 19 states. [2019-09-05 13:02:13,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:02:13,178 INFO L93 Difference]: Finished difference Result 68 states and 69 transitions. [2019-09-05 13:02:13,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-05 13:02:13,179 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 65 [2019-09-05 13:02:13,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:02:13,180 INFO L225 Difference]: With dead ends: 68 [2019-09-05 13:02:13,180 INFO L226 Difference]: Without dead ends: 68 [2019-09-05 13:02:13,181 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-05 13:02:13,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-09-05 13:02:13,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-09-05 13:02:13,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-09-05 13:02:13,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2019-09-05 13:02:13,185 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 65 [2019-09-05 13:02:13,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:02:13,185 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2019-09-05 13:02:13,185 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-05 13:02:13,185 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2019-09-05 13:02:13,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-05 13:02:13,186 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:02:13,186 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-05 13:02:13,186 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:02:13,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:02:13,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1625816451, now seen corresponding path program 8 times [2019-09-05 13:02:13,187 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:02:13,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:13,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:02:13,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:13,188 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:02:13,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:13,358 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-05 13:02:13,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:13,359 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:02:13,359 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:02:13,359 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:02:13,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:13,359 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:02:13,369 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:02:13,370 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 13:02:13,418 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2019-09-05 13:02:13,418 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:02:13,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-05 13:02:13,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:02:13,432 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-05 13:02:13,432 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:02:13,932 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-05 13:02:13,938 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:02:13,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 38 [2019-09-05 13:02:13,939 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:02:13,939 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-05 13:02:13,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-05 13:02:13,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-09-05 13:02:13,940 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand 20 states. [2019-09-05 13:02:14,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:02:14,051 INFO L93 Difference]: Finished difference Result 70 states and 71 transitions. [2019-09-05 13:02:14,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-05 13:02:14,052 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 67 [2019-09-05 13:02:14,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:02:14,053 INFO L225 Difference]: With dead ends: 70 [2019-09-05 13:02:14,053 INFO L226 Difference]: Without dead ends: 70 [2019-09-05 13:02:14,054 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-09-05 13:02:14,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-09-05 13:02:14,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-09-05 13:02:14,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-09-05 13:02:14,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2019-09-05 13:02:14,058 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 67 [2019-09-05 13:02:14,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:02:14,058 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2019-09-05 13:02:14,058 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-05 13:02:14,058 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2019-09-05 13:02:14,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-05 13:02:14,060 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:02:14,060 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-05 13:02:14,060 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:02:14,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:02:14,061 INFO L82 PathProgramCache]: Analyzing trace with hash -201815040, now seen corresponding path program 9 times [2019-09-05 13:02:14,061 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:02:14,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:14,062 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:02:14,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:14,062 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:02:14,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:14,320 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-05 13:02:14,321 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:14,321 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:02:14,321 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:02:14,321 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:02:14,322 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:14,322 INFO 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-05 13:02:14,350 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:02:14,350 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 13:02:14,380 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:02:14,380 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:02:14,382 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-05 13:02:14,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:02:14,398 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-05 13:02:14,398 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:02:14,972 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-05 13:02:14,976 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:02:14,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 40 [2019-09-05 13:02:14,976 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:02:14,977 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-05 13:02:14,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-05 13:02:14,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-09-05 13:02:14,979 INFO L87 Difference]: Start difference. First operand 70 states and 71 transitions. Second operand 21 states. [2019-09-05 13:02:15,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:02:15,104 INFO L93 Difference]: Finished difference Result 72 states and 73 transitions. [2019-09-05 13:02:15,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-05 13:02:15,108 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 69 [2019-09-05 13:02:15,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:02:15,109 INFO L225 Difference]: With dead ends: 72 [2019-09-05 13:02:15,109 INFO L226 Difference]: Without dead ends: 72 [2019-09-05 13:02:15,110 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-05 13:02:15,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-09-05 13:02:15,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-09-05 13:02:15,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-09-05 13:02:15,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2019-09-05 13:02:15,123 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 69 [2019-09-05 13:02:15,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:02:15,123 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2019-09-05 13:02:15,124 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-05 13:02:15,124 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2019-09-05 13:02:15,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-05 13:02:15,127 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:02:15,127 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-05 13:02:15,128 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:02:15,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:02:15,128 INFO L82 PathProgramCache]: Analyzing trace with hash 85946173, now seen corresponding path program 10 times [2019-09-05 13:02:15,128 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:02:15,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:15,130 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:02:15,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:15,130 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:02:15,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:15,404 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-05 13:02:15,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:15,405 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:02:15,405 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:02:15,405 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:02:15,405 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:15,405 INFO 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) [2019-09-05 13:02:15,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:02:15,425 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:02:15,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:15,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-05 13:02:15,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:02:15,466 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-05 13:02:15,466 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:02:16,073 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 253 proven. 110 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (11)] Exception during sending of exit command (exit): Stream closed [2019-09-05 13:02:16,081 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:02:16,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 42 [2019-09-05 13:02:16,082 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:02:16,082 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-05 13:02:16,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-05 13:02:16,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-09-05 13:02:16,085 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand 22 states. [2019-09-05 13:02:16,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:02:16,212 INFO L93 Difference]: Finished difference Result 74 states and 75 transitions. [2019-09-05 13:02:16,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-05 13:02:16,213 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 71 [2019-09-05 13:02:16,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:02:16,214 INFO L225 Difference]: With dead ends: 74 [2019-09-05 13:02:16,214 INFO L226 Difference]: Without dead ends: 74 [2019-09-05 13:02:16,215 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-09-05 13:02:16,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-09-05 13:02:16,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-09-05 13:02:16,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-09-05 13:02:16,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 75 transitions. [2019-09-05 13:02:16,220 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 75 transitions. Word has length 71 [2019-09-05 13:02:16,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:02:16,224 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 75 transitions. [2019-09-05 13:02:16,225 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-05 13:02:16,225 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 75 transitions. [2019-09-05 13:02:16,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-05 13:02:16,225 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:02:16,226 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-05 13:02:16,226 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:02:16,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:02:16,226 INFO L82 PathProgramCache]: Analyzing trace with hash 1746564922, now seen corresponding path program 11 times [2019-09-05 13:02:16,227 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:02:16,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:16,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:02:16,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:16,228 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:02:16,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:16,503 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-05 13:02:16,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:16,503 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:02:16,503 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:02:16,504 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:02:16,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:16,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 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:02:16,528 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:02:16,528 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 13:02:16,573 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-09-05 13:02:16,573 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:02:16,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-05 13:02:16,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:02:16,592 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-05 13:02:16,592 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:02:17,254 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-05 13:02:17,258 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:02:17,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 44 [2019-09-05 13:02:17,258 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:02:17,259 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-05 13:02:17,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-05 13:02:17,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-09-05 13:02:17,260 INFO L87 Difference]: Start difference. First operand 74 states and 75 transitions. Second operand 23 states. [2019-09-05 13:02:17,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:02:17,400 INFO L93 Difference]: Finished difference Result 76 states and 77 transitions. [2019-09-05 13:02:17,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-05 13:02:17,401 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 73 [2019-09-05 13:02:17,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:02:17,402 INFO L225 Difference]: With dead ends: 76 [2019-09-05 13:02:17,402 INFO L226 Difference]: Without dead ends: 76 [2019-09-05 13:02:17,404 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-09-05 13:02:17,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-09-05 13:02:17,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-09-05 13:02:17,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-09-05 13:02:17,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 77 transitions. [2019-09-05 13:02:17,415 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 77 transitions. Word has length 73 [2019-09-05 13:02:17,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:02:17,416 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 77 transitions. [2019-09-05 13:02:17,416 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-05 13:02:17,416 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 77 transitions. [2019-09-05 13:02:17,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-05 13:02:17,417 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:02:17,417 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-05 13:02:17,418 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:02:17,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:02:17,418 INFO L82 PathProgramCache]: Analyzing trace with hash -126651401, now seen corresponding path program 12 times [2019-09-05 13:02:17,418 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:02:17,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:17,420 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:02:17,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:17,420 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:02:17,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:17,784 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-05 13:02:17,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:17,784 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:02:17,785 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:02:17,785 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:02:17,785 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:17,785 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:02:17,812 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:02:17,812 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 13:02:17,839 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:02:17,839 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:02:17,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-05 13:02:17,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:02:17,854 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-05 13:02:17,854 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:02:18,505 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-05 13:02:18,508 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:02:18,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 46 [2019-09-05 13:02:18,509 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:02:18,509 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-05 13:02:18,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-05 13:02:18,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-09-05 13:02:18,510 INFO L87 Difference]: Start difference. First operand 76 states and 77 transitions. Second operand 24 states. [2019-09-05 13:02:18,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:02:18,635 INFO L93 Difference]: Finished difference Result 78 states and 79 transitions. [2019-09-05 13:02:18,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-05 13:02:18,635 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 75 [2019-09-05 13:02:18,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:02:18,636 INFO L225 Difference]: With dead ends: 78 [2019-09-05 13:02:18,637 INFO L226 Difference]: Without dead ends: 78 [2019-09-05 13:02:18,638 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-09-05 13:02:18,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-09-05 13:02:18,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-09-05 13:02:18,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-09-05 13:02:18,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 79 transitions. [2019-09-05 13:02:18,641 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 79 transitions. Word has length 75 [2019-09-05 13:02:18,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:02:18,642 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 79 transitions. [2019-09-05 13:02:18,642 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-05 13:02:18,642 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2019-09-05 13:02:18,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-05 13:02:18,643 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:02:18,643 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-05 13:02:18,643 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:02:18,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:02:18,644 INFO L82 PathProgramCache]: Analyzing trace with hash -696240780, now seen corresponding path program 13 times [2019-09-05 13:02:18,644 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:02:18,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:18,645 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:02:18,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:18,645 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:02:18,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:18,906 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-05 13:02:18,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:18,906 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:02:18,907 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:02:18,907 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:02:18,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:18,907 INFO 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-05 13:02:18,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:02:18,917 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:02:18,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:18,944 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-05 13:02:18,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:02:18,956 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-05 13:02:18,956 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:02:19,540 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-05 13:02:19,543 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:02:19,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 48 [2019-09-05 13:02:19,543 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:02:19,543 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-05 13:02:19,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-05 13:02:19,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-09-05 13:02:19,545 INFO L87 Difference]: Start difference. First operand 78 states and 79 transitions. Second operand 25 states. [2019-09-05 13:02:19,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:02:19,699 INFO L93 Difference]: Finished difference Result 80 states and 81 transitions. [2019-09-05 13:02:19,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-05 13:02:19,699 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 77 [2019-09-05 13:02:19,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:02:19,700 INFO L225 Difference]: With dead ends: 80 [2019-09-05 13:02:19,701 INFO L226 Difference]: Without dead ends: 80 [2019-09-05 13:02:19,702 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-05 13:02:19,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-09-05 13:02:19,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-09-05 13:02:19,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-09-05 13:02:19,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 81 transitions. [2019-09-05 13:02:19,706 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 81 transitions. Word has length 77 [2019-09-05 13:02:19,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:02:19,706 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 81 transitions. [2019-09-05 13:02:19,706 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-05 13:02:19,707 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2019-09-05 13:02:19,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-05 13:02:19,707 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:02:19,709 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-05 13:02:19,709 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:02:19,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:02:19,710 INFO L82 PathProgramCache]: Analyzing trace with hash 1684179889, now seen corresponding path program 14 times [2019-09-05 13:02:19,710 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:02:19,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:19,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:02:19,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:19,711 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:02:19,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:20,033 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-05 13:02:20,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:20,033 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:02:20,033 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:02:20,033 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:02:20,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:20,034 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:02:20,048 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:02:20,048 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 13:02:20,115 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2019-09-05 13:02:20,116 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:02:20,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-05 13:02:20,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:02:20,400 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-05 13:02:20,400 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:02:20,812 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-05 13:02:20,815 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:02:20,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 15, 15] total 52 [2019-09-05 13:02:20,815 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:02:20,816 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-05 13:02:20,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-05 13:02:20,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-05 13:02:20,817 INFO L87 Difference]: Start difference. First operand 80 states and 81 transitions. Second operand 39 states. [2019-09-05 13:02:21,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:02:21,029 INFO L93 Difference]: Finished difference Result 85 states and 86 transitions. [2019-09-05 13:02:21,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-05 13:02:21,030 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 79 [2019-09-05 13:02:21,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:02:21,031 INFO L225 Difference]: With dead ends: 85 [2019-09-05 13:02:21,031 INFO L226 Difference]: Without dead ends: 85 [2019-09-05 13:02:21,032 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-05 13:02:21,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-09-05 13:02:21,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2019-09-05 13:02:21,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-09-05 13:02:21,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 85 transitions. [2019-09-05 13:02:21,034 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 85 transitions. Word has length 79 [2019-09-05 13:02:21,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:02:21,035 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 85 transitions. [2019-09-05 13:02:21,035 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-05 13:02:21,035 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 85 transitions. [2019-09-05 13:02:21,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-05 13:02:21,036 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:02:21,036 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-05 13:02:21,036 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:02:21,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:02:21,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1637764232, now seen corresponding path program 15 times [2019-09-05 13:02:21,037 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:02:21,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:21,038 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:02:21,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:21,038 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:02:21,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:21,326 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-05 13:02:21,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:21,327 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:02:21,327 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:02:21,327 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:02:21,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:21,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 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:02:21,337 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:02:21,337 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 13:02:21,360 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:02:21,360 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:02:21,361 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-05 13:02:21,362 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:02:21,372 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-05 13:02:21,373 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:02:22,026 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-05 13:02:22,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:02:22,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 52 [2019-09-05 13:02:22,030 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:02:22,030 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-05 13:02:22,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-05 13:02:22,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-05 13:02:22,032 INFO L87 Difference]: Start difference. First operand 84 states and 85 transitions. Second operand 27 states. [2019-09-05 13:02:22,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:02:22,194 INFO L93 Difference]: Finished difference Result 86 states and 87 transitions. [2019-09-05 13:02:22,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-05 13:02:22,202 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 83 [2019-09-05 13:02:22,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:02:22,203 INFO L225 Difference]: With dead ends: 86 [2019-09-05 13:02:22,203 INFO L226 Difference]: Without dead ends: 86 [2019-09-05 13:02:22,204 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-05 13:02:22,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-09-05 13:02:22,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-09-05 13:02:22,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-09-05 13:02:22,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 87 transitions. [2019-09-05 13:02:22,207 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 87 transitions. Word has length 83 [2019-09-05 13:02:22,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:02:22,207 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 87 transitions. [2019-09-05 13:02:22,207 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-05 13:02:22,207 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 87 transitions. [2019-09-05 13:02:22,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-05 13:02:22,208 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:02:22,208 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-05 13:02:22,209 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:02:22,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:02:22,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1891909893, now seen corresponding path program 16 times [2019-09-05 13:02:22,209 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:02:22,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:22,210 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:02:22,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:22,210 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:02:22,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02: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-05 13:02:22,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:22,504 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:02:22,504 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:02: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-05 13:02:22,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:22,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 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:02:22,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:02:22,515 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:02:22,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:22,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-05 13:02:22,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:02:22,563 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-05 13:02:22,563 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:02:23,358 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-05 13:02:23,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:02:23,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 52 [2019-09-05 13:02:23,362 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:02:23,362 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-05 13:02:23,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-05 13:02:23,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-05 13:02:23,364 INFO L87 Difference]: Start difference. First operand 86 states and 87 transitions. Second operand 28 states. [2019-09-05 13:02:23,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:02:23,538 INFO L93 Difference]: Finished difference Result 88 states and 89 transitions. [2019-09-05 13:02:23,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-05 13:02:23,539 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 85 [2019-09-05 13:02:23,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:02:23,540 INFO L225 Difference]: With dead ends: 88 [2019-09-05 13:02:23,540 INFO L226 Difference]: Without dead ends: 88 [2019-09-05 13:02:23,541 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 145 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-05 13:02:23,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-09-05 13:02:23,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-09-05 13:02:23,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-09-05 13:02:23,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 89 transitions. [2019-09-05 13:02:23,546 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 89 transitions. Word has length 85 [2019-09-05 13:02:23,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:02:23,546 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 89 transitions. [2019-09-05 13:02:23,546 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-05 13:02:23,547 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 89 transitions. [2019-09-05 13:02:23,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-05 13:02:23,548 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:02:23,548 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-05 13:02:23,548 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:02:23,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:02:23,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1312754242, now seen corresponding path program 17 times [2019-09-05 13:02:23,549 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:02:23,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:23,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:02:23,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:23,551 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:02:23,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:23,962 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-05 13:02:23,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:23,962 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:02:23,962 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:02:23,962 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:02:23,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:23,963 INFO 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-05 13:02:23,983 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:02:23,983 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-05 13:02:24,046 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2019-09-05 13:02:24,046 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:02:24,048 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-05 13:02:24,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:02:24,567 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-05 13:02:24,567 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:02:25,254 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-05 13:02:25,257 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:02:25,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 16, 16] total 57 [2019-09-05 13:02:25,258 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:02:25,258 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-05 13:02:25,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-05 13:02:25,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-09-05 13:02:25,259 INFO L87 Difference]: Start difference. First operand 88 states and 89 transitions. Second operand 43 states. [2019-09-05 13:02:25,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:02:25,479 INFO L93 Difference]: Finished difference Result 93 states and 94 transitions. [2019-09-05 13:02:25,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-05 13:02:25,480 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 87 [2019-09-05 13:02:25,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:02:25,481 INFO L225 Difference]: With dead ends: 93 [2019-09-05 13:02:25,481 INFO L226 Difference]: Without dead ends: 93 [2019-09-05 13:02:25,483 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-09-05 13:02:25,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-09-05 13:02:25,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2019-09-05 13:02:25,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-09-05 13:02:25,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 93 transitions. [2019-09-05 13:02:25,486 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 93 transitions. Word has length 87 [2019-09-05 13:02:25,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:02:25,487 INFO L475 AbstractCegarLoop]: Abstraction has 92 states and 93 transitions. [2019-09-05 13:02:25,487 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-05 13:02:25,487 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 93 transitions. [2019-09-05 13:02:25,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-05 13:02:25,487 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:02:25,488 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-05 13:02:25,488 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:02:25,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:02:25,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1585208793, now seen corresponding path program 18 times [2019-09-05 13:02:25,488 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:02:25,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:25,489 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:02:25,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:25,489 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:02:25,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:25,844 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-05 13:02:25,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:25,844 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:02:25,844 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:02:25,844 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:02:25,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:25,845 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:02:25,856 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:02:25,856 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 13:02:25,887 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:02:25,887 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:02:25,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-05 13:02:25,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:02:25,899 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-05 13:02:25,899 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:02:26,687 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-05 13:02:26,690 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:02:26,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 52 [2019-09-05 13:02:26,691 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:02:26,692 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-05 13:02:26,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-05 13:02:26,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-05 13:02:26,693 INFO L87 Difference]: Start difference. First operand 92 states and 93 transitions. Second operand 30 states. [2019-09-05 13:02:26,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:02:26,851 INFO L93 Difference]: Finished difference Result 94 states and 95 transitions. [2019-09-05 13:02:26,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-05 13:02:26,851 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 91 [2019-09-05 13:02:26,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:02:26,852 INFO L225 Difference]: With dead ends: 94 [2019-09-05 13:02:26,853 INFO L226 Difference]: Without dead ends: 94 [2019-09-05 13:02:26,853 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 155 SyntacticMatches, 6 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-05 13:02:26,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-09-05 13:02:26,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2019-09-05 13:02:26,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-09-05 13:02:26,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 95 transitions. [2019-09-05 13:02:26,857 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 95 transitions. Word has length 91 [2019-09-05 13:02:26,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:02:26,857 INFO L475 AbstractCegarLoop]: Abstraction has 94 states and 95 transitions. [2019-09-05 13:02:26,857 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-05 13:02:26,858 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 95 transitions. [2019-09-05 13:02:26,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-05 13:02:26,858 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:02:26,858 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-05 13:02:26,858 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:02:26,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:02:26,859 INFO L82 PathProgramCache]: Analyzing trace with hash 400065878, now seen corresponding path program 19 times [2019-09-05 13:02:26,859 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:02:26,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:26,859 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:02:26,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:26,859 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:02:26,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:27,231 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-05 13:02:27,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:27,231 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:02:27,232 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:02:27,232 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:02:27,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:27,232 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:02:27,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:02:27,244 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:02:27,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:27,275 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-05 13:02:27,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:02:27,289 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-05 13:02:27,289 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:02:28,039 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-05 13:02:28,042 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:02:28,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 52 [2019-09-05 13:02:28,043 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:02:28,043 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-05 13:02:28,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-05 13:02:28,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-05 13:02:28,044 INFO L87 Difference]: Start difference. First operand 94 states and 95 transitions. Second operand 31 states. [2019-09-05 13:02:28,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:02:28,193 INFO L93 Difference]: Finished difference Result 96 states and 97 transitions. [2019-09-05 13:02:28,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-05 13:02:28,193 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 93 [2019-09-05 13:02:28,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:02:28,195 INFO L225 Difference]: With dead ends: 96 [2019-09-05 13:02:28,195 INFO L226 Difference]: Without dead ends: 96 [2019-09-05 13:02:28,195 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 158 SyntacticMatches, 8 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-05 13:02:28,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-09-05 13:02:28,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-09-05 13:02:28,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-09-05 13:02:28,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 97 transitions. [2019-09-05 13:02:28,199 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 97 transitions. Word has length 93 [2019-09-05 13:02:28,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:02:28,199 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 97 transitions. [2019-09-05 13:02:28,199 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-05 13:02:28,199 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 97 transitions. [2019-09-05 13:02:28,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-05 13:02:28,200 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:02:28,200 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-05 13:02:28,200 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:02:28,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:02:28,201 INFO L82 PathProgramCache]: Analyzing trace with hash -355941997, now seen corresponding path program 20 times [2019-09-05 13:02:28,201 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:02:28,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:28,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:02:28,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:28,202 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:02:28,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:28,617 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-05 13:02:28,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:28,617 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:02:28,617 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:02:28,617 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:02:28,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:28,618 INFO 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-05 13:02:28,628 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:02:28,628 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 13:02:28,675 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2019-09-05 13:02:28,675 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:02:28,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-05 13:02:28,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:02:29,071 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-05 13:02:29,072 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:02:29,673 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-05 13:02:29,677 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:02:29,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 17, 17] total 62 [2019-09-05 13:02:29,677 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:02:29,678 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-05 13:02:29,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-05 13:02:29,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-09-05 13:02:29,678 INFO L87 Difference]: Start difference. First operand 96 states and 97 transitions. Second operand 47 states. [2019-09-05 13:02:29,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:02:29,948 INFO L93 Difference]: Finished difference Result 101 states and 102 transitions. [2019-09-05 13:02:29,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-05 13:02:29,949 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 95 [2019-09-05 13:02:29,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:02:29,950 INFO L225 Difference]: With dead ends: 101 [2019-09-05 13:02:29,951 INFO L226 Difference]: Without dead ends: 101 [2019-09-05 13:02:29,952 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-05 13:02:29,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-09-05 13:02:29,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2019-09-05 13:02:29,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-09-05 13:02:29,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 101 transitions. [2019-09-05 13:02:29,955 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 101 transitions. Word has length 95 [2019-09-05 13:02:29,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:02:29,956 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 101 transitions. [2019-09-05 13:02:29,956 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-05 13:02:29,956 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2019-09-05 13:02:29,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-05 13:02:29,957 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:02:29,957 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-05 13:02:29,958 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:02:29,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:02:29,958 INFO L82 PathProgramCache]: Analyzing trace with hash -2030471190, now seen corresponding path program 21 times [2019-09-05 13:02:29,958 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:02:29,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:29,959 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:02:29,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:29,960 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:02:29,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:30,409 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-05 13:02:30,409 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:30,409 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:02:30,409 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:02:30,409 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:02:30,409 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:30,409 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:02:30,419 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:02:30,420 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 13:02:30,454 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:02:30,454 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:02:30,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-05 13:02:30,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:02:30,471 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-05 13:02:30,471 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:02:31,220 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 638 proven. 462 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (22)] Exception during sending of exit command (exit): Stream closed [2019-09-05 13:02:31,223 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:02:31,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 52 [2019-09-05 13:02:31,223 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:02:31,225 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-05 13:02:31,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-05 13:02:31,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-05 13:02:31,226 INFO L87 Difference]: Start difference. First operand 100 states and 101 transitions. Second operand 33 states. [2019-09-05 13:02:31,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:02:31,406 INFO L93 Difference]: Finished difference Result 102 states and 103 transitions. [2019-09-05 13:02:31,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-05 13:02:31,407 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 99 [2019-09-05 13:02:31,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:02:31,408 INFO L225 Difference]: With dead ends: 102 [2019-09-05 13:02:31,409 INFO L226 Difference]: Without dead ends: 102 [2019-09-05 13:02:31,409 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 168 SyntacticMatches, 12 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-05 13:02:31,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-09-05 13:02:31,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-09-05 13:02:31,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-09-05 13:02:31,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 103 transitions. [2019-09-05 13:02:31,413 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 103 transitions. Word has length 99 [2019-09-05 13:02:31,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:02:31,414 INFO L475 AbstractCegarLoop]: Abstraction has 102 states and 103 transitions. [2019-09-05 13:02:31,414 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-05 13:02:31,414 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 103 transitions. [2019-09-05 13:02:31,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-05 13:02:31,415 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:02:31,415 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-05 13:02:31,415 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:02:31,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:02:31,415 INFO L82 PathProgramCache]: Analyzing trace with hash -156708249, now seen corresponding path program 22 times [2019-09-05 13:02:31,415 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:02:31,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:31,416 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:02:31,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:31,416 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:02:31,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:31,980 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-05 13:02:31,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:31,980 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:02:31,980 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:02:31,980 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:02:31,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:31,981 INFO 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) [2019-09-05 13:02:31,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:02:31,994 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:02:32,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:32,023 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-05 13:02:32,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:02:32,042 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-05 13:02:32,042 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:02:32,915 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-05 13:02:32,918 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:02:32,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 52 [2019-09-05 13:02:32,918 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:02:32,919 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-05 13:02:32,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-05 13:02:32,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-05 13:02:32,920 INFO L87 Difference]: Start difference. First operand 102 states and 103 transitions. Second operand 34 states. [2019-09-05 13:02:33,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:02:33,071 INFO L93 Difference]: Finished difference Result 104 states and 105 transitions. [2019-09-05 13:02:33,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-05 13:02:33,071 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 101 [2019-09-05 13:02:33,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:02:33,072 INFO L225 Difference]: With dead ends: 104 [2019-09-05 13:02:33,073 INFO L226 Difference]: Without dead ends: 104 [2019-09-05 13:02:33,075 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-05 13:02:33,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-09-05 13:02:33,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-09-05 13:02:33,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-09-05 13:02:33,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 105 transitions. [2019-09-05 13:02:33,079 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 105 transitions. Word has length 101 [2019-09-05 13:02:33,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:02:33,079 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 105 transitions. [2019-09-05 13:02:33,079 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-05 13:02:33,079 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 105 transitions. [2019-09-05 13:02:33,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-05 13:02:33,080 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:02:33,080 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-05 13:02:33,080 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:02:33,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:02:33,081 INFO L82 PathProgramCache]: Analyzing trace with hash 938181028, now seen corresponding path program 23 times [2019-09-05 13:02:33,081 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:02:33,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:33,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:02:33,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:33,082 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:02:33,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:33,570 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-05 13:02:33,571 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:33,571 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:02:33,571 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:02:33,571 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:02:33,571 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:33,571 INFO 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-05 13:02:33,583 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:02:33,583 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 13:02:33,628 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2019-09-05 13:02:33,628 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:02:33,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-05 13:02:33,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:02:34,069 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-05 13:02:34,069 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:02:34,760 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-05 13:02:34,763 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:02:34,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 18, 18] total 67 [2019-09-05 13:02:34,764 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:02:34,764 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-09-05 13:02:34,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-09-05 13:02:34,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-09-05 13:02:34,766 INFO L87 Difference]: Start difference. First operand 104 states and 105 transitions. Second operand 51 states. [2019-09-05 13:02:35,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:02:35,022 INFO L93 Difference]: Finished difference Result 109 states and 110 transitions. [2019-09-05 13:02:35,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-05 13:02:35,023 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 103 [2019-09-05 13:02:35,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:02:35,024 INFO L225 Difference]: With dead ends: 109 [2019-09-05 13:02:35,024 INFO L226 Difference]: Without dead ends: 109 [2019-09-05 13:02:35,025 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-05 13:02:35,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-09-05 13:02:35,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2019-09-05 13:02:35,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-09-05 13:02:35,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 109 transitions. [2019-09-05 13:02:35,029 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 109 transitions. Word has length 103 [2019-09-05 13:02:35,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:02:35,029 INFO L475 AbstractCegarLoop]: Abstraction has 108 states and 109 transitions. [2019-09-05 13:02:35,029 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-09-05 13:02:35,029 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 109 transitions. [2019-09-05 13:02:35,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-05 13:02:35,030 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:02:35,030 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-05 13:02:35,030 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:02:35,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:02:35,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1615686331, now seen corresponding path program 24 times [2019-09-05 13:02:35,031 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:02:35,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:35,032 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:02:35,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:35,032 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:02:35,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:36,078 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-05 13:02:36,078 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:36,079 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:02:36,079 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:02:36,079 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:02:36,080 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:36,080 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 13:02:36,105 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:02:36,105 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:02:36,140 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:02:36,140 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:02:36,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-05 13:02:36,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:02:36,164 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-05 13:02:36,165 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:02:36,949 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-05 13:02:36,952 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:02:36,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 52 [2019-09-05 13:02:36,952 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:02:36,953 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-05 13:02:36,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-05 13:02:36,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-05 13:02:36,954 INFO L87 Difference]: Start difference. First operand 108 states and 109 transitions. Second operand 36 states. [2019-09-05 13:02:37,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:02:37,137 INFO L93 Difference]: Finished difference Result 110 states and 111 transitions. [2019-09-05 13:02:37,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-05 13:02:37,137 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 107 [2019-09-05 13:02:37,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:02:37,138 INFO L225 Difference]: With dead ends: 110 [2019-09-05 13:02:37,139 INFO L226 Difference]: Without dead ends: 110 [2019-09-05 13:02:37,139 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 181 SyntacticMatches, 18 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-05 13:02:37,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-09-05 13:02:37,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2019-09-05 13:02:37,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-09-05 13:02:37,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 111 transitions. [2019-09-05 13:02:37,143 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 111 transitions. Word has length 107 [2019-09-05 13:02:37,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:02:37,144 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 111 transitions. [2019-09-05 13:02:37,144 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-05 13:02:37,144 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 111 transitions. [2019-09-05 13:02:37,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-05 13:02:37,145 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:02:37,145 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-05 13:02:37,145 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:02:37,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:02:37,145 INFO L82 PathProgramCache]: Analyzing trace with hash 627898424, now seen corresponding path program 25 times [2019-09-05 13:02:37,146 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:02:37,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:37,146 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:02:37,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:37,147 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:02:37,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:37,672 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-05 13:02:37,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:37,672 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:02:37,672 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:02:37,673 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:02:37,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:37,673 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:02:37,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:02:37,683 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:02:37,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:37,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-05 13:02:37,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:02:37,736 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-05 13:02:37,736 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:02:38,536 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-05 13:02:38,539 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:02:38,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 52 [2019-09-05 13:02:38,539 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:02:38,540 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-05 13:02:38,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-05 13:02:38,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-05 13:02:38,540 INFO L87 Difference]: Start difference. First operand 110 states and 111 transitions. Second operand 37 states. [2019-09-05 13:02:38,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:02:38,739 INFO L93 Difference]: Finished difference Result 112 states and 113 transitions. [2019-09-05 13:02:38,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-05 13:02:38,740 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 109 [2019-09-05 13:02:38,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:02:38,742 INFO L225 Difference]: With dead ends: 112 [2019-09-05 13:02:38,742 INFO L226 Difference]: Without dead ends: 112 [2019-09-05 13:02:38,743 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-05 13:02:38,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-09-05 13:02:38,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2019-09-05 13:02:38,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-09-05 13:02:38,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 113 transitions. [2019-09-05 13:02:38,747 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 113 transitions. Word has length 109 [2019-09-05 13:02:38,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:02:38,747 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 113 transitions. [2019-09-05 13:02:38,747 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-05 13:02:38,747 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 113 transitions. [2019-09-05 13:02:38,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-05 13:02:38,748 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:02:38,748 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-05 13:02:38,748 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:02:38,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:02:38,749 INFO L82 PathProgramCache]: Analyzing trace with hash 551492213, now seen corresponding path program 26 times [2019-09-05 13:02:38,749 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:02:38,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:38,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:02:38,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:38,750 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:02:38,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:39,287 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-05 13:02:39,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:39,287 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:02:39,287 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:02:39,287 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:02:39,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:39,288 INFO 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-05 13:02:39,298 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:02:39,298 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 13:02:39,342 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2019-09-05 13:02:39,342 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:02:39,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-05 13:02:39,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:02:39,854 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-05 13:02:39,855 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:02:40,583 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-05 13:02:40,586 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:02:40,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 19, 19] total 72 [2019-09-05 13:02:40,587 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:02:40,587 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-09-05 13:02:40,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-09-05 13:02:40,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-09-05 13:02:40,589 INFO L87 Difference]: Start difference. First operand 112 states and 113 transitions. Second operand 55 states. [2019-09-05 13:02:40,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:02:40,838 INFO L93 Difference]: Finished difference Result 117 states and 118 transitions. [2019-09-05 13:02:40,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-09-05 13:02:40,838 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 111 [2019-09-05 13:02:40,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:02:40,839 INFO L225 Difference]: With dead ends: 117 [2019-09-05 13:02:40,840 INFO L226 Difference]: Without dead ends: 117 [2019-09-05 13:02:40,840 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-05 13:02:40,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-09-05 13:02:40,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 116. [2019-09-05 13:02:40,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-09-05 13:02:40,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 117 transitions. [2019-09-05 13:02:40,843 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 117 transitions. Word has length 111 [2019-09-05 13:02:40,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:02:40,844 INFO L475 AbstractCegarLoop]: Abstraction has 116 states and 117 transitions. [2019-09-05 13:02:40,844 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-09-05 13:02:40,844 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 117 transitions. [2019-09-05 13:02:40,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-05 13:02:40,845 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:02:40,845 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-05 13:02:40,845 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:02:40,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:02:40,845 INFO L82 PathProgramCache]: Analyzing trace with hash 972817996, now seen corresponding path program 27 times [2019-09-05 13:02:40,845 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:02:40,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:40,846 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:02:40,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:40,846 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:02:40,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:41,428 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-05 13:02:41,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:41,429 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:02:41,429 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:02:41,429 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:02:41,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:41,429 INFO 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-05 13:02:41,441 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:02:41,441 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 13:02:41,476 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:02:41,476 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:02:41,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-05 13:02:41,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:02:41,502 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-05 13:02:41,502 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:02:42,342 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-05 13:02:42,345 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:02:42,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 52 [2019-09-05 13:02:42,346 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:02:42,346 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-05 13:02:42,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-05 13:02:42,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-05 13:02:42,347 INFO L87 Difference]: Start difference. First operand 116 states and 117 transitions. Second operand 39 states. [2019-09-05 13:02:42,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:02:42,543 INFO L93 Difference]: Finished difference Result 118 states and 119 transitions. [2019-09-05 13:02:42,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-05 13:02:42,544 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 115 [2019-09-05 13:02:42,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:02:42,546 INFO L225 Difference]: With dead ends: 118 [2019-09-05 13:02:42,546 INFO L226 Difference]: Without dead ends: 118 [2019-09-05 13:02:42,546 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-05 13:02:42,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-09-05 13:02:42,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2019-09-05 13:02:42,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-09-05 13:02:42,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 119 transitions. [2019-09-05 13:02:42,549 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 119 transitions. Word has length 115 [2019-09-05 13:02:42,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:02:42,549 INFO L475 AbstractCegarLoop]: Abstraction has 118 states and 119 transitions. [2019-09-05 13:02:42,549 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-05 13:02:42,550 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 119 transitions. [2019-09-05 13:02:42,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-05 13:02:42,550 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:02:42,550 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-05 13:02:42,551 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:02:42,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:02:42,551 INFO L82 PathProgramCache]: Analyzing trace with hash -2035759415, now seen corresponding path program 28 times [2019-09-05 13:02:42,551 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:02:42,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:42,552 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:02:42,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:42,552 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:02:42,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:43,174 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-05 13:02:43,174 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:43,174 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:02:43,174 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:02:43,175 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:02:43,175 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:43,175 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:02:43,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:02:43,186 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:02:43,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:43,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-05 13:02:43,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:02:43,236 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-05 13:02:43,236 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:02:44,048 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-05 13:02:44,051 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:02:44,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 52 [2019-09-05 13:02:44,051 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:02:44,052 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-09-05 13:02:44,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-09-05 13:02:44,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-05 13:02:44,052 INFO L87 Difference]: Start difference. First operand 118 states and 119 transitions. Second operand 40 states. [2019-09-05 13:02:44,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:02:44,249 INFO L93 Difference]: Finished difference Result 120 states and 121 transitions. [2019-09-05 13:02:44,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-05 13:02:44,250 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 117 [2019-09-05 13:02:44,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:02:44,251 INFO L225 Difference]: With dead ends: 120 [2019-09-05 13:02:44,251 INFO L226 Difference]: Without dead ends: 120 [2019-09-05 13:02:44,252 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-05 13:02:44,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-09-05 13:02:44,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2019-09-05 13:02:44,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-09-05 13:02:44,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 121 transitions. [2019-09-05 13:02:44,255 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 121 transitions. Word has length 117 [2019-09-05 13:02:44,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:02:44,256 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 121 transitions. [2019-09-05 13:02:44,256 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-09-05 13:02:44,256 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 121 transitions. [2019-09-05 13:02:44,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-05 13:02:44,257 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:02:44,257 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-05 13:02:44,257 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:02:44,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:02:44,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1529306118, now seen corresponding path program 29 times [2019-09-05 13:02:44,258 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:02:44,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:44,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:02:44,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:44,259 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:02:44,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:44,870 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-05 13:02:44,870 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:44,871 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:02:44,871 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:02:44,871 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:02:44,871 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:44,871 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:02:44,887 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:02:44,887 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 13:02:44,934 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2019-09-05 13:02:44,935 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:02:44,935 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-05 13:02:44,937 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:02:45,511 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-05 13:02:45,511 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:02:46,336 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-05 13:02:46,341 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:02:46,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 20, 20] total 77 [2019-09-05 13:02:46,341 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:02:46,342 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-09-05 13:02:46,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-09-05 13:02:46,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-09-05 13:02:46,343 INFO L87 Difference]: Start difference. First operand 120 states and 121 transitions. Second operand 59 states. [2019-09-05 13:02:46,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:02:46,640 INFO L93 Difference]: Finished difference Result 125 states and 126 transitions. [2019-09-05 13:02:46,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-09-05 13:02:46,641 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 119 [2019-09-05 13:02:46,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:02:46,642 INFO L225 Difference]: With dead ends: 125 [2019-09-05 13:02:46,642 INFO L226 Difference]: Without dead ends: 125 [2019-09-05 13:02:46,643 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-09-05 13:02:46,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-09-05 13:02:46,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2019-09-05 13:02:46,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-09-05 13:02:46,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 125 transitions. [2019-09-05 13:02:46,646 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 125 transitions. Word has length 119 [2019-09-05 13:02:46,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:02:46,647 INFO L475 AbstractCegarLoop]: Abstraction has 124 states and 125 transitions. [2019-09-05 13:02:46,647 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-09-05 13:02:46,647 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 125 transitions. [2019-09-05 13:02:46,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-05 13:02:46,648 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:02:46,648 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-05 13:02:46,648 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:02:46,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:02:46,648 INFO L82 PathProgramCache]: Analyzing trace with hash -892003683, now seen corresponding path program 30 times [2019-09-05 13:02:46,648 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:02:46,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:46,649 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:02:46,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:46,649 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:02:46,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:47,389 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-05 13:02:47,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:47,390 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:02:47,390 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:02:47,390 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:02:47,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:47,390 INFO 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-05 13:02:47,402 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:02:47,402 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 13:02:47,452 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:02:47,452 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:02:47,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-05 13:02:47,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:02:47,474 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-05 13:02:47,474 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:02:48,382 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): Stream closed [2019-09-05 13:02:48,396 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:02:48,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 52 [2019-09-05 13:02:48,396 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:02:48,397 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-09-05 13:02:48,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-09-05 13:02:48,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-05 13:02:48,398 INFO L87 Difference]: Start difference. First operand 124 states and 125 transitions. Second operand 42 states. [2019-09-05 13:02:48,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:02:48,572 INFO L93 Difference]: Finished difference Result 126 states and 127 transitions. [2019-09-05 13:02:48,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-05 13:02:48,573 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 123 [2019-09-05 13:02:48,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:02:48,574 INFO L225 Difference]: With dead ends: 126 [2019-09-05 13:02:48,574 INFO L226 Difference]: Without dead ends: 126 [2019-09-05 13:02:48,574 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 207 SyntacticMatches, 30 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 735 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-05 13:02:48,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-09-05 13:02:48,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2019-09-05 13:02:48,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-09-05 13:02:48,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 127 transitions. [2019-09-05 13:02:48,578 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 127 transitions. Word has length 123 [2019-09-05 13:02:48,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:02:48,580 INFO L475 AbstractCegarLoop]: Abstraction has 126 states and 127 transitions. [2019-09-05 13:02:48,580 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-09-05 13:02:48,580 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 127 transitions. [2019-09-05 13:02:48,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-05 13:02:48,581 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:02:48,581 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-05 13:02:48,581 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:02:48,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:02:48,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1680608794, now seen corresponding path program 31 times [2019-09-05 13:02:48,582 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:02:48,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:48,582 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:02:48,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:48,583 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:02:48,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:49,252 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-05 13:02:49,252 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:49,252 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:02:49,252 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:02:49,253 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:02:49,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:49,253 INFO 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-05 13:02:49,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:02:49,265 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:02:49,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:49,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-05 13:02:49,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:02:49,324 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-05 13:02:49,324 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:02:50,167 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-05 13:02:50,173 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:02:50,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 52 [2019-09-05 13:02:50,173 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:02:50,173 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-05 13:02:50,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-05 13:02:50,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-05 13:02:50,174 INFO L87 Difference]: Start difference. First operand 126 states and 127 transitions. Second operand 43 states. [2019-09-05 13:02:50,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:02:50,400 INFO L93 Difference]: Finished difference Result 128 states and 129 transitions. [2019-09-05 13:02:50,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-05 13:02:50,400 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 125 [2019-09-05 13:02:50,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:02:50,401 INFO L225 Difference]: With dead ends: 128 [2019-09-05 13:02:50,401 INFO L226 Difference]: Without dead ends: 128 [2019-09-05 13:02:50,402 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 210 SyntacticMatches, 32 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 784 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-05 13:02:50,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-09-05 13:02:50,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2019-09-05 13:02:50,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-09-05 13:02:50,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 129 transitions. [2019-09-05 13:02:50,405 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 129 transitions. Word has length 125 [2019-09-05 13:02:50,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:02:50,405 INFO L475 AbstractCegarLoop]: Abstraction has 128 states and 129 transitions. [2019-09-05 13:02:50,406 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-05 13:02:50,406 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 129 transitions. [2019-09-05 13:02:50,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-05 13:02:50,407 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:02:50,407 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-05 13:02:50,407 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:02:50,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:02:50,407 INFO L82 PathProgramCache]: Analyzing trace with hash 60036695, now seen corresponding path program 32 times [2019-09-05 13:02:50,408 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:02:50,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:50,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:02:50,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:50,409 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:02:50,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:51,343 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-05 13:02:51,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:51,344 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:02:51,344 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:02:51,344 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:02:51,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:51,344 INFO 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-05 13:02:51,353 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:02:51,354 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 13:02:51,404 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2019-09-05 13:02:51,404 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:02:51,405 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-05 13:02:51,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:02:52,087 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-05 13:02:52,087 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:02:53,006 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-05 13:02:53,010 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:02:53,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 21, 21] total 82 [2019-09-05 13:02:53,010 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:02:53,011 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-09-05 13:02:53,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-09-05 13:02:53,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-09-05 13:02:53,012 INFO L87 Difference]: Start difference. First operand 128 states and 129 transitions. Second operand 63 states. [2019-09-05 13:02:53,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:02:53,309 INFO L93 Difference]: Finished difference Result 133 states and 134 transitions. [2019-09-05 13:02:53,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-09-05 13:02:53,310 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 127 [2019-09-05 13:02:53,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:02:53,311 INFO L225 Difference]: With dead ends: 133 [2019-09-05 13:02:53,312 INFO L226 Difference]: Without dead ends: 133 [2019-09-05 13:02:53,312 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-05 13:02:53,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-09-05 13:02:53,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 132. [2019-09-05 13:02:53,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-09-05 13:02:53,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 133 transitions. [2019-09-05 13:02:53,321 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 133 transitions. Word has length 127 [2019-09-05 13:02:53,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:02:53,321 INFO L475 AbstractCegarLoop]: Abstraction has 132 states and 133 transitions. [2019-09-05 13:02:53,321 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-09-05 13:02:53,321 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 133 transitions. [2019-09-05 13:02:53,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-05 13:02:53,322 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:02:53,322 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-05 13:02:53,323 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:02:53,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:02:53,323 INFO L82 PathProgramCache]: Analyzing trace with hash -1913358418, now seen corresponding path program 33 times [2019-09-05 13:02:53,323 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:02:53,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:53,324 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:02:53,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:53,324 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:02:53,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:54,205 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-05 13:02:54,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:54,205 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:02:54,206 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:02:54,206 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:02:54,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:54,206 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:02:54,217 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:02:54,217 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 13:02:54,256 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:02:54,256 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:02:54,257 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-05 13:02:54,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:02:54,279 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-05 13:02:54,280 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:02:55,170 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-05 13:02:55,173 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:02:55,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 52 [2019-09-05 13:02:55,174 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:02:55,174 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-09-05 13:02:55,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-09-05 13:02:55,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-05 13:02:55,175 INFO L87 Difference]: Start difference. First operand 132 states and 133 transitions. Second operand 45 states. [2019-09-05 13:02:55,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:02:55,361 INFO L93 Difference]: Finished difference Result 134 states and 135 transitions. [2019-09-05 13:02:55,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-05 13:02:55,362 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 131 [2019-09-05 13:02:55,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:02:55,363 INFO L225 Difference]: With dead ends: 134 [2019-09-05 13:02:55,363 INFO L226 Difference]: Without dead ends: 134 [2019-09-05 13:02:55,364 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 220 SyntacticMatches, 36 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 882 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-05 13:02:55,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-09-05 13:02:55,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2019-09-05 13:02:55,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-09-05 13:02:55,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 135 transitions. [2019-09-05 13:02:55,368 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 135 transitions. Word has length 131 [2019-09-05 13:02:55,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:02:55,368 INFO L475 AbstractCegarLoop]: Abstraction has 134 states and 135 transitions. [2019-09-05 13:02:55,368 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-09-05 13:02:55,368 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 135 transitions. [2019-09-05 13:02:55,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-05 13:02:55,369 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:02:55,369 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-05 13:02:55,369 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:02:55,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:02:55,370 INFO L82 PathProgramCache]: Analyzing trace with hash -871195093, now seen corresponding path program 34 times [2019-09-05 13:02:55,370 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:02:55,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:55,370 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:02:55,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:55,371 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:02:55,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:56,201 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-05 13:02:56,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:56,201 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:02:56,202 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:02:56,202 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:02:56,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:56,202 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:02:56,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:02:56,212 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:02:56,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:56,251 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 45 conjunts are in the unsatisfiable core [2019-09-05 13:02:56,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:02:56,268 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-05 13:02:56,269 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:02:57,140 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-05 13:02:57,143 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:02:57,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 52 [2019-09-05 13:02:57,143 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:02:57,144 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-09-05 13:02:57,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-09-05 13:02:57,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-05 13:02:57,144 INFO L87 Difference]: Start difference. First operand 134 states and 135 transitions. Second operand 46 states. [2019-09-05 13:02:57,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:02:57,404 INFO L93 Difference]: Finished difference Result 136 states and 137 transitions. [2019-09-05 13:02:57,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-09-05 13:02:57,404 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 133 [2019-09-05 13:02:57,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:02:57,406 INFO L225 Difference]: With dead ends: 136 [2019-09-05 13:02:57,406 INFO L226 Difference]: Without dead ends: 136 [2019-09-05 13:02:57,407 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 223 SyntacticMatches, 38 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 931 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-05 13:02:57,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-09-05 13:02:57,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2019-09-05 13:02:57,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-09-05 13:02:57,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 137 transitions. [2019-09-05 13:02:57,410 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 137 transitions. Word has length 133 [2019-09-05 13:02:57,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:02:57,411 INFO L475 AbstractCegarLoop]: Abstraction has 136 states and 137 transitions. [2019-09-05 13:02:57,411 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-09-05 13:02:57,411 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 137 transitions. [2019-09-05 13:02:57,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-05 13:02:57,411 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:02:57,412 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-05 13:02:57,412 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:02:57,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:02:57,412 INFO L82 PathProgramCache]: Analyzing trace with hash -79619736, now seen corresponding path program 35 times [2019-09-05 13:02:57,412 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:02:57,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:57,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:02:57,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:02:57,413 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:02:57,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:02:58,562 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-05 13:02:58,562 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:58,563 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:02:58,563 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:02:58,563 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:02:58,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:02:58,563 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:02:58,576 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:02:58,576 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 13:02:58,629 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2019-09-05 13:02:58,629 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:02:58,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-05 13:02:58,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:02:59,373 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-05 13:02:59,373 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:03:00,380 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-05 13:03:00,383 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:03:00,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 22, 22] total 87 [2019-09-05 13:03:00,384 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:03:00,384 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-09-05 13:03:00,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-09-05 13:03:00,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-09-05 13:03:00,385 INFO L87 Difference]: Start difference. First operand 136 states and 137 transitions. Second operand 67 states. [2019-09-05 13:03:00,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:03:00,692 INFO L93 Difference]: Finished difference Result 141 states and 142 transitions. [2019-09-05 13:03:00,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-09-05 13:03:00,692 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 135 [2019-09-05 13:03:00,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:03:00,694 INFO L225 Difference]: With dead ends: 141 [2019-09-05 13:03:00,694 INFO L226 Difference]: Without dead ends: 141 [2019-09-05 13:03:00,695 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-09-05 13:03:00,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-09-05 13:03:00,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 140. [2019-09-05 13:03:00,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-09-05 13:03:00,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 141 transitions. [2019-09-05 13:03:00,698 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 141 transitions. Word has length 135 [2019-09-05 13:03:00,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:03:00,698 INFO L475 AbstractCegarLoop]: Abstraction has 140 states and 141 transitions. [2019-09-05 13:03:00,698 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-09-05 13:03:00,699 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 141 transitions. [2019-09-05 13:03:00,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-05 13:03:00,700 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:03:00,700 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-05 13:03:00,700 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:03:00,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:03:00,701 INFO L82 PathProgramCache]: Analyzing trace with hash -540938881, now seen corresponding path program 36 times [2019-09-05 13:03:00,702 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:03:00,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:03:00,705 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:03:00,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:03:00,705 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:03:00,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:03:01,721 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-05 13:03:01,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:03:01,721 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:03:01,722 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:03:01,722 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:03:01,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:03:01,722 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:03:01,732 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:03:01,732 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 13:03:01,779 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:03:01,779 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:03:01,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 47 conjunts are in the unsatisfiable core [2019-09-05 13:03:01,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:03:01,795 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-05 13:03:01,795 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:03:02,720 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-05 13:03:02,723 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:03:02,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 52 [2019-09-05 13:03:02,723 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:03:02,724 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-09-05 13:03:02,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-09-05 13:03:02,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-05 13:03:02,725 INFO L87 Difference]: Start difference. First operand 140 states and 141 transitions. Second operand 48 states. [2019-09-05 13:03:02,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:03:02,960 INFO L93 Difference]: Finished difference Result 142 states and 143 transitions. [2019-09-05 13:03:02,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-09-05 13:03:02,961 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 139 [2019-09-05 13:03:02,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:03:02,962 INFO L225 Difference]: With dead ends: 142 [2019-09-05 13:03:02,963 INFO L226 Difference]: Without dead ends: 142 [2019-09-05 13:03:02,963 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 233 SyntacticMatches, 42 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1029 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-05 13:03:02,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-09-05 13:03:02,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2019-09-05 13:03:02,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-09-05 13:03:02,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 143 transitions. [2019-09-05 13:03:02,966 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 143 transitions. Word has length 139 [2019-09-05 13:03:02,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:03:02,966 INFO L475 AbstractCegarLoop]: Abstraction has 142 states and 143 transitions. [2019-09-05 13:03:02,967 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-09-05 13:03:02,967 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 143 transitions. [2019-09-05 13:03:02,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-05 13:03:02,967 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:03:02,968 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-05 13:03:02,968 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:03:02,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:03:02,968 INFO L82 PathProgramCache]: Analyzing trace with hash -1379645700, now seen corresponding path program 37 times [2019-09-05 13:03:02,968 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:03:02,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:03:02,969 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:03:02,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:03:02,969 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:03:02,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:03:03,927 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-05 13:03:03,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:03:03,927 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:03:03,928 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:03:03,928 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:03:03,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:03:03,928 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:03:03,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:03:03,938 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:03:03,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:03:03,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 48 conjunts are in the unsatisfiable core [2019-09-05 13:03:03,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:03:04,019 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-05 13:03:04,019 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:03:05,204 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-05 13:03:05,207 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:03:05,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 52 [2019-09-05 13:03:05,207 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:03:05,208 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-05 13:03:05,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-05 13:03:05,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-05 13:03:05,209 INFO L87 Difference]: Start difference. First operand 142 states and 143 transitions. Second operand 49 states. [2019-09-05 13:03:05,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:03:05,453 INFO L93 Difference]: Finished difference Result 144 states and 145 transitions. [2019-09-05 13:03:05,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-05 13:03:05,454 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 141 [2019-09-05 13:03:05,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:03:05,455 INFO L225 Difference]: With dead ends: 144 [2019-09-05 13:03:05,455 INFO L226 Difference]: Without dead ends: 144 [2019-09-05 13:03:05,456 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-05 13:03:05,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-09-05 13:03:05,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2019-09-05 13:03:05,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-09-05 13:03:05,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 145 transitions. [2019-09-05 13:03:05,458 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 145 transitions. Word has length 141 [2019-09-05 13:03:05,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:03:05,459 INFO L475 AbstractCegarLoop]: Abstraction has 144 states and 145 transitions. [2019-09-05 13:03:05,459 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-05 13:03:05,459 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 145 transitions. [2019-09-05 13:03:05,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-05 13:03:05,460 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:03:05,460 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-05 13:03:05,460 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:03:05,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:03:05,460 INFO L82 PathProgramCache]: Analyzing trace with hash 76952889, now seen corresponding path program 38 times [2019-09-05 13:03:05,461 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:03:05,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:03:05,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:03:05,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:03:05,462 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:03:05,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:03:06,356 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-05 13:03:06,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:03:06,356 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:03:06,356 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:03:06,356 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:03:06,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:03:06,356 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:03:06,367 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:03:06,367 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 13:03:06,421 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 42 check-sat command(s) [2019-09-05 13:03:06,422 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:03:06,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-05 13:03:06,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:03:07,234 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-05 13:03:07,235 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:03:08,379 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-05 13:03:08,382 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:03:08,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 23, 23] total 92 [2019-09-05 13:03:08,383 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:03:08,383 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-09-05 13:03:08,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-09-05 13:03:08,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-09-05 13:03:08,385 INFO L87 Difference]: Start difference. First operand 144 states and 145 transitions. Second operand 71 states. [2019-09-05 13:03:08,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:03:08,729 INFO L93 Difference]: Finished difference Result 149 states and 150 transitions. [2019-09-05 13:03:08,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-09-05 13:03:08,730 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 143 [2019-09-05 13:03:08,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:03:08,731 INFO L225 Difference]: With dead ends: 149 [2019-09-05 13:03:08,731 INFO L226 Difference]: Without dead ends: 149 [2019-09-05 13:03:08,732 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-05 13:03:08,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-09-05 13:03:08,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 148. [2019-09-05 13:03:08,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-09-05 13:03:08,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 149 transitions. [2019-09-05 13:03:08,736 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 149 transitions. Word has length 143 [2019-09-05 13:03:08,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:03:08,737 INFO L475 AbstractCegarLoop]: Abstraction has 148 states and 149 transitions. [2019-09-05 13:03:08,737 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-09-05 13:03:08,737 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 149 transitions. [2019-09-05 13:03:08,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-05 13:03:08,738 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:03:08,738 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-05 13:03:08,738 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:03:08,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:03:08,739 INFO L82 PathProgramCache]: Analyzing trace with hash -621720560, now seen corresponding path program 39 times [2019-09-05 13:03:08,739 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:03:08,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:03:08,740 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:03:08,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:03:08,740 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:03:08,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:03:09,986 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-05 13:03:09,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:03:09,986 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:03:09,986 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:03:09,986 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:03:09,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:03:09,986 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-05 13:03:09,997 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:03:09,998 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 13:03:10,042 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:03:10,042 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:03:10,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 50 conjunts are in the unsatisfiable core [2019-09-05 13:03:10,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:03:10,068 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-05 13:03:10,068 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:03:10,962 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-05 13:03:10,966 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:03:10,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 52 [2019-09-05 13:03:10,966 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:03:10,967 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-09-05 13:03:10,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-09-05 13:03:10,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-05 13:03:10,967 INFO L87 Difference]: Start difference. First operand 148 states and 149 transitions. Second operand 51 states. [2019-09-05 13:03:11,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:03:11,418 INFO L93 Difference]: Finished difference Result 150 states and 151 transitions. [2019-09-05 13:03:11,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-05 13:03:11,418 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 147 [2019-09-05 13:03:11,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:03:11,419 INFO L225 Difference]: With dead ends: 150 [2019-09-05 13:03:11,419 INFO L226 Difference]: Without dead ends: 150 [2019-09-05 13:03:11,420 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 246 SyntacticMatches, 48 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1176 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-05 13:03:11,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-09-05 13:03:11,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2019-09-05 13:03:11,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-09-05 13:03:11,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 151 transitions. [2019-09-05 13:03:11,423 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 151 transitions. Word has length 147 [2019-09-05 13:03:11,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:03:11,423 INFO L475 AbstractCegarLoop]: Abstraction has 150 states and 151 transitions. [2019-09-05 13:03:11,423 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-09-05 13:03:11,423 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 151 transitions. [2019-09-05 13:03:11,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-09-05 13:03:11,424 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:03:11,424 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-05 13:03:11,424 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:03:11,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:03:11,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1225467763, now seen corresponding path program 40 times [2019-09-05 13:03:11,425 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:03:11,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:03:11,425 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:03:11,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:03:11,426 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:03:11,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:03:12,358 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-05 13:03:12,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:03:12,358 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:03:12,358 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:03:12,358 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:03:12,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:03:12,359 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:03:12,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:03:12,369 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:03:12,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:03:12,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 51 conjunts are in the unsatisfiable core [2019-09-05 13:03:12,426 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:03:12,451 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-05 13:03:12,451 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:03:13,357 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-05 13:03:13,360 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:03:13,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 52 [2019-09-05 13:03:13,360 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:03:13,360 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-09-05 13:03:13,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-09-05 13:03:13,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-05 13:03:13,361 INFO L87 Difference]: Start difference. First operand 150 states and 151 transitions. Second operand 52 states. [2019-09-05 13:03:13,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:03:13,601 INFO L93 Difference]: Finished difference Result 152 states and 153 transitions. [2019-09-05 13:03:13,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-05 13:03:13,602 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 149 [2019-09-05 13:03:13,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:03:13,603 INFO L225 Difference]: With dead ends: 152 [2019-09-05 13:03:13,603 INFO L226 Difference]: Without dead ends: 152 [2019-09-05 13:03:13,604 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-05 13:03:13,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-09-05 13:03:13,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2019-09-05 13:03:13,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-09-05 13:03:13,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 153 transitions. [2019-09-05 13:03:13,608 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 153 transitions. Word has length 149 [2019-09-05 13:03:13,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:03:13,608 INFO L475 AbstractCegarLoop]: Abstraction has 152 states and 153 transitions. [2019-09-05 13:03:13,608 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-09-05 13:03:13,608 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 153 transitions. [2019-09-05 13:03:13,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-05 13:03:13,610 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:03:13,610 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-05 13:03:13,610 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:03:13,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:03:13,611 INFO L82 PathProgramCache]: Analyzing trace with hash -1605944886, now seen corresponding path program 41 times [2019-09-05 13:03:13,611 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:03:13,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:03:13,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:03:13,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:03:13,612 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:03:13,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:03:15,485 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-05 13:03:15,485 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:03:15,485 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:03:15,485 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:03:15,486 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:03:15,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:03:15,486 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:03:15,496 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:03:15,496 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 13:03:15,560 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 44 check-sat command(s) [2019-09-05 13:03:15,561 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:03:15,562 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-05 13:03:15,563 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:03:15,575 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-05 13:03:15,575 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:03:16,806 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-05 13:03:16,809 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:03:16,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 24, 24] total 96 [2019-09-05 13:03:16,809 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:03:16,809 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-09-05 13:03:16,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-09-05 13:03:16,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-09-05 13:03:16,810 INFO L87 Difference]: Start difference. First operand 152 states and 153 transitions. Second operand 74 states. [2019-09-05 13:03:17,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:03:17,238 INFO L93 Difference]: Finished difference Result 155 states and 156 transitions. [2019-09-05 13:03:17,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-09-05 13:03:17,239 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 151 [2019-09-05 13:03:17,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:03:17,241 INFO L225 Difference]: With dead ends: 155 [2019-09-05 13:03:17,241 INFO L226 Difference]: Without dead ends: 155 [2019-09-05 13:03:17,242 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 281 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-09-05 13:03:17,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-09-05 13:03:17,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 154. [2019-09-05 13:03:17,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-09-05 13:03:17,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 155 transitions. [2019-09-05 13:03:17,246 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 155 transitions. Word has length 151 [2019-09-05 13:03:17,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:03:17,246 INFO L475 AbstractCegarLoop]: Abstraction has 154 states and 155 transitions. [2019-09-05 13:03:17,246 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-09-05 13:03:17,246 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 155 transitions. [2019-09-05 13:03:17,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-05 13:03:17,247 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:03:17,248 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-05 13:03:17,248 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:03:17,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:03:17,248 INFO L82 PathProgramCache]: Analyzing trace with hash -1427314524, now seen corresponding path program 42 times [2019-09-05 13:03:17,248 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:03:17,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:03:17,249 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:03:17,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:03:17,249 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:03:17,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:03:19,196 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-05 13:03:19,197 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:03:19,197 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:03:19,197 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:03:19,197 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:03:19,197 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:03:19,197 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:03:19,209 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:03:19,209 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 13:03:19,258 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:03:19,258 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:03:19,260 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 74 conjunts are in the unsatisfiable core [2019-09-05 13:03:19,262 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:03:19,294 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-05 13:03:19,294 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:03:22,511 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-05 13:03:22,515 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:03:22,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 102 [2019-09-05 13:03:22,515 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:03:22,516 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-09-05 13:03:22,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-09-05 13:03:22,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:03:22,517 INFO L87 Difference]: Start difference. First operand 154 states and 155 transitions. Second operand 75 states. [2019-09-05 13:03:22,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:03:22,825 INFO L93 Difference]: Finished difference Result 157 states and 158 transitions. [2019-09-05 13:03:22,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-09-05 13:03:22,826 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 153 [2019-09-05 13:03:22,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:03:22,827 INFO L225 Difference]: With dead ends: 157 [2019-09-05 13:03:22,827 INFO L226 Difference]: Without dead ends: 157 [2019-09-05 13:03:22,828 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 234 SyntacticMatches, 46 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2277 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:03:22,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-09-05 13:03:22,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 156. [2019-09-05 13:03:22,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-09-05 13:03:22,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 157 transitions. [2019-09-05 13:03:22,831 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 157 transitions. Word has length 153 [2019-09-05 13:03:22,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:03:22,831 INFO L475 AbstractCegarLoop]: Abstraction has 156 states and 157 transitions. [2019-09-05 13:03:22,831 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-09-05 13:03:22,832 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 157 transitions. [2019-09-05 13:03:22,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-05 13:03:22,832 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:03:22,832 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-05 13:03:22,832 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:03:22,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:03:22,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1562228482, now seen corresponding path program 43 times [2019-09-05 13:03:22,833 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:03:22,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:03:22,834 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:03:22,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:03:22,834 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:03:22,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:03:24,831 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-05 13:03:24,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:03:24,832 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:03:24,832 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:03:24,832 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:03:24,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:03:24,832 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:03:24,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:03:24,844 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:03:24,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:03:24,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 75 conjunts are in the unsatisfiable core [2019-09-05 13:03:24,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:03:24,924 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-05 13:03:24,924 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:03:28,162 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-05 13:03:28,165 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:03:28,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 102 [2019-09-05 13:03:28,165 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:03:28,166 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-09-05 13:03:28,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-09-05 13:03:28,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:03:28,167 INFO L87 Difference]: Start difference. First operand 156 states and 157 transitions. Second operand 76 states. [2019-09-05 13:03:28,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:03:28,570 INFO L93 Difference]: Finished difference Result 159 states and 160 transitions. [2019-09-05 13:03:28,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-09-05 13:03:28,571 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 155 [2019-09-05 13:03:28,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:03:28,572 INFO L225 Difference]: With dead ends: 159 [2019-09-05 13:03:28,572 INFO L226 Difference]: Without dead ends: 159 [2019-09-05 13:03:28,572 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 237 SyntacticMatches, 48 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2376 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:03:28,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-09-05 13:03:28,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 158. [2019-09-05 13:03:28,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-09-05 13:03:28,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 159 transitions. [2019-09-05 13:03:28,574 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 159 transitions. Word has length 155 [2019-09-05 13:03:28,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:03:28,575 INFO L475 AbstractCegarLoop]: Abstraction has 158 states and 159 transitions. [2019-09-05 13:03:28,575 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-09-05 13:03:28,575 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 159 transitions. [2019-09-05 13:03:28,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-05 13:03:28,575 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:03:28,576 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-05 13:03:28,576 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:03:28,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:03:28,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1929444056, now seen corresponding path program 44 times [2019-09-05 13:03:28,576 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:03:28,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:03:28,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:03:28,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:03:28,577 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:03:28,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:03:30,600 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-05 13:03:30,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:03:30,600 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:03:30,600 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:03:30,601 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:03:30,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:03:30,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 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:03:30,611 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:03:30,612 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 13:03:30,676 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 50 check-sat command(s) [2019-09-05 13:03:30,676 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:03:30,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-05 13:03:30,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:03:30,690 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-05 13:03:30,691 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:03:32,175 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-05 13:03:32,178 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:03:32,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 27, 27] total 102 [2019-09-05 13:03:32,178 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:03:32,179 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-09-05 13:03:32,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-09-05 13:03:32,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:03:32,180 INFO L87 Difference]: Start difference. First operand 158 states and 159 transitions. Second operand 77 states. [2019-09-05 13:03:32,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:03:32,562 INFO L93 Difference]: Finished difference Result 161 states and 162 transitions. [2019-09-05 13:03:32,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-09-05 13:03:32,563 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 157 [2019-09-05 13:03:32,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:03:32,565 INFO L225 Difference]: With dead ends: 161 [2019-09-05 13:03:32,565 INFO L226 Difference]: Without dead ends: 161 [2019-09-05 13:03:32,565 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 290 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:03:32,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-09-05 13:03:32,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 160. [2019-09-05 13:03:32,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-09-05 13:03:32,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 161 transitions. [2019-09-05 13:03:32,569 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 161 transitions. Word has length 157 [2019-09-05 13:03:32,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:03:32,569 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 161 transitions. [2019-09-05 13:03:32,569 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-09-05 13:03:32,569 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 161 transitions. [2019-09-05 13:03:32,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-05 13:03:32,570 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:03:32,570 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-05 13:03:32,570 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:03:32,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:03:32,571 INFO L82 PathProgramCache]: Analyzing trace with hash -1237672398, now seen corresponding path program 45 times [2019-09-05 13:03:32,571 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:03:32,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:03:32,572 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:03:32,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:03:32,572 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:03:32,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:03:34,620 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-05 13:03:34,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:03:34,620 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:03:34,620 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:03:34,620 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:03:34,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:03:34,620 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:03:34,633 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:03:34,633 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 13:03:34,682 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:03:34,683 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:03:34,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 77 conjunts are in the unsatisfiable core [2019-09-05 13:03:34,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:03:34,718 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-05 13:03:34,719 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:03:37,931 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-05 13:03:37,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:03:37,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 102 [2019-09-05 13:03:37,935 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:03:37,936 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-09-05 13:03:37,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-09-05 13:03:37,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:03:37,937 INFO L87 Difference]: Start difference. First operand 160 states and 161 transitions. Second operand 78 states. [2019-09-05 13:03:38,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:03:38,340 INFO L93 Difference]: Finished difference Result 163 states and 164 transitions. [2019-09-05 13:03:38,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-09-05 13:03:38,341 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 159 [2019-09-05 13:03:38,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:03:38,342 INFO L225 Difference]: With dead ends: 163 [2019-09-05 13:03:38,342 INFO L226 Difference]: Without dead ends: 163 [2019-09-05 13:03:38,343 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-05 13:03:38,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-09-05 13:03:38,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 162. [2019-09-05 13:03:38,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-09-05 13:03:38,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 163 transitions. [2019-09-05 13:03:38,345 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 163 transitions. Word has length 159 [2019-09-05 13:03:38,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:03:38,346 INFO L475 AbstractCegarLoop]: Abstraction has 162 states and 163 transitions. [2019-09-05 13:03:38,346 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-09-05 13:03:38,346 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 163 transitions. [2019-09-05 13:03:38,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-05 13:03:38,346 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:03:38,347 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-05 13:03:38,347 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:03:38,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:03:38,347 INFO L82 PathProgramCache]: Analyzing trace with hash 295228172, now seen corresponding path program 46 times [2019-09-05 13:03:38,347 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:03:38,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:03:38,348 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:03:38,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:03:38,348 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:03:38,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:03:40,631 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-05 13:03:40,631 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:03:40,631 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:03:40,631 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:03:40,631 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:03:40,631 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:03:40,631 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:03:40,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:03:40,641 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:03:40,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:03:40,688 INFO L256 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 78 conjunts are in the unsatisfiable core [2019-09-05 13:03:40,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:03:40,725 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-05 13:03:40,725 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:03:44,007 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-05 13:03:44,010 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:03:44,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 102 [2019-09-05 13:03:44,010 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:03:44,011 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-09-05 13:03:44,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-09-05 13:03:44,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:03:44,012 INFO L87 Difference]: Start difference. First operand 162 states and 163 transitions. Second operand 79 states. [2019-09-05 13:03:44,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:03:44,407 INFO L93 Difference]: Finished difference Result 165 states and 166 transitions. [2019-09-05 13:03:44,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-09-05 13:03:44,408 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 161 [2019-09-05 13:03:44,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:03:44,409 INFO L225 Difference]: With dead ends: 165 [2019-09-05 13:03:44,409 INFO L226 Difference]: Without dead ends: 165 [2019-09-05 13:03:44,409 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 400 GetRequests, 246 SyntacticMatches, 54 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2673 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:03:44,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-09-05 13:03:44,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 164. [2019-09-05 13:03:44,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-09-05 13:03:44,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 165 transitions. [2019-09-05 13:03:44,414 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 165 transitions. Word has length 161 [2019-09-05 13:03:44,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:03:44,414 INFO L475 AbstractCegarLoop]: Abstraction has 164 states and 165 transitions. [2019-09-05 13:03:44,414 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-09-05 13:03:44,415 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 165 transitions. [2019-09-05 13:03:44,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-09-05 13:03:44,416 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:03:44,416 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-05 13:03:44,416 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:03:44,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:03:44,416 INFO L82 PathProgramCache]: Analyzing trace with hash 238893414, now seen corresponding path program 47 times [2019-09-05 13:03:44,416 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:03:44,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:03:44,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:03:44,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:03:44,417 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:03:44,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:03:46,619 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-05 13:03:46,619 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:03:46,619 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:03:46,619 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:03:46,619 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:03:46,619 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:03:46,620 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:03:46,634 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:03:46,634 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 13:03:46,709 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 56 check-sat command(s) [2019-09-05 13:03:46,709 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:03:46,710 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-05 13:03:46,712 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:03:46,727 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-05 13:03:46,727 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:03:48,336 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-05 13:03:48,339 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:03:48,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 30, 30] total 102 [2019-09-05 13:03:48,340 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:03:48,340 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-09-05 13:03:48,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-09-05 13:03:48,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:03:48,341 INFO L87 Difference]: Start difference. First operand 164 states and 165 transitions. Second operand 80 states. [2019-09-05 13:03:48,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:03:48,754 INFO L93 Difference]: Finished difference Result 167 states and 168 transitions. [2019-09-05 13:03:48,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-09-05 13:03:48,755 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 163 [2019-09-05 13:03:48,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:03:48,756 INFO L225 Difference]: With dead ends: 167 [2019-09-05 13:03:48,756 INFO L226 Difference]: Without dead ends: 167 [2019-09-05 13:03:48,757 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-05 13:03:48,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-09-05 13:03:48,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 166. [2019-09-05 13:03:48,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-09-05 13:03:48,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 167 transitions. [2019-09-05 13:03:48,760 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 167 transitions. Word has length 163 [2019-09-05 13:03:48,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:03:48,761 INFO L475 AbstractCegarLoop]: Abstraction has 166 states and 167 transitions. [2019-09-05 13:03:48,761 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-09-05 13:03:48,761 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 167 transitions. [2019-09-05 13:03:48,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-05 13:03:48,762 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:03:48,762 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-05 13:03:48,762 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:03:48,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:03:48,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1935765824, now seen corresponding path program 48 times [2019-09-05 13:03:48,763 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:03:48,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:03:48,764 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:03:48,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:03:48,764 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:03:48,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:03:50,997 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-05 13:03:50,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:03:50,998 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:03:50,998 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:03:50,998 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:03:50,998 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:03:50,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 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:03:51,009 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:03:51,009 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 13:03:51,061 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:03:51,061 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:03:51,063 INFO L256 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 80 conjunts are in the unsatisfiable core [2019-09-05 13:03:51,065 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:03:51,099 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-05 13:03:51,099 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:03:54,303 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-05 13:03:54,306 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:03:54,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 102 [2019-09-05 13:03:54,306 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:03:54,307 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-09-05 13:03:54,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-09-05 13:03:54,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:03:54,308 INFO L87 Difference]: Start difference. First operand 166 states and 167 transitions. Second operand 81 states. [2019-09-05 13:03:54,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:03:54,708 INFO L93 Difference]: Finished difference Result 169 states and 170 transitions. [2019-09-05 13:03:54,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-09-05 13:03:54,709 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 165 [2019-09-05 13:03:54,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:03:54,710 INFO L225 Difference]: With dead ends: 169 [2019-09-05 13:03:54,711 INFO L226 Difference]: Without dead ends: 169 [2019-09-05 13:03:54,711 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-05 13:03:54,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-09-05 13:03:54,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 168. [2019-09-05 13:03:54,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-09-05 13:03:54,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 169 transitions. [2019-09-05 13:03:54,715 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 169 transitions. Word has length 165 [2019-09-05 13:03:54,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:03:54,715 INFO L475 AbstractCegarLoop]: Abstraction has 168 states and 169 transitions. [2019-09-05 13:03:54,715 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-09-05 13:03:54,716 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 169 transitions. [2019-09-05 13:03:54,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-05 13:03:54,716 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:03:54,717 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-05 13:03:54,717 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:03:54,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:03:54,717 INFO L82 PathProgramCache]: Analyzing trace with hash 542579354, now seen corresponding path program 49 times [2019-09-05 13:03:54,717 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:03:54,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:03:54,718 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:03:54,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:03:54,718 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:03:54,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:03:56,968 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-05 13:03:56,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:03:56,969 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:03:56,969 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:03:56,969 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:03:56,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:03:56,969 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-05 13:03:56,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:03:56,981 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:03:57,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:03:57,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 81 conjunts are in the unsatisfiable core [2019-09-05 13:03:57,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:03:57,068 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-05 13:03:57,069 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:04:00,335 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-05 13:04:00,338 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:04:00,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 102 [2019-09-05 13:04:00,339 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:04:00,339 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-09-05 13:04:00,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-09-05 13:04:00,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:04:00,340 INFO L87 Difference]: Start difference. First operand 168 states and 169 transitions. Second operand 82 states. [2019-09-05 13:04:00,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:04:00,782 INFO L93 Difference]: Finished difference Result 171 states and 172 transitions. [2019-09-05 13:04:00,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-09-05 13:04:00,782 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 167 [2019-09-05 13:04:00,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:04:00,783 INFO L225 Difference]: With dead ends: 171 [2019-09-05 13:04:00,784 INFO L226 Difference]: Without dead ends: 171 [2019-09-05 13:04:00,784 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-05 13:04:00,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-09-05 13:04:00,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 170. [2019-09-05 13:04:00,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-09-05 13:04:00,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 171 transitions. [2019-09-05 13:04:00,787 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 171 transitions. Word has length 167 [2019-09-05 13:04:00,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:04:00,787 INFO L475 AbstractCegarLoop]: Abstraction has 170 states and 171 transitions. [2019-09-05 13:04:00,788 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-09-05 13:04:00,788 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 171 transitions. [2019-09-05 13:04:00,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-09-05 13:04:00,789 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:04:00,789 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-05 13:04:00,789 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:04:00,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:04:00,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1720178036, now seen corresponding path program 50 times [2019-09-05 13:04:00,789 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:04:00,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:04:00,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:04:00,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:04:00,790 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:04:00,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:04:03,113 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-05 13:04:03,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:04:03,113 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:04:03,114 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:04:03,114 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:04:03,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:04:03,114 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:04:03,125 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:04:03,125 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 13:04:03,241 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 62 check-sat command(s) [2019-09-05 13:04:03,242 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:04:03,244 INFO L256 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-05 13:04:03,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:04:03,276 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-05 13:04:03,277 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:04:05,181 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-05 13:04:05,185 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:04:05,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 33, 33] total 102 [2019-09-05 13:04:05,185 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:04:05,186 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-09-05 13:04:05,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-09-05 13:04:05,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:04:05,187 INFO L87 Difference]: Start difference. First operand 170 states and 171 transitions. Second operand 83 states. [2019-09-05 13:04:05,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:04:05,631 INFO L93 Difference]: Finished difference Result 173 states and 174 transitions. [2019-09-05 13:04:05,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-09-05 13:04:05,632 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 169 [2019-09-05 13:04:05,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:04:05,633 INFO L225 Difference]: With dead ends: 173 [2019-09-05 13:04:05,633 INFO L226 Difference]: Without dead ends: 173 [2019-09-05 13:04:05,634 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 308 SyntacticMatches, 12 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:04:05,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-09-05 13:04:05,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 172. [2019-09-05 13:04:05,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-09-05 13:04:05,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 173 transitions. [2019-09-05 13:04:05,637 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 173 transitions. Word has length 169 [2019-09-05 13:04:05,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:04:05,637 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 173 transitions. [2019-09-05 13:04:05,637 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-09-05 13:04:05,637 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 173 transitions. [2019-09-05 13:04:05,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-09-05 13:04:05,638 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:04:05,638 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-05 13:04:05,639 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:04:05,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:04:05,639 INFO L82 PathProgramCache]: Analyzing trace with hash -478854706, now seen corresponding path program 51 times [2019-09-05 13:04:05,639 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:04:05,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:04:05,640 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:04:05,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:04:05,640 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:04:05,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:04:07,942 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-05 13:04:07,942 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:04:07,943 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:04:07,943 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:04:07,943 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:04:07,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:04:07,943 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:04:07,956 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:04:07,956 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 13:04:08,010 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:04:08,010 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:04:08,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 83 conjunts are in the unsatisfiable core [2019-09-05 13:04:08,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:04:08,050 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-05 13:04:08,050 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:04:11,346 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-05 13:04:11,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:04:11,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 102 [2019-09-05 13:04:11,350 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:04:11,350 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-09-05 13:04:11,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-09-05 13:04:11,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:04:11,351 INFO L87 Difference]: Start difference. First operand 172 states and 173 transitions. Second operand 84 states. [2019-09-05 13:04:11,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:04:11,740 INFO L93 Difference]: Finished difference Result 175 states and 176 transitions. [2019-09-05 13:04:11,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-09-05 13:04:11,740 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 171 [2019-09-05 13:04:11,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:04:11,741 INFO L225 Difference]: With dead ends: 175 [2019-09-05 13:04:11,742 INFO L226 Difference]: Without dead ends: 175 [2019-09-05 13:04:11,742 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 425 GetRequests, 261 SyntacticMatches, 64 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3168 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:04:11,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-09-05 13:04:11,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 174. [2019-09-05 13:04:11,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-09-05 13:04:11,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 175 transitions. [2019-09-05 13:04:11,745 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 175 transitions. Word has length 171 [2019-09-05 13:04:11,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:04:11,746 INFO L475 AbstractCegarLoop]: Abstraction has 174 states and 175 transitions. [2019-09-05 13:04:11,746 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-09-05 13:04:11,746 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 175 transitions. [2019-09-05 13:04:11,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-05 13:04:11,746 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:04:11,747 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-05 13:04:11,747 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:04:11,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:04:11,747 INFO L82 PathProgramCache]: Analyzing trace with hash -625410136, now seen corresponding path program 52 times [2019-09-05 13:04:11,747 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:04:11,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:04:11,748 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:04:11,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:04:11,748 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:04:11,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:04:14,170 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-05 13:04:14,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:04:14,171 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:04:14,171 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:04:14,171 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:04:14,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:04:14,171 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:04:14,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:04:14,182 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:04:14,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:04:14,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 84 conjunts are in the unsatisfiable core [2019-09-05 13:04:14,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:04:14,276 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-05 13:04:14,276 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:04:17,569 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-05 13:04:17,573 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:04:17,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 102 [2019-09-05 13:04:17,573 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:04:17,574 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-09-05 13:04:17,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-09-05 13:04:17,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:04:17,575 INFO L87 Difference]: Start difference. First operand 174 states and 175 transitions. Second operand 85 states. [2019-09-05 13:04:18,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:04:18,038 INFO L93 Difference]: Finished difference Result 177 states and 178 transitions. [2019-09-05 13:04:18,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-09-05 13:04:18,038 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 173 [2019-09-05 13:04:18,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:04:18,039 INFO L225 Difference]: With dead ends: 177 [2019-09-05 13:04:18,039 INFO L226 Difference]: Without dead ends: 177 [2019-09-05 13:04:18,039 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 430 GetRequests, 264 SyntacticMatches, 66 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3267 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:04:18,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-09-05 13:04:18,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 176. [2019-09-05 13:04:18,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-09-05 13:04:18,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 177 transitions. [2019-09-05 13:04:18,042 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 177 transitions. Word has length 173 [2019-09-05 13:04:18,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:04:18,042 INFO L475 AbstractCegarLoop]: Abstraction has 176 states and 177 transitions. [2019-09-05 13:04:18,042 INFO L476 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-09-05 13:04:18,042 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 177 transitions. [2019-09-05 13:04:18,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-05 13:04:18,043 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:04:18,043 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-05 13:04:18,043 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:04:18,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:04:18,044 INFO L82 PathProgramCache]: Analyzing trace with hash 268742402, now seen corresponding path program 53 times [2019-09-05 13:04:18,044 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:04:18,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:04:18,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:04:18,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:04:18,045 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:04:18,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:04:20,528 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-05 13:04:20,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:04:20,529 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:04:20,529 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:04:20,529 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:04:20,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:04:20,529 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:04:20,539 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:04:20,540 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 13:04:20,635 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 68 check-sat command(s) [2019-09-05 13:04:20,635 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:04:20,637 INFO L256 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-05 13:04:20,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:04:20,663 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-05 13:04:20,664 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:04:22,587 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-05 13:04:22,590 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:04:22,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 36, 36] total 102 [2019-09-05 13:04:22,591 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:04:22,592 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-09-05 13:04:22,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-09-05 13:04:22,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:04:22,593 INFO L87 Difference]: Start difference. First operand 176 states and 177 transitions. Second operand 86 states. [2019-09-05 13:04:23,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:04:23,035 INFO L93 Difference]: Finished difference Result 179 states and 180 transitions. [2019-09-05 13:04:23,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-09-05 13:04:23,036 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 175 [2019-09-05 13:04:23,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:04:23,037 INFO L225 Difference]: With dead ends: 179 [2019-09-05 13:04:23,037 INFO L226 Difference]: Without dead ends: 179 [2019-09-05 13:04:23,037 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 317 SyntacticMatches, 18 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:04:23,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-09-05 13:04:23,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 178. [2019-09-05 13:04:23,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-09-05 13:04:23,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 179 transitions. [2019-09-05 13:04:23,040 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 179 transitions. Word has length 175 [2019-09-05 13:04:23,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:04:23,041 INFO L475 AbstractCegarLoop]: Abstraction has 178 states and 179 transitions. [2019-09-05 13:04:23,041 INFO L476 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-09-05 13:04:23,041 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 179 transitions. [2019-09-05 13:04:23,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-09-05 13:04:23,041 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:04:23,042 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-05 13:04:23,042 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:04:23,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:04:23,042 INFO L82 PathProgramCache]: Analyzing trace with hash 555872220, now seen corresponding path program 54 times [2019-09-05 13:04:23,042 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:04:23,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:04:23,043 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:04:23,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:04:23,043 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:04:23,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:04:25,558 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-05 13:04:25,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:04:25,558 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:04:25,558 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:04:25,558 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:04:25,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:04:25,558 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:04:25,569 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:04:25,569 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 13:04:25,624 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:04:25,625 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:04:25,627 INFO L256 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 86 conjunts are in the unsatisfiable core [2019-09-05 13:04:25,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:04:25,656 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-05 13:04:25,656 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:04:28,935 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-05 13:04:28,938 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:04:28,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 102 [2019-09-05 13:04:28,938 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:04:28,939 INFO L454 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-09-05 13:04:28,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-09-05 13:04:28,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:04:28,940 INFO L87 Difference]: Start difference. First operand 178 states and 179 transitions. Second operand 87 states. [2019-09-05 13:04:29,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:04:29,397 INFO L93 Difference]: Finished difference Result 181 states and 182 transitions. [2019-09-05 13:04:29,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-09-05 13:04:29,402 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 177 [2019-09-05 13:04:29,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:04:29,403 INFO L225 Difference]: With dead ends: 181 [2019-09-05 13:04:29,404 INFO L226 Difference]: Without dead ends: 181 [2019-09-05 13:04:29,404 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 440 GetRequests, 270 SyntacticMatches, 70 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3465 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:04:29,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-09-05 13:04:29,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 180. [2019-09-05 13:04:29,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-09-05 13:04:29,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 181 transitions. [2019-09-05 13:04:29,407 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 181 transitions. Word has length 177 [2019-09-05 13:04:29,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:04:29,407 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 181 transitions. [2019-09-05 13:04:29,407 INFO L476 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-09-05 13:04:29,407 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 181 transitions. [2019-09-05 13:04:29,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-05 13:04:29,408 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:04:29,408 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-05 13:04:29,409 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:04:29,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:04:29,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1609720374, now seen corresponding path program 55 times [2019-09-05 13:04:29,409 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:04:29,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:04:29,410 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:04:29,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:04:29,410 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:04:29,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:04:32,165 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-05 13:04:32,166 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:04:32,166 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:04:32,166 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:04:32,166 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:04:32,166 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:04:32,166 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:04:32,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:04:32,176 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:04:32,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:04:32,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 87 conjunts are in the unsatisfiable core [2019-09-05 13:04:32,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:04:32,280 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-05 13:04:32,280 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:04:35,622 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-05 13:04:35,625 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:04:35,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 102 [2019-09-05 13:04:35,626 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:04:35,626 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-09-05 13:04:35,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-09-05 13:04:35,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:04:35,627 INFO L87 Difference]: Start difference. First operand 180 states and 181 transitions. Second operand 88 states. [2019-09-05 13:04:36,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:04:36,063 INFO L93 Difference]: Finished difference Result 183 states and 184 transitions. [2019-09-05 13:04:36,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-09-05 13:04:36,064 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 179 [2019-09-05 13:04:36,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:04:36,065 INFO L225 Difference]: With dead ends: 183 [2019-09-05 13:04:36,066 INFO L226 Difference]: Without dead ends: 183 [2019-09-05 13:04:36,066 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 445 GetRequests, 273 SyntacticMatches, 72 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3564 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:04:36,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-09-05 13:04:36,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 182. [2019-09-05 13:04:36,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-09-05 13:04:36,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 183 transitions. [2019-09-05 13:04:36,069 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 183 transitions. Word has length 179 [2019-09-05 13:04:36,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:04:36,070 INFO L475 AbstractCegarLoop]: Abstraction has 182 states and 183 transitions. [2019-09-05 13:04:36,070 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-09-05 13:04:36,070 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 183 transitions. [2019-09-05 13:04:36,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-05 13:04:36,071 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:04:36,071 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-05 13:04:36,071 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:04:36,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:04:36,072 INFO L82 PathProgramCache]: Analyzing trace with hash 745514512, now seen corresponding path program 56 times [2019-09-05 13:04:36,072 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:04:36,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:04:36,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:04:36,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:04:36,073 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:04:36,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:04:38,672 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-05 13:04:38,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:04:38,672 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:04:38,672 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:04:38,672 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:04:38,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:04:38,673 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:04:38,687 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:04:38,688 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 13:04:38,791 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 74 check-sat command(s) [2019-09-05 13:04:38,791 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:04:38,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-05 13:04:38,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:04:38,821 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-05 13:04:38,821 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:04:41,035 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-05 13:04:41,039 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:04:41,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 39, 39] total 102 [2019-09-05 13:04:41,039 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:04:41,039 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-09-05 13:04:41,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-09-05 13:04:41,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:04:41,041 INFO L87 Difference]: Start difference. First operand 182 states and 183 transitions. Second operand 89 states. [2019-09-05 13:04:41,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:04:41,494 INFO L93 Difference]: Finished difference Result 185 states and 186 transitions. [2019-09-05 13:04:41,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-09-05 13:04:41,495 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 181 [2019-09-05 13:04:41,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:04:41,497 INFO L225 Difference]: With dead ends: 185 [2019-09-05 13:04:41,497 INFO L226 Difference]: Without dead ends: 185 [2019-09-05 13:04:41,498 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 326 SyntacticMatches, 24 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 588 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:04:41,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-09-05 13:04:41,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 184. [2019-09-05 13:04:41,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-09-05 13:04:41,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 185 transitions. [2019-09-05 13:04:41,501 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 185 transitions. Word has length 181 [2019-09-05 13:04:41,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:04:41,502 INFO L475 AbstractCegarLoop]: Abstraction has 184 states and 185 transitions. [2019-09-05 13:04:41,502 INFO L476 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-09-05 13:04:41,502 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 185 transitions. [2019-09-05 13:04:41,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-09-05 13:04:41,503 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:04:41,503 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-05 13:04:41,503 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:04:41,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:04:41,503 INFO L82 PathProgramCache]: Analyzing trace with hash -827630742, now seen corresponding path program 57 times [2019-09-05 13:04:41,504 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:04:41,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:04:41,504 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:04:41,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:04:41,505 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:04:41,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:04:44,175 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-05 13:04:44,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:04:44,176 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:04:44,176 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:04:44,176 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:04:44,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:04:44,176 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:04:44,185 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:04:44,185 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 13:04:44,242 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:04:44,243 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:04:44,245 INFO L256 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 89 conjunts are in the unsatisfiable core [2019-09-05 13:04:44,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:04:44,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-05 13:04:44,286 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:04:47,599 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-05 13:04:47,602 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:04:47,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90, 90] total 102 [2019-09-05 13:04:47,602 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:04:47,603 INFO L454 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-09-05 13:04:47,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-09-05 13:04:47,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:04:47,604 INFO L87 Difference]: Start difference. First operand 184 states and 185 transitions. Second operand 90 states. [2019-09-05 13:04:48,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:04:48,044 INFO L93 Difference]: Finished difference Result 187 states and 188 transitions. [2019-09-05 13:04:48,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-09-05 13:04:48,044 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 183 [2019-09-05 13:04:48,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:04:48,046 INFO L225 Difference]: With dead ends: 187 [2019-09-05 13:04:48,046 INFO L226 Difference]: Without dead ends: 187 [2019-09-05 13:04:48,046 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-05 13:04:48,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-09-05 13:04:48,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 186. [2019-09-05 13:04:48,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-09-05 13:04:48,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 187 transitions. [2019-09-05 13:04:48,049 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 187 transitions. Word has length 183 [2019-09-05 13:04:48,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:04:48,050 INFO L475 AbstractCegarLoop]: Abstraction has 186 states and 187 transitions. [2019-09-05 13:04:48,050 INFO L476 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-09-05 13:04:48,050 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 187 transitions. [2019-09-05 13:04:48,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-09-05 13:04:48,051 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:04:48,051 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-05 13:04:48,051 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:04:48,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:04:48,051 INFO L82 PathProgramCache]: Analyzing trace with hash -791731644, now seen corresponding path program 58 times [2019-09-05 13:04:48,051 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:04:48,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:04:48,052 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:04:48,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:04:48,052 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:04:48,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:04:50,800 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-05 13:04:50,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:04:50,801 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:04:50,801 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:04:50,801 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:04:50,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:04:50,801 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:04:50,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:04:50,812 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:04:50,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:04:50,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 90 conjunts are in the unsatisfiable core [2019-09-05 13:04:50,873 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:04:50,903 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-05 13:04:50,904 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:04:54,228 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-05 13:04:54,231 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:04:54,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 102 [2019-09-05 13:04:54,231 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:04:54,232 INFO L454 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-09-05 13:04:54,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-09-05 13:04:54,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:04:54,233 INFO L87 Difference]: Start difference. First operand 186 states and 187 transitions. Second operand 91 states. [2019-09-05 13:04:54,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:04:54,697 INFO L93 Difference]: Finished difference Result 189 states and 190 transitions. [2019-09-05 13:04:54,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-09-05 13:04:54,697 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 185 [2019-09-05 13:04:54,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:04:54,699 INFO L225 Difference]: With dead ends: 189 [2019-09-05 13:04:54,699 INFO L226 Difference]: Without dead ends: 189 [2019-09-05 13:04:54,699 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 282 SyntacticMatches, 78 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3861 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:04:54,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-09-05 13:04:54,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 188. [2019-09-05 13:04:54,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-09-05 13:04:54,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 189 transitions. [2019-09-05 13:04:54,702 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 189 transitions. Word has length 185 [2019-09-05 13:04:54,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:04:54,703 INFO L475 AbstractCegarLoop]: Abstraction has 188 states and 189 transitions. [2019-09-05 13:04:54,703 INFO L476 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-09-05 13:04:54,703 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 189 transitions. [2019-09-05 13:04:54,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-09-05 13:04:54,704 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:04:54,704 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-05 13:04:54,704 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:04:54,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:04:54,704 INFO L82 PathProgramCache]: Analyzing trace with hash -652436834, now seen corresponding path program 59 times [2019-09-05 13:04:54,705 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:04:54,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:04:54,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:04:54,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:04:54,705 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:04:54,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:04:57,518 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-05 13:04:57,519 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:04:57,519 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:04:57,519 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:04:57,519 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:04:57,519 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:04:57,519 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:04:57,531 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:04:57,531 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 13:04:57,645 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 80 check-sat command(s) [2019-09-05 13:04:57,646 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:04:57,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-05 13:04:57,649 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:04:57,667 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-05 13:04:57,667 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:04:59,811 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-05 13:04:59,815 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:04:59,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 42, 42] total 102 [2019-09-05 13:04:59,815 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:04:59,815 INFO L454 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-09-05 13:04:59,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-09-05 13:04:59,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:04:59,817 INFO L87 Difference]: Start difference. First operand 188 states and 189 transitions. Second operand 92 states. [2019-09-05 13:05:00,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:05:00,316 INFO L93 Difference]: Finished difference Result 191 states and 192 transitions. [2019-09-05 13:05:00,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-09-05 13:05:00,317 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 187 [2019-09-05 13:05:00,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:05:00,318 INFO L225 Difference]: With dead ends: 191 [2019-09-05 13:05:00,318 INFO L226 Difference]: Without dead ends: 191 [2019-09-05 13:05:00,318 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-05 13:05:00,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-09-05 13:05:00,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 190. [2019-09-05 13:05:00,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-09-05 13:05:00,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 191 transitions. [2019-09-05 13:05:00,321 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 191 transitions. Word has length 187 [2019-09-05 13:05:00,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:05:00,321 INFO L475 AbstractCegarLoop]: Abstraction has 190 states and 191 transitions. [2019-09-05 13:05:00,322 INFO L476 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-09-05 13:05:00,322 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 191 transitions. [2019-09-05 13:05:00,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-09-05 13:05:00,323 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:05:00,323 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-05 13:05:00,323 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:05:00,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:05:00,324 INFO L82 PathProgramCache]: Analyzing trace with hash 65889400, now seen corresponding path program 60 times [2019-09-05 13:05:00,324 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:05:00,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:05:00,324 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:05:00,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:05:00,325 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:05:00,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:05:03,163 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-05 13:05:03,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:05:03,163 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:05:03,164 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:05:03,164 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:05:03,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:05:03,164 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:05:03,177 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:05:03,177 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 13:05:03,244 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:05:03,244 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:05:03,246 INFO L256 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 92 conjunts are in the unsatisfiable core [2019-09-05 13:05:03,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:05:03,279 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-05 13:05:03,280 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:05:06,612 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-05 13:05:06,615 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:05:06,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 102 [2019-09-05 13:05:06,615 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:05:06,615 INFO L454 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-09-05 13:05:06,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-09-05 13:05:06,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:05:06,617 INFO L87 Difference]: Start difference. First operand 190 states and 191 transitions. Second operand 93 states. [2019-09-05 13:05:07,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:05:07,097 INFO L93 Difference]: Finished difference Result 193 states and 194 transitions. [2019-09-05 13:05:07,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-09-05 13:05:07,097 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 189 [2019-09-05 13:05:07,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:05:07,099 INFO L225 Difference]: With dead ends: 193 [2019-09-05 13:05:07,099 INFO L226 Difference]: Without dead ends: 193 [2019-09-05 13:05:07,100 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 470 GetRequests, 288 SyntacticMatches, 82 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4059 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:05:07,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-09-05 13:05:07,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 192. [2019-09-05 13:05:07,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-09-05 13:05:07,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 193 transitions. [2019-09-05 13:05:07,103 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 193 transitions. Word has length 189 [2019-09-05 13:05:07,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:05:07,103 INFO L475 AbstractCegarLoop]: Abstraction has 192 states and 193 transitions. [2019-09-05 13:05:07,104 INFO L476 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-09-05 13:05:07,104 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 193 transitions. [2019-09-05 13:05:07,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-09-05 13:05:07,105 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:05:07,105 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-05 13:05:07,105 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:05:07,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:05:07,105 INFO L82 PathProgramCache]: Analyzing trace with hash -1112334382, now seen corresponding path program 61 times [2019-09-05 13:05:07,106 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:05:07,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:05:07,106 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:05:07,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:05:07,107 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:05:07,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:05:10,041 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-05 13:05:10,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:05:10,042 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:05:10,042 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:05:10,042 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:05:10,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:05:10,042 INFO 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-05 13:05:10,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:05:10,052 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:05:10,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:05:10,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 93 conjunts are in the unsatisfiable core [2019-09-05 13:05:10,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:05:10,139 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-05 13:05:10,140 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:05:13,513 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-05 13:05:13,516 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:05:13,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94, 94] total 102 [2019-09-05 13:05:13,516 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:05:13,517 INFO L454 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-09-05 13:05:13,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-09-05 13:05:13,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:05:13,518 INFO L87 Difference]: Start difference. First operand 192 states and 193 transitions. Second operand 94 states. [2019-09-05 13:05:13,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:05:13,985 INFO L93 Difference]: Finished difference Result 195 states and 196 transitions. [2019-09-05 13:05:13,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-09-05 13:05:13,986 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 191 [2019-09-05 13:05:13,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:05:13,987 INFO L225 Difference]: With dead ends: 195 [2019-09-05 13:05:13,987 INFO L226 Difference]: Without dead ends: 195 [2019-09-05 13:05:13,988 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-05 13:05:13,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-09-05 13:05:13,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 194. [2019-09-05 13:05:13,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-05 13:05:13,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 195 transitions. [2019-09-05 13:05:13,991 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 195 transitions. Word has length 191 [2019-09-05 13:05:13,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:05:13,991 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 195 transitions. [2019-09-05 13:05:13,991 INFO L476 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-09-05 13:05:13,991 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 195 transitions. [2019-09-05 13:05:13,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-09-05 13:05:13,992 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:05:13,992 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-05 13:05:13,993 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:05:13,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:05:13,993 INFO L82 PathProgramCache]: Analyzing trace with hash 485977260, now seen corresponding path program 62 times [2019-09-05 13:05:13,993 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:05:13,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:05:13,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:05:13,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:05:13,994 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:05:14,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:05:17,186 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-05 13:05:17,186 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:05:17,187 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:05:17,187 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:05:17,187 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:05:17,187 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:05:17,187 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:05:17,198 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:05:17,198 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 13:05:17,337 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 84 check-sat command(s) [2019-09-05 13:05:17,338 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:05:17,340 INFO L256 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 94 conjunts are in the unsatisfiable core [2019-09-05 13:05:17,342 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:05:17,371 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-05 13:05:17,371 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:05:20,696 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-05 13:05:20,699 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:05:20,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 102 [2019-09-05 13:05:20,700 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:05:20,700 INFO L454 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-09-05 13:05:20,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-09-05 13:05:20,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:05:20,701 INFO L87 Difference]: Start difference. First operand 194 states and 195 transitions. Second operand 95 states. [2019-09-05 13:05:21,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:05:21,197 INFO L93 Difference]: Finished difference Result 197 states and 198 transitions. [2019-09-05 13:05:21,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-09-05 13:05:21,197 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 193 [2019-09-05 13:05:21,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:05:21,198 INFO L225 Difference]: With dead ends: 197 [2019-09-05 13:05:21,198 INFO L226 Difference]: Without dead ends: 197 [2019-09-05 13:05:21,199 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 480 GetRequests, 294 SyntacticMatches, 86 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4257 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:05:21,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-09-05 13:05:21,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 196. [2019-09-05 13:05:21,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-09-05 13:05:21,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 197 transitions. [2019-09-05 13:05:21,201 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 197 transitions. Word has length 193 [2019-09-05 13:05:21,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:05:21,201 INFO L475 AbstractCegarLoop]: Abstraction has 196 states and 197 transitions. [2019-09-05 13:05:21,201 INFO L476 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-09-05 13:05:21,201 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 197 transitions. [2019-09-05 13:05:21,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-05 13:05:21,202 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:05:21,202 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-05 13:05:21,203 INFO L418 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:05:21,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:05:21,203 INFO L82 PathProgramCache]: Analyzing trace with hash -1134826746, now seen corresponding path program 63 times [2019-09-05 13:05:21,203 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:05:21,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:05:21,203 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:05:21,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:05:21,204 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:05:21,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:05:24,247 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-05 13:05:24,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:05:24,247 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:05:24,248 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:05:24,248 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:05:24,248 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:05:24,248 INFO 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-05 13:05:24,262 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:05:24,262 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 13:05:24,322 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:05:24,322 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:05:24,324 INFO L256 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 95 conjunts are in the unsatisfiable core [2019-09-05 13:05:24,326 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:05:24,364 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-05 13:05:24,365 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:05:27,733 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-05 13:05:27,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:05:27,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 102 [2019-09-05 13:05:27,737 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:05:27,737 INFO L454 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-09-05 13:05:27,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-09-05 13:05:27,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:05:27,738 INFO L87 Difference]: Start difference. First operand 196 states and 197 transitions. Second operand 96 states. [2019-09-05 13:05:28,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:05:28,208 INFO L93 Difference]: Finished difference Result 199 states and 200 transitions. [2019-09-05 13:05:28,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-09-05 13:05:28,208 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 195 [2019-09-05 13:05:28,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:05:28,210 INFO L225 Difference]: With dead ends: 199 [2019-09-05 13:05:28,210 INFO L226 Difference]: Without dead ends: 199 [2019-09-05 13:05:28,210 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-05 13:05:28,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-09-05 13:05:28,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 198. [2019-09-05 13:05:28,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2019-09-05 13:05:28,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 199 transitions. [2019-09-05 13:05:28,213 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 199 transitions. Word has length 195 [2019-09-05 13:05:28,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:05:28,213 INFO L475 AbstractCegarLoop]: Abstraction has 198 states and 199 transitions. [2019-09-05 13:05:28,214 INFO L476 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-09-05 13:05:28,214 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 199 transitions. [2019-09-05 13:05:28,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-09-05 13:05:28,214 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:05:28,214 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-05 13:05:28,215 INFO L418 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:05:28,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:05:28,215 INFO L82 PathProgramCache]: Analyzing trace with hash 345651936, now seen corresponding path program 64 times [2019-09-05 13:05:28,215 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:05:28,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:05:28,216 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:05:28,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:05:28,216 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:05:28,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:05:31,299 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-05 13:05:31,300 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:05:31,300 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:05:31,300 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:05:31,300 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:05:31,300 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:05:31,300 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:05:31,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:05:31,312 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:05:31,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:05:31,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 96 conjunts are in the unsatisfiable core [2019-09-05 13:05:31,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:05:31,408 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-05 13:05:31,408 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:05:34,777 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-05 13:05:34,780 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:05:34,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 102 [2019-09-05 13:05:34,781 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:05:34,781 INFO L454 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-09-05 13:05:34,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-09-05 13:05:34,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:05:34,782 INFO L87 Difference]: Start difference. First operand 198 states and 199 transitions. Second operand 97 states. [2019-09-05 13:05:35,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:05:35,281 INFO L93 Difference]: Finished difference Result 201 states and 202 transitions. [2019-09-05 13:05:35,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-09-05 13:05:35,282 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 197 [2019-09-05 13:05:35,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:05:35,283 INFO L225 Difference]: With dead ends: 201 [2019-09-05 13:05:35,284 INFO L226 Difference]: Without dead ends: 201 [2019-09-05 13:05:35,284 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 490 GetRequests, 300 SyntacticMatches, 90 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4455 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:05:35,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-09-05 13:05:35,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 200. [2019-09-05 13:05:35,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-09-05 13:05:35,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 201 transitions. [2019-09-05 13:05:35,287 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 201 transitions. Word has length 197 [2019-09-05 13:05:35,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:05:35,288 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 201 transitions. [2019-09-05 13:05:35,288 INFO L476 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-09-05 13:05:35,288 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 201 transitions. [2019-09-05 13:05:35,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-09-05 13:05:35,289 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:05:35,289 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-05 13:05:35,289 INFO L418 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:05:35,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:05:35,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1451490362, now seen corresponding path program 65 times [2019-09-05 13:05:35,290 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:05:35,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:05:35,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:05:35,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:05:35,290 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:05:35,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:05:38,428 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-05 13:05:38,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:05:38,428 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:05:38,428 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:05:38,429 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:05:38,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:05:38,429 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:05:38,439 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:05:38,439 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 13:05:38,582 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 87 check-sat command(s) [2019-09-05 13:05:38,583 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:05:38,585 INFO L256 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 97 conjunts are in the unsatisfiable core [2019-09-05 13:05:38,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:05:38,630 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-05 13:05:38,631 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:05:42,047 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-05 13:05:42,051 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:05:42,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 102 [2019-09-05 13:05:42,052 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:05:42,052 INFO L454 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-09-05 13:05:42,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-09-05 13:05:42,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:05:42,053 INFO L87 Difference]: Start difference. First operand 200 states and 201 transitions. Second operand 98 states. [2019-09-05 13:05:42,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:05:42,548 INFO L93 Difference]: Finished difference Result 203 states and 204 transitions. [2019-09-05 13:05:42,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-09-05 13:05:42,549 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 199 [2019-09-05 13:05:42,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:05:42,550 INFO L225 Difference]: With dead ends: 203 [2019-09-05 13:05:42,550 INFO L226 Difference]: Without dead ends: 203 [2019-09-05 13:05:42,551 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-05 13:05:42,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-09-05 13:05:42,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 202. [2019-09-05 13:05:42,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-09-05 13:05:42,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 203 transitions. [2019-09-05 13:05:42,554 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 203 transitions. Word has length 199 [2019-09-05 13:05:42,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:05:42,554 INFO L475 AbstractCegarLoop]: Abstraction has 202 states and 203 transitions. [2019-09-05 13:05:42,554 INFO L476 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-09-05 13:05:42,554 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 203 transitions. [2019-09-05 13:05:42,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-09-05 13:05:42,555 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:05:42,556 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-05 13:05:42,556 INFO L418 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:05:42,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:05:42,556 INFO L82 PathProgramCache]: Analyzing trace with hash -989671660, now seen corresponding path program 66 times [2019-09-05 13:05:42,556 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:05:42,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:05:42,557 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:05:42,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:05:42,557 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:05:42,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:05:45,775 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-05 13:05:45,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:05:45,775 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:05:45,775 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:05:45,775 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:05:45,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:05:45,776 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:05:45,786 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:05:45,786 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 13:05:45,851 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:05:45,852 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:05:45,854 INFO L256 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 98 conjunts are in the unsatisfiable core [2019-09-05 13:05:45,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:05:45,895 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-05 13:05:45,895 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:05:49,257 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-05 13:05:49,260 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:05:49,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99] total 102 [2019-09-05 13:05:49,260 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:05:49,261 INFO L454 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-09-05 13:05:49,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-09-05 13:05:49,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:05:49,263 INFO L87 Difference]: Start difference. First operand 202 states and 203 transitions. Second operand 99 states. [2019-09-05 13:05:49,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:05:49,770 INFO L93 Difference]: Finished difference Result 205 states and 206 transitions. [2019-09-05 13:05:49,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-09-05 13:05:49,771 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 201 [2019-09-05 13:05:49,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:05:49,772 INFO L225 Difference]: With dead ends: 205 [2019-09-05 13:05:49,773 INFO L226 Difference]: Without dead ends: 205 [2019-09-05 13:05:49,773 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 500 GetRequests, 306 SyntacticMatches, 94 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4653 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:05:49,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-09-05 13:05:49,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 204. [2019-09-05 13:05:49,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2019-09-05 13:05:49,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 205 transitions. [2019-09-05 13:05:49,776 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 205 transitions. Word has length 201 [2019-09-05 13:05:49,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:05:49,776 INFO L475 AbstractCegarLoop]: Abstraction has 204 states and 205 transitions. [2019-09-05 13:05:49,777 INFO L476 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-09-05 13:05:49,777 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 205 transitions. [2019-09-05 13:05:49,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-09-05 13:05:49,778 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:05:49,778 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-05 13:05:49,778 INFO L418 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:05:49,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:05:49,778 INFO L82 PathProgramCache]: Analyzing trace with hash -1894231186, now seen corresponding path program 67 times [2019-09-05 13:05:49,779 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:05:49,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:05:49,779 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:05:49,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:05:49,780 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:05:49,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:05:53,139 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-05 13:05:53,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:05:53,139 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:05:53,140 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:05:53,140 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:05:53,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:05:53,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 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:05:53,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:05:53,149 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:05:53,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:05:53,213 INFO L256 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 99 conjunts are in the unsatisfiable core [2019-09-05 13:05:53,215 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:05:53,246 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-05 13:05:53,247 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:05:56,667 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-05 13:05:56,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:05:56,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100, 100] total 102 [2019-09-05 13:05:56,672 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:05:56,672 INFO L454 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-09-05 13:05:56,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-09-05 13:05:56,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:05:56,674 INFO L87 Difference]: Start difference. First operand 204 states and 205 transitions. Second operand 100 states. [2019-09-05 13:05:57,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:05:57,176 INFO L93 Difference]: Finished difference Result 207 states and 208 transitions. [2019-09-05 13:05:57,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-09-05 13:05:57,177 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 203 [2019-09-05 13:05:57,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:05:57,178 INFO L225 Difference]: With dead ends: 207 [2019-09-05 13:05:57,178 INFO L226 Difference]: Without dead ends: 207 [2019-09-05 13:05:57,179 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 505 GetRequests, 309 SyntacticMatches, 96 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4752 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:05:57,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-09-05 13:05:57,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 206. [2019-09-05 13:05:57,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-09-05 13:05:57,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 207 transitions. [2019-09-05 13:05:57,181 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 207 transitions. Word has length 203 [2019-09-05 13:05:57,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:05:57,182 INFO L475 AbstractCegarLoop]: Abstraction has 206 states and 207 transitions. [2019-09-05 13:05:57,182 INFO L476 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-09-05 13:05:57,182 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 207 transitions. [2019-09-05 13:05:57,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-09-05 13:05:57,183 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:05:57,183 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-05 13:05:57,183 INFO L418 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:05:57,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:05:57,184 INFO L82 PathProgramCache]: Analyzing trace with hash 702425416, now seen corresponding path program 68 times [2019-09-05 13:05:57,184 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:05:57,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:05:57,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:05:57,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:05:57,185 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:05:57,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:06:00,555 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-05 13:06:00,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:06:00,556 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:06:00,556 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:06:00,556 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:06:00,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:06:00,556 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:06:00,566 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:06:00,566 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 13:06:00,702 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 90 check-sat command(s) [2019-09-05 13:06:00,702 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:06:00,704 INFO L256 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 100 conjunts are in the unsatisfiable core [2019-09-05 13:06:00,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:06:00,739 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-05 13:06:00,739 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:06:04,103 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-05 13:06:04,107 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:06:04,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101, 101] total 102 [2019-09-05 13:06:04,107 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:06:04,107 INFO L454 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-09-05 13:06:04,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-09-05 13:06:04,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:06:04,108 INFO L87 Difference]: Start difference. First operand 206 states and 207 transitions. Second operand 101 states. [2019-09-05 13:06:04,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:06:04,590 INFO L93 Difference]: Finished difference Result 209 states and 210 transitions. [2019-09-05 13:06:04,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-09-05 13:06:04,591 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 205 [2019-09-05 13:06:04,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:06:04,592 INFO L225 Difference]: With dead ends: 209 [2019-09-05 13:06:04,592 INFO L226 Difference]: Without dead ends: 209 [2019-09-05 13:06:04,593 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 510 GetRequests, 312 SyntacticMatches, 98 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4851 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:06:04,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-09-05 13:06:04,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 208. [2019-09-05 13:06:04,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-09-05 13:06:04,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 209 transitions. [2019-09-05 13:06:04,597 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 209 transitions. Word has length 205 [2019-09-05 13:06:04,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:06:04,597 INFO L475 AbstractCegarLoop]: Abstraction has 208 states and 209 transitions. [2019-09-05 13:06:04,597 INFO L476 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-09-05 13:06:04,597 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 209 transitions. [2019-09-05 13:06:04,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-09-05 13:06:04,598 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:06:04,598 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-05 13:06:04,598 INFO L418 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:06:04,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:06:04,598 INFO L82 PathProgramCache]: Analyzing trace with hash 713420962, now seen corresponding path program 69 times [2019-09-05 13:06:04,598 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:06:04,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:06:04,599 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:06:04,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:06:04,599 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:06:04,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:06:08,015 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-05 13:06:08,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:06:08,015 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:06:08,015 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:06:08,016 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:06:08,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:06:08,016 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:06:08,026 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:06:08,026 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 13:06:08,094 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:06:08,094 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:06:08,097 INFO L256 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 101 conjunts are in the unsatisfiable core [2019-09-05 13:06:08,098 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:06:08,132 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-05 13:06:08,132 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:06:11,509 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-05 13:06:11,512 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:06:11,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102, 102, 102] total 102 [2019-09-05 13:06:11,513 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:06:11,513 INFO L454 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-09-05 13:06:11,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-09-05 13:06:11,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:06:11,515 INFO L87 Difference]: Start difference. First operand 208 states and 209 transitions. Second operand 102 states. [2019-09-05 13:06:12,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:06:12,029 INFO L93 Difference]: Finished difference Result 210 states and 211 transitions. [2019-09-05 13:06:12,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-09-05 13:06:12,029 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 207 [2019-09-05 13:06:12,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:06:12,031 INFO L225 Difference]: With dead ends: 210 [2019-09-05 13:06:12,031 INFO L226 Difference]: Without dead ends: 210 [2019-09-05 13:06:12,031 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 515 GetRequests, 315 SyntacticMatches, 100 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4950 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 13:06:12,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-09-05 13:06:12,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2019-09-05 13:06:12,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-09-05 13:06:12,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 211 transitions. [2019-09-05 13:06:12,034 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 211 transitions. Word has length 207 [2019-09-05 13:06:12,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:06:12,034 INFO L475 AbstractCegarLoop]: Abstraction has 210 states and 211 transitions. [2019-09-05 13:06:12,034 INFO L476 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-09-05 13:06:12,034 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 211 transitions. [2019-09-05 13:06:12,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-09-05 13:06:12,035 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:06:12,035 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-05 13:06:12,035 INFO L418 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:06:12,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:06:12,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1604761220, now seen corresponding path program 70 times [2019-09-05 13:06:12,036 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:06:12,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:06:12,036 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:06:12,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:06:12,037 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:06:12,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:06:13,682 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-05 13:06:13,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:06:13,682 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-05 13:06:13,683 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:06:13,683 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:06:13,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:06:13,683 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:06:13,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:06:13,694 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:06:13,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:06:13,760 INFO L256 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 108 conjunts are in the unsatisfiable core [2019-09-05 13:06:13,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:06:13,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:06:13,939 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-05 13:06:13,939 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:06:14,094 INFO L134 CoverageAnalysis]: Checked inductivity of 8281 backedges. 0 proven. 6559 refuted. 0 times theorem prover too weak. 1722 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (71)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 13:06:14,099 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-05 13:06:14,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 55 [2019-09-05 13:06:14,099 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:06:14,100 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-09-05 13:06:14,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-09-05 13:06:14,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=2862, Unknown=0, NotChecked=0, Total=2970 [2019-09-05 13:06:14,100 INFO L87 Difference]: Start difference. First operand 210 states and 211 transitions. Second operand 55 states. [2019-09-05 13:06:15,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:06:15,983 INFO L93 Difference]: Finished difference Result 214 states and 215 transitions. [2019-09-05 13:06:15,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-09-05 13:06:15,983 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 209 [2019-09-05 13:06:15,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:06:15,985 INFO L225 Difference]: With dead ends: 214 [2019-09-05 13:06:15,985 INFO L226 Difference]: Without dead ends: 213 [2019-09-05 13:06:15,985 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 472 GetRequests, 416 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=113, Invalid=2967, Unknown=0, NotChecked=0, Total=3080 [2019-09-05 13:06:15,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-09-05 13:06:15,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 212. [2019-09-05 13:06:15,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-09-05 13:06:15,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 213 transitions. [2019-09-05 13:06:15,988 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 213 transitions. Word has length 209 [2019-09-05 13:06:15,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:06:15,989 INFO L475 AbstractCegarLoop]: Abstraction has 212 states and 213 transitions. [2019-09-05 13:06:15,989 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-09-05 13:06:15,989 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 213 transitions. [2019-09-05 13:06:15,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-09-05 13:06:15,990 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:06:15,990 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-05 13:06:15,990 INFO L418 AbstractCegarLoop]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:06:15,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:06:15,991 INFO L82 PathProgramCache]: Analyzing trace with hash -289811498, now seen corresponding path program 71 times [2019-09-05 13:06:15,991 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:06:15,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:06:15,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:06:15,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:06:15,992 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:06:16,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:06:17,081 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-05 13:06:17,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:06:17,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2019-09-05 13:06:17,081 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:06:17,082 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-09-05 13:06:17,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-09-05 13:06:17,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-05 13:06:17,083 INFO L87 Difference]: Start difference. First operand 212 states and 213 transitions. Second operand 52 states. [2019-09-05 13:06:17,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:06:17,338 INFO L93 Difference]: Finished difference Result 207 states and 207 transitions. [2019-09-05 13:06:17,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-05 13:06:17,339 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 211 [2019-09-05 13:06:17,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:06:17,339 INFO L225 Difference]: With dead ends: 207 [2019-09-05 13:06:17,339 INFO L226 Difference]: Without dead ends: 0 [2019-09-05 13:06:17,340 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 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-05 13:06:17,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-05 13:06:17,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-05 13:06:17,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-05 13:06:17,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-05 13:06:17,341 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 211 [2019-09-05 13:06:17,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:06:17,341 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-05 13:06:17,341 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-09-05 13:06:17,341 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-05 13:06:17,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-05 13:06:17,347 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.09 01:06:17 BoogieIcfgContainer [2019-09-05 13:06:17,347 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-05 13:06:17,349 INFO L168 Benchmark]: Toolchain (without parser) took 252524.29 ms. Allocated memory was 138.4 MB in the beginning and 462.4 MB in the end (delta: 324.0 MB). Free memory was 84.4 MB in the beginning and 367.8 MB in the end (delta: -283.4 MB). Peak memory consumption was 40.6 MB. Max. memory is 7.1 GB. [2019-09-05 13:06:17,350 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 138.4 MB. Free memory is still 102.8 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-09-05 13:06:17,350 INFO L168 Benchmark]: CACSL2BoogieTranslator took 295.91 ms. Allocated memory is still 138.4 MB. Free memory was 84.0 MB in the beginning and 73.5 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. [2019-09-05 13:06:17,350 INFO L168 Benchmark]: Boogie Preprocessor took 132.78 ms. Allocated memory was 138.4 MB in the beginning and 198.7 MB in the end (delta: 60.3 MB). Free memory was 73.5 MB in the beginning and 175.7 MB in the end (delta: -102.2 MB). Peak memory consumption was 10.8 MB. Max. memory is 7.1 GB. [2019-09-05 13:06:17,351 INFO L168 Benchmark]: RCFGBuilder took 351.68 ms. Allocated memory is still 198.7 MB. Free memory was 175.7 MB in the beginning and 159.4 MB in the end (delta: 16.3 MB). Peak memory consumption was 16.3 MB. Max. memory is 7.1 GB. [2019-09-05 13:06:17,351 INFO L168 Benchmark]: TraceAbstraction took 251735.80 ms. Allocated memory was 198.7 MB in the beginning and 462.4 MB in the end (delta: 263.7 MB). Free memory was 159.4 MB in the beginning and 367.8 MB in the end (delta: -208.4 MB). Peak memory consumption was 55.3 MB. Max. memory is 7.1 GB. [2019-09-05 13:06:17,354 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.16 ms. Allocated memory is still 138.4 MB. Free memory is still 102.8 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 295.91 ms. Allocated memory is still 138.4 MB. Free memory was 84.0 MB in the beginning and 73.5 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 132.78 ms. Allocated memory was 138.4 MB in the beginning and 198.7 MB in the end (delta: 60.3 MB). Free memory was 73.5 MB in the beginning and 175.7 MB in the end (delta: -102.2 MB). Peak memory consumption was 10.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 351.68 ms. Allocated memory is still 198.7 MB. Free memory was 175.7 MB in the beginning and 159.4 MB in the end (delta: 16.3 MB). Peak memory consumption was 16.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 251735.80 ms. Allocated memory was 198.7 MB in the beginning and 462.4 MB in the end (delta: 263.7 MB). Free memory was 159.4 MB in the beginning and 367.8 MB in the end (delta: -208.4 MB). Peak memory consumption was 55.3 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, 251.6s OverallTime, 78 OverallIterations, 92 TraceHistogramMax, 24.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 887 SDtfs, 3733 SDslu, 20443 SDs, 0 SdLazy, 22178 SolverSat, 3573 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 22516 GetRequests, 15301 SyntacticMatches, 2196 SemanticMatches, 5019 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95103 ImplicationChecksByTransitivity, 212.9s 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.2s 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.4s SatisfiabilityAnalysisTime, 219.0s 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...