java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/loop-acceleration/nested_1-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 01:51:17,763 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 01:51:17,765 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 01:51:17,777 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 01:51:17,777 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 01:51:17,778 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 01:51:17,779 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 01:51:17,781 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 01:51:17,783 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 01:51:17,784 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 01:51:17,785 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 01:51:17,786 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 01:51:17,786 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 01:51:17,787 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 01:51:17,788 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 01:51:17,789 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 01:51:17,790 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 01:51:17,791 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 01:51:17,793 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 01:51:17,795 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 01:51:17,796 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 01:51:17,797 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 01:51:17,799 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 01:51:17,799 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 01:51:17,802 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 01:51:17,802 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 01:51:17,802 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 01:51:17,803 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 01:51:17,804 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 01:51:17,805 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 01:51:17,805 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 01:51:17,806 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 01:51:17,807 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 01:51:17,807 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 01:51:17,809 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 01:51:17,809 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 01:51:17,809 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 01:51:17,810 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 01:51:17,810 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 01:51:17,811 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 01:51:17,811 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 01:51:17,812 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 01:51:17,827 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 01:51:17,828 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 01:51:17,828 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 01:51:17,828 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 01:51:17,829 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 01:51:17,829 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 01:51:17,829 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 01:51:17,829 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 01:51:17,830 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 01:51:17,830 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 01:51:17,831 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 01:51:17,831 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 01:51:17,831 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 01:51:17,831 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 01:51:17,831 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 01:51:17,832 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 01:51:17,832 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 01:51:17,832 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 01:51:17,832 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 01:51:17,832 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 01:51:17,833 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 01:51:17,833 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 01:51:17,833 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 01:51:17,833 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 01:51:17,833 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 01:51:17,834 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 01:51:17,834 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 01:51:17,834 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 01:51:17,834 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 01:51:17,834 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 01:51:17,871 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 01:51:17,882 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 01:51:17,886 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 01:51:17,887 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 01:51:17,887 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 01:51:17,888 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/nested_1-2.c [2019-09-10 01:51:17,946 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/591487736/a045c06858024aa09801aae4081bd8c8/FLAGe4b61f42b [2019-09-10 01:51:18,360 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 01:51:18,360 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/nested_1-2.c [2019-09-10 01:51:18,367 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/591487736/a045c06858024aa09801aae4081bd8c8/FLAGe4b61f42b [2019-09-10 01:51:18,716 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/591487736/a045c06858024aa09801aae4081bd8c8 [2019-09-10 01:51:18,725 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 01:51:18,727 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 01:51:18,728 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 01:51:18,728 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 01:51:18,731 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 01:51:18,732 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 01:51:18" (1/1) ... [2019-09-10 01:51:18,735 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26f9c9f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:51:18, skipping insertion in model container [2019-09-10 01:51:18,735 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 01:51:18" (1/1) ... [2019-09-10 01:51:18,743 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 01:51:18,759 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 01:51:18,939 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 01:51:18,943 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 01:51:18,960 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 01:51:18,975 INFO L192 MainTranslator]: Completed translation [2019-09-10 01:51:18,976 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:51:18 WrapperNode [2019-09-10 01:51:18,976 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 01:51:18,977 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 01:51:18,978 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 01:51:18,978 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 01:51:19,073 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:51:18" (1/1) ... [2019-09-10 01:51:19,073 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:51:18" (1/1) ... [2019-09-10 01:51:19,080 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:51:18" (1/1) ... [2019-09-10 01:51:19,080 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:51:18" (1/1) ... [2019-09-10 01:51:19,083 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:51:18" (1/1) ... [2019-09-10 01:51:19,088 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:51:18" (1/1) ... [2019-09-10 01:51:19,089 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:51:18" (1/1) ... [2019-09-10 01:51:19,093 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 01:51:19,093 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 01:51:19,093 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 01:51:19,093 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 01:51:19,094 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:51:18" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 01:51:19,153 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 01:51:19,153 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 01:51:19,153 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-10 01:51:19,153 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 01:51:19,153 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 01:51:19,153 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-10 01:51:19,153 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 01:51:19,153 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 01:51:19,154 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 01:51:19,316 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 01:51:19,316 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-09-10 01:51:19,317 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 01:51:19 BoogieIcfgContainer [2019-09-10 01:51:19,318 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 01:51:19,319 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 01:51:19,319 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 01:51:19,322 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 01:51:19,322 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 01:51:18" (1/3) ... [2019-09-10 01:51:19,323 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5de14658 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 01:51:19, skipping insertion in model container [2019-09-10 01:51:19,323 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:51:18" (2/3) ... [2019-09-10 01:51:19,324 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5de14658 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 01:51:19, skipping insertion in model container [2019-09-10 01:51:19,324 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 01:51:19" (3/3) ... [2019-09-10 01:51:19,326 INFO L109 eAbstractionObserver]: Analyzing ICFG nested_1-2.c [2019-09-10 01:51:19,335 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 01:51:19,343 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 01:51:19,360 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 01:51:19,390 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 01:51:19,391 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 01:51:19,391 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 01:51:19,391 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 01:51:19,391 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 01:51:19,392 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 01:51:19,392 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 01:51:19,392 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 01:51:19,415 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-09-10 01:51:19,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-10 01:51:19,427 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:51:19,428 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:51:19,432 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:51:19,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:51:19,439 INFO L82 PathProgramCache]: Analyzing trace with hash -873786703, now seen corresponding path program 1 times [2019-09-10 01:51:19,442 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:51:19,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:51:19,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:51:19,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:51:19,500 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:51:19,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:51:19,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:51:19,678 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:51:19,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 01:51:19,679 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:51:19,683 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 01:51:19,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 01:51:19,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 01:51:19,701 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 3 states. [2019-09-10 01:51:19,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:51:19,739 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2019-09-10 01:51:19,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 01:51:19,742 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-09-10 01:51:19,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:51:19,754 INFO L225 Difference]: With dead ends: 22 [2019-09-10 01:51:19,754 INFO L226 Difference]: Without dead ends: 16 [2019-09-10 01:51:19,756 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 01:51:19,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-09-10 01:51:19,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 14. [2019-09-10 01:51:19,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-09-10 01:51:19,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2019-09-10 01:51:19,798 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 10 [2019-09-10 01:51:19,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:51:19,799 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2019-09-10 01:51:19,799 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 01:51:19,799 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2019-09-10 01:51:19,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-10 01:51:19,800 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:51:19,800 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:51:19,801 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:51:19,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:51:19,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1621360120, now seen corresponding path program 1 times [2019-09-10 01:51:19,801 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:51:19,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:51:19,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:51:19,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:51:19,803 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:51:19,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:51:19,907 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:51:19,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:51:19,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 01:51:19,908 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:51:19,910 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 01:51:19,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 01:51:19,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 01:51:19,911 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 3 states. [2019-09-10 01:51:19,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:51:19,929 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2019-09-10 01:51:19,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 01:51:19,930 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-09-10 01:51:19,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:51:19,931 INFO L225 Difference]: With dead ends: 15 [2019-09-10 01:51:19,931 INFO L226 Difference]: Without dead ends: 15 [2019-09-10 01:51:19,933 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 01:51:19,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-09-10 01:51:19,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-09-10 01:51:19,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-09-10 01:51:19,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-09-10 01:51:19,938 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 13 [2019-09-10 01:51:19,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:51:19,939 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-09-10 01:51:19,939 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 01:51:19,939 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2019-09-10 01:51:19,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-10 01:51:19,940 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:51:19,941 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:51:19,941 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:51:19,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:51:19,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1574756514, now seen corresponding path program 1 times [2019-09-10 01:51:19,942 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:51:19,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:51:19,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:51:19,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:51:19,945 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:51:19,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:51:20,057 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:51:20,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:51:20,058 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:51:20,060 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 15 with the following transitions: [2019-09-10 01:51:20,061 INFO L207 CegarAbsIntRunner]: [0], [4], [11], [13], [20], [22], [26], [32], [35], [37], [43], [44], [45], [47] [2019-09-10 01:51:20,098 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 01:51:20,098 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 01:51:20,167 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 01:51:20,748 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 01:51:20,752 INFO L272 AbstractInterpreter]: Visited 14 different actions 98 times. Merged at 5 different actions 38 times. Widened at 3 different actions 14 times. Performed 206 root evaluator evaluations with a maximum evaluation depth of 13. Performed 206 inverse root evaluator evaluations with a maximum inverse evaluation depth of 13. Found 12 fixpoints after 3 different actions. Largest state had 4 variables. [2019-09-10 01:51:20,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:51:20,757 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 01:51:20,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:51:20,757 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 01:51:20,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:51:20,775 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:51:20,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:51:20,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-10 01:51:20,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:51:20,859 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:51:20,860 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:51:20,911 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-10 01:51:20,917 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:51:20,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 4] total 9 [2019-09-10 01:51:20,917 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:51:20,918 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 01:51:20,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 01:51:20,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-09-10 01:51:20,921 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 7 states. [2019-09-10 01:51:21,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:51:21,042 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2019-09-10 01:51:21,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 01:51:21,043 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2019-09-10 01:51:21,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:51:21,044 INFO L225 Difference]: With dead ends: 25 [2019-09-10 01:51:21,044 INFO L226 Difference]: Without dead ends: 25 [2019-09-10 01:51:21,045 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-09-10 01:51:21,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-09-10 01:51:21,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2019-09-10 01:51:21,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-09-10 01:51:21,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2019-09-10 01:51:21,049 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 14 [2019-09-10 01:51:21,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:51:21,050 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2019-09-10 01:51:21,050 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 01:51:21,050 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2019-09-10 01:51:21,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-10 01:51:21,051 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:51:21,051 INFO L399 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:51:21,051 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:51:21,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:51:21,052 INFO L82 PathProgramCache]: Analyzing trace with hash 93409041, now seen corresponding path program 2 times [2019-09-10 01:51:21,052 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:51:21,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:51:21,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:51:21,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:51:21,053 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:51:21,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:51:21,135 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-10 01:51:21,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:51:21,135 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:51:21,136 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:51:21,136 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:51:21,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:51:21,136 INFO 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) [2019-09-10 01:51:21,161 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 01:51:21,161 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:51:21,183 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-09-10 01:51:21,184 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:51:21,185 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-10 01:51:21,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:51:21,273 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:51:21,273 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:51:21,344 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-10 01:51:21,348 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:51:21,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 5] total 15 [2019-09-10 01:51:21,348 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:51:21,349 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 01:51:21,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 01:51:21,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2019-09-10 01:51:21,350 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 12 states. [2019-09-10 01:51:21,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:51:21,521 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2019-09-10 01:51:21,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 01:51:21,521 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2019-09-10 01:51:21,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:51:21,522 INFO L225 Difference]: With dead ends: 34 [2019-09-10 01:51:21,523 INFO L226 Difference]: Without dead ends: 34 [2019-09-10 01:51:21,523 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2019-09-10 01:51:21,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-09-10 01:51:21,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 29. [2019-09-10 01:51:21,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-09-10 01:51:21,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2019-09-10 01:51:21,533 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 20 [2019-09-10 01:51:21,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:51:21,533 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2019-09-10 01:51:21,533 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 01:51:21,533 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2019-09-10 01:51:21,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-10 01:51:21,535 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:51:21,535 INFO L399 BasicCegarLoop]: trace histogram [9, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:51:21,536 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:51:21,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:51:21,536 INFO L82 PathProgramCache]: Analyzing trace with hash 50981508, now seen corresponding path program 3 times [2019-09-10 01:51:21,536 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:51:21,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:51:21,540 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:51:21,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:51:21,540 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:51:21,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:51:21,685 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 35 proven. 6 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-10 01:51:21,686 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:51:21,686 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:51:21,686 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:51:21,686 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:51:21,686 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:51:21,686 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:51:21,709 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 01:51:21,710 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 01:51:21,730 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 01:51:21,731 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:51:21,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-10 01:51:21,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:51:21,837 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-10 01:51:21,837 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:51:21,931 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-10 01:51:21,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:51:21,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 6] total 17 [2019-09-10 01:51:21,935 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:51:21,935 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 01:51:21,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 01:51:21,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2019-09-10 01:51:21,936 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 13 states. [2019-09-10 01:51:22,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:51:22,346 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2019-09-10 01:51:22,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 01:51:22,347 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 28 [2019-09-10 01:51:22,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:51:22,348 INFO L225 Difference]: With dead ends: 45 [2019-09-10 01:51:22,348 INFO L226 Difference]: Without dead ends: 45 [2019-09-10 01:51:22,353 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=196, Invalid=674, Unknown=0, NotChecked=0, Total=870 [2019-09-10 01:51:22,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-09-10 01:51:22,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2019-09-10 01:51:22,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-10 01:51:22,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2019-09-10 01:51:22,364 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 28 [2019-09-10 01:51:22,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:51:22,365 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-09-10 01:51:22,365 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 01:51:22,365 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2019-09-10 01:51:22,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-10 01:51:22,366 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:51:22,367 INFO L399 BasicCegarLoop]: trace histogram [16, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:51:22,367 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:51:22,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:51:22,373 INFO L82 PathProgramCache]: Analyzing trace with hash 1027694321, now seen corresponding path program 4 times [2019-09-10 01:51:22,373 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:51:22,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:51:22,374 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:51:22,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:51:22,375 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:51:22,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:51:22,550 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 79 proven. 10 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-09-10 01:51:22,550 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:51:22,550 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:51:22,551 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:51:22,551 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:51:22,551 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:51:22,551 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 01:51:22,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:51:22,576 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:51:22,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:51:22,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-10 01:51:22,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:51:22,751 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-10 01:51:22,751 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:51:22,869 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 0 proven. 166 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-10 01:51:22,873 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:51:22,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 7] total 21 [2019-09-10 01:51:22,873 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:51:22,874 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 01:51:22,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 01:51:22,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-09-10 01:51:22,875 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 16 states. [2019-09-10 01:51:23,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:51:23,437 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2019-09-10 01:51:23,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-10 01:51:23,440 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 38 [2019-09-10 01:51:23,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:51:23,441 INFO L225 Difference]: With dead ends: 58 [2019-09-10 01:51:23,441 INFO L226 Difference]: Without dead ends: 58 [2019-09-10 01:51:23,442 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=325, Invalid=1397, Unknown=0, NotChecked=0, Total=1722 [2019-09-10 01:51:23,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-09-10 01:51:23,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 51. [2019-09-10 01:51:23,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-09-10 01:51:23,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2019-09-10 01:51:23,448 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 38 [2019-09-10 01:51:23,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:51:23,449 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2019-09-10 01:51:23,449 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 01:51:23,449 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2019-09-10 01:51:23,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-10 01:51:23,450 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:51:23,451 INFO L399 BasicCegarLoop]: trace histogram [25, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:51:23,451 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:51:23,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:51:23,451 INFO L82 PathProgramCache]: Analyzing trace with hash 79747558, now seen corresponding path program 5 times [2019-09-10 01:51:23,451 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:51:23,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:51:23,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:51:23,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:51:23,453 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:51:23,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:51:23,551 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 149 proven. 15 refuted. 0 times theorem prover too weak. 296 trivial. 0 not checked. [2019-09-10 01:51:23,551 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:51:23,551 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:51:23,551 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:51:23,551 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:51:23,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:51:23,552 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:51:23,587 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 01:51:23,588 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 01:51:23,916 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-09-10 01:51:23,916 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:51:23,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-10 01:51:23,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:51:23,968 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 149 proven. 15 refuted. 0 times theorem prover too weak. 296 trivial. 0 not checked. [2019-09-10 01:51:23,968 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:51:24,089 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 149 proven. 15 refuted. 0 times theorem prover too weak. 296 trivial. 0 not checked. [2019-09-10 01:51:24,094 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:51:24,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2019-09-10 01:51:24,094 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:51:24,095 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 01:51:24,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 01:51:24,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2019-09-10 01:51:24,096 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand 9 states. [2019-09-10 01:51:24,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:51:24,150 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2019-09-10 01:51:24,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 01:51:24,152 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2019-09-10 01:51:24,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:51:24,153 INFO L225 Difference]: With dead ends: 56 [2019-09-10 01:51:24,153 INFO L226 Difference]: Without dead ends: 56 [2019-09-10 01:51:24,154 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2019-09-10 01:51:24,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-09-10 01:51:24,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-09-10 01:51:24,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-09-10 01:51:24,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2019-09-10 01:51:24,159 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 50 [2019-09-10 01:51:24,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:51:24,159 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2019-09-10 01:51:24,159 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 01:51:24,159 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2019-09-10 01:51:24,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-10 01:51:24,160 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:51:24,161 INFO L399 BasicCegarLoop]: trace histogram [30, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:51:24,161 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:51:24,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:51:24,161 INFO L82 PathProgramCache]: Analyzing trace with hash -1763701256, now seen corresponding path program 6 times [2019-09-10 01:51:24,161 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:51:24,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:51:24,162 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:51:24,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:51:24,163 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:51:24,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:51:24,311 INFO L134 CoverageAnalysis]: Checked inductivity of 620 backedges. 201 proven. 21 refuted. 0 times theorem prover too weak. 398 trivial. 0 not checked. [2019-09-10 01:51:24,312 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:51:24,312 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:51:24,312 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:51:24,312 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:51:24,312 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:51:24,312 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:51:24,334 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 01:51:24,335 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 01:51:24,368 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 01:51:24,369 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:51:24,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-10 01:51:24,374 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:51:24,538 INFO L134 CoverageAnalysis]: Checked inductivity of 620 backedges. 0 proven. 536 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-10 01:51:24,538 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:51:24,945 INFO L134 CoverageAnalysis]: Checked inductivity of 620 backedges. 6 proven. 530 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-10 01:51:24,953 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:51:24,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14, 14] total 33 [2019-09-10 01:51:24,954 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:51:24,954 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 01:51:24,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 01:51:24,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=818, Unknown=0, NotChecked=0, Total=1056 [2019-09-10 01:51:24,956 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand 21 states. [2019-09-10 01:51:26,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:51:26,139 INFO L93 Difference]: Finished difference Result 80 states and 87 transitions. [2019-09-10 01:51:26,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-09-10 01:51:26,140 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 55 [2019-09-10 01:51:26,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:51:26,141 INFO L225 Difference]: With dead ends: 80 [2019-09-10 01:51:26,141 INFO L226 Difference]: Without dead ends: 80 [2019-09-10 01:51:26,144 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1065 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=880, Invalid=3812, Unknown=0, NotChecked=0, Total=4692 [2019-09-10 01:51:26,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-09-10 01:51:26,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 71. [2019-09-10 01:51:26,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-09-10 01:51:26,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 77 transitions. [2019-09-10 01:51:26,150 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 77 transitions. Word has length 55 [2019-09-10 01:51:26,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:51:26,150 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 77 transitions. [2019-09-10 01:51:26,150 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 01:51:26,150 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2019-09-10 01:51:26,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-10 01:51:26,152 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:51:26,152 INFO L399 BasicCegarLoop]: trace histogram [42, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:51:26,152 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:51:26,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:51:26,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1703496983, now seen corresponding path program 7 times [2019-09-10 01:51:26,153 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:51:26,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:51:26,153 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:51:26,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:51:26,154 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:51:26,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:51:26,316 INFO L134 CoverageAnalysis]: Checked inductivity of 1164 backedges. 326 proven. 28 refuted. 0 times theorem prover too weak. 810 trivial. 0 not checked. [2019-09-10 01:51:26,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:51:26,317 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:51:26,317 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:51:26,317 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:51:26,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:51:26,317 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:51:26,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:51:26,331 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 01:51:26,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:51:26,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-10 01:51:26,374 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:51:26,564 INFO L134 CoverageAnalysis]: Checked inductivity of 1164 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2019-09-10 01:51:26,564 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:51:27,130 INFO L134 CoverageAnalysis]: Checked inductivity of 1164 backedges. 7 proven. 1017 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2019-09-10 01:51:27,138 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:51:27,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 16, 16] total 38 [2019-09-10 01:51:27,139 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:51:27,139 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-10 01:51:27,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-10 01:51:27,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=310, Invalid=1096, Unknown=0, NotChecked=0, Total=1406 [2019-09-10 01:51:27,142 INFO L87 Difference]: Start difference. First operand 71 states and 77 transitions. Second operand 24 states. [2019-09-10 01:51:28,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:51:28,777 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2019-09-10 01:51:28,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-09-10 01:51:28,777 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 70 [2019-09-10 01:51:28,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:51:28,778 INFO L225 Difference]: With dead ends: 98 [2019-09-10 01:51:28,778 INFO L226 Difference]: Without dead ends: 98 [2019-09-10 01:51:28,780 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1813 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1283, Invalid=6199, Unknown=0, NotChecked=0, Total=7482 [2019-09-10 01:51:28,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-09-10 01:51:28,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 88. [2019-09-10 01:51:28,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-09-10 01:51:28,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2019-09-10 01:51:28,788 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 70 [2019-09-10 01:51:28,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:51:28,788 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2019-09-10 01:51:28,788 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-10 01:51:28,788 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2019-09-10 01:51:28,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 01:51:28,790 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:51:28,790 INFO L399 BasicCegarLoop]: trace histogram [56, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:51:28,790 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:51:28,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:51:28,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1048409624, now seen corresponding path program 8 times [2019-09-10 01:51:28,791 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:51:28,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:51:28,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:51:28,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:51:28,792 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:51:28,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:51:28,934 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 493 proven. 36 refuted. 0 times theorem prover too weak. 1473 trivial. 0 not checked. [2019-09-10 01:51:28,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:51:28,935 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:51:28,935 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:51:28,935 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:51:28,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:51:28,936 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:51:28,947 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 01:51:28,947 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 01:51:29,139 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-09-10 01:51:29,139 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:51:29,140 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-10 01:51:29,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:51:29,172 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 493 proven. 36 refuted. 0 times theorem prover too weak. 1473 trivial. 0 not checked. [2019-09-10 01:51:29,173 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:51:29,321 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 493 proven. 36 refuted. 0 times theorem prover too weak. 1473 trivial. 0 not checked. [2019-09-10 01:51:29,326 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:51:29,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2019-09-10 01:51:29,326 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:51:29,326 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 01:51:29,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 01:51:29,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2019-09-10 01:51:29,327 INFO L87 Difference]: Start difference. First operand 88 states and 95 transitions. Second operand 12 states. [2019-09-10 01:51:29,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:51:29,426 INFO L93 Difference]: Finished difference Result 95 states and 102 transitions. [2019-09-10 01:51:29,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 01:51:29,426 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 87 [2019-09-10 01:51:29,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:51:29,428 INFO L225 Difference]: With dead ends: 95 [2019-09-10 01:51:29,428 INFO L226 Difference]: Without dead ends: 95 [2019-09-10 01:51:29,429 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 164 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2019-09-10 01:51:29,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-09-10 01:51:29,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-09-10 01:51:29,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-09-10 01:51:29,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 102 transitions. [2019-09-10 01:51:29,435 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 102 transitions. Word has length 87 [2019-09-10 01:51:29,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:51:29,436 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 102 transitions. [2019-09-10 01:51:29,436 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 01:51:29,436 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 102 transitions. [2019-09-10 01:51:29,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-10 01:51:29,437 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:51:29,438 INFO L399 BasicCegarLoop]: trace histogram [63, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:51:29,438 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:51:29,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:51:29,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1289232840, now seen corresponding path program 9 times [2019-09-10 01:51:29,438 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:51:29,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:51:29,439 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:51:29,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:51:29,440 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:51:29,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:51:29,678 INFO L134 CoverageAnalysis]: Checked inductivity of 2464 backedges. 607 proven. 45 refuted. 0 times theorem prover too weak. 1812 trivial. 0 not checked. [2019-09-10 01:51:29,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:51:29,679 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:51:29,679 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:51:29,679 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:51:29,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:51:29,679 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:51:29,696 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 01:51:29,697 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 01:51:29,742 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 01:51:29,743 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:51:29,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-10 01:51:29,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:51:30,011 INFO L134 CoverageAnalysis]: Checked inductivity of 2464 backedges. 0 proven. 2193 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2019-09-10 01:51:30,011 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:51:30,770 INFO L134 CoverageAnalysis]: Checked inductivity of 2464 backedges. 16 proven. 2177 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2019-09-10 01:51:30,774 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:51:30,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 18, 18] total 44 [2019-09-10 01:51:30,775 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:51:30,775 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-10 01:51:30,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-10 01:51:30,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=403, Invalid=1489, Unknown=0, NotChecked=0, Total=1892 [2019-09-10 01:51:30,776 INFO L87 Difference]: Start difference. First operand 95 states and 102 transitions. Second operand 28 states. [2019-09-10 01:51:33,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:51:33,532 INFO L93 Difference]: Finished difference Result 127 states and 136 transitions. [2019-09-10 01:51:33,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-09-10 01:51:33,534 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 94 [2019-09-10 01:51:33,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:51:33,535 INFO L225 Difference]: With dead ends: 127 [2019-09-10 01:51:33,535 INFO L226 Difference]: Without dead ends: 127 [2019-09-10 01:51:33,539 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3512 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1979, Invalid=11361, Unknown=0, NotChecked=0, Total=13340 [2019-09-10 01:51:33,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-09-10 01:51:33,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 115. [2019-09-10 01:51:33,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-09-10 01:51:33,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 123 transitions. [2019-09-10 01:51:33,547 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 123 transitions. Word has length 94 [2019-09-10 01:51:33,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:51:33,547 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 123 transitions. [2019-09-10 01:51:33,547 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-10 01:51:33,547 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 123 transitions. [2019-09-10 01:51:33,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-10 01:51:33,549 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:51:33,549 INFO L399 BasicCegarLoop]: trace histogram [80, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:51:33,550 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:51:33,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:51:33,550 INFO L82 PathProgramCache]: Analyzing trace with hash -352579535, now seen corresponding path program 10 times [2019-09-10 01:51:33,550 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:51:33,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:51:33,551 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:51:33,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:51:33,551 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:51:33,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:51:33,825 INFO L134 CoverageAnalysis]: Checked inductivity of 3892 backedges. 0 proven. 3452 refuted. 0 times theorem prover too weak. 440 trivial. 0 not checked. [2019-09-10 01:51:33,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:51:33,825 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:51:33,825 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:51:33,826 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:51:33,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:51:33,826 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:51:33,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:51:33,836 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 01:51:33,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:51:33,899 INFO L256 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-10 01:51:33,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:51:34,132 INFO L134 CoverageAnalysis]: Checked inductivity of 3892 backedges. 0 proven. 3506 refuted. 0 times theorem prover too weak. 386 trivial. 0 not checked. [2019-09-10 01:51:34,132 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:51:34,869 INFO L134 CoverageAnalysis]: Checked inductivity of 3892 backedges. 18 proven. 3488 refuted. 0 times theorem prover too weak. 386 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (11)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 01:51:34,881 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:51:34,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 20, 20] total 39 [2019-09-10 01:51:34,882 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:51:34,882 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 01:51:34,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 01:51:34,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=453, Invalid=1029, Unknown=0, NotChecked=0, Total=1482 [2019-09-10 01:51:34,883 INFO L87 Difference]: Start difference. First operand 115 states and 123 transitions. Second operand 21 states. [2019-09-10 01:51:35,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:51:35,426 INFO L93 Difference]: Finished difference Result 140 states and 150 transitions. [2019-09-10 01:51:35,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 01:51:35,426 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 114 [2019-09-10 01:51:35,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:51:35,429 INFO L225 Difference]: With dead ends: 140 [2019-09-10 01:51:35,429 INFO L226 Difference]: Without dead ends: 140 [2019-09-10 01:51:35,430 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 200 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=453, Invalid=1029, Unknown=0, NotChecked=0, Total=1482 [2019-09-10 01:51:35,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-09-10 01:51:35,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 128. [2019-09-10 01:51:35,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-09-10 01:51:35,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 137 transitions. [2019-09-10 01:51:35,441 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 137 transitions. Word has length 114 [2019-09-10 01:51:35,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:51:35,441 INFO L475 AbstractCegarLoop]: Abstraction has 128 states and 137 transitions. [2019-09-10 01:51:35,441 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 01:51:35,441 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 137 transitions. [2019-09-10 01:51:35,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-10 01:51:35,443 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:51:35,443 INFO L399 BasicCegarLoop]: trace histogram [90, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:51:35,443 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:51:35,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:51:35,444 INFO L82 PathProgramCache]: Analyzing trace with hash -535987528, now seen corresponding path program 11 times [2019-09-10 01:51:35,444 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:51:35,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:51:35,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:51:35,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:51:35,445 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:51:35,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:51:35,698 INFO L134 CoverageAnalysis]: Checked inductivity of 4932 backedges. 0 proven. 4437 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2019-09-10 01:51:35,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:51:35,698 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:51:35,698 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:51:35,698 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:51:35,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:51:35,698 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:51:35,710 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 01:51:35,710 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 01:52:36,989 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2019-09-10 01:52:36,990 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:52:37,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 62 conjunts are in the unsatisfiable core [2019-09-10 01:52:37,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:52:37,921 INFO L134 CoverageAnalysis]: Checked inductivity of 4932 backedges. 0 proven. 4546 refuted. 0 times theorem prover too weak. 386 trivial. 0 not checked. [2019-09-10 01:52:37,921 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:52:38,790 INFO L134 CoverageAnalysis]: Checked inductivity of 4932 backedges. 10 proven. 4482 refuted. 0 times theorem prover too weak. 440 trivial. 0 not checked. [2019-09-10 01:52:38,809 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:52:38,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 31, 22] total 52 [2019-09-10 01:52:38,809 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:52:38,810 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-10 01:52:38,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-10 01:52:38,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=759, Invalid=1893, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 01:52:38,812 INFO L87 Difference]: Start difference. First operand 128 states and 137 transitions. Second operand 32 states. [2019-09-10 01:52:39,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:52:39,680 INFO L93 Difference]: Finished difference Result 153 states and 164 transitions. [2019-09-10 01:52:39,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-10 01:52:39,683 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 127 [2019-09-10 01:52:39,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:52:39,685 INFO L225 Difference]: With dead ends: 153 [2019-09-10 01:52:39,685 INFO L226 Difference]: Without dead ends: 153 [2019-09-10 01:52:39,686 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 214 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1029 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=759, Invalid=1893, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 01:52:39,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-09-10 01:52:39,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 141. [2019-09-10 01:52:39,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-09-10 01:52:39,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 151 transitions. [2019-09-10 01:52:39,691 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 151 transitions. Word has length 127 [2019-09-10 01:52:39,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:52:39,692 INFO L475 AbstractCegarLoop]: Abstraction has 141 states and 151 transitions. [2019-09-10 01:52:39,692 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-10 01:52:39,692 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 151 transitions. [2019-09-10 01:52:39,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-10 01:52:39,694 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:52:39,694 INFO L399 BasicCegarLoop]: trace histogram [100, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:52:39,694 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:52:39,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:52:39,695 INFO L82 PathProgramCache]: Analyzing trace with hash 1611506577, now seen corresponding path program 12 times [2019-09-10 01:52:39,695 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:52:39,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:52:39,696 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:52:39,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:52:39,696 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:52:39,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:52:40,025 INFO L134 CoverageAnalysis]: Checked inductivity of 6095 backedges. 0 proven. 5545 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2019-09-10 01:52:40,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:52:40,026 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:52:40,026 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:52:40,026 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:52:40,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:52:40,027 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:52:40,045 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 01:52:40,045 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 01:52:40,127 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 01:52:40,127 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:52:40,130 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 45 conjunts are in the unsatisfiable core [2019-09-10 01:52:40,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:52:40,443 INFO L134 CoverageAnalysis]: Checked inductivity of 6095 backedges. 0 proven. 5600 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2019-09-10 01:52:40,443 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:52:40,764 INFO L134 CoverageAnalysis]: Checked inductivity of 6095 backedges. 0 proven. 5545 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2019-09-10 01:52:40,768 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:52:40,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 23, 13] total 35 [2019-09-10 01:52:40,769 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:52:40,769 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-10 01:52:40,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-10 01:52:40,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=340, Invalid=850, Unknown=0, NotChecked=0, Total=1190 [2019-09-10 01:52:40,770 INFO L87 Difference]: Start difference. First operand 141 states and 151 transitions. Second operand 24 states. [2019-09-10 01:52:41,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:52:41,279 INFO L93 Difference]: Finished difference Result 166 states and 178 transitions. [2019-09-10 01:52:41,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 01:52:41,279 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 140 [2019-09-10 01:52:41,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:52:41,281 INFO L225 Difference]: With dead ends: 166 [2019-09-10 01:52:41,281 INFO L226 Difference]: Without dead ends: 166 [2019-09-10 01:52:41,282 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 258 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=340, Invalid=850, Unknown=0, NotChecked=0, Total=1190 [2019-09-10 01:52:41,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-09-10 01:52:41,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 154. [2019-09-10 01:52:41,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-09-10 01:52:41,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 165 transitions. [2019-09-10 01:52:41,288 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 165 transitions. Word has length 140 [2019-09-10 01:52:41,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:52:41,289 INFO L475 AbstractCegarLoop]: Abstraction has 154 states and 165 transitions. [2019-09-10 01:52:41,289 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-10 01:52:41,289 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 165 transitions. [2019-09-10 01:52:41,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-10 01:52:41,291 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:52:41,291 INFO L399 BasicCegarLoop]: trace histogram [110, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:52:41,291 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:52:41,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:52:41,291 INFO L82 PathProgramCache]: Analyzing trace with hash -57777320, now seen corresponding path program 13 times [2019-09-10 01:52:41,292 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:52:41,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:52:41,292 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:52:41,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:52:41,293 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:52:41,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:52:41,650 INFO L134 CoverageAnalysis]: Checked inductivity of 7381 backedges. 0 proven. 6776 refuted. 0 times theorem prover too weak. 605 trivial. 0 not checked. [2019-09-10 01:52:41,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:52:41,651 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:52:41,651 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:52:41,651 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:52:41,651 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:52:41,651 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:52:41,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:52:41,686 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 01:52:41,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:52:41,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-10 01:52:41,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:52:41,916 INFO L134 CoverageAnalysis]: Checked inductivity of 7381 backedges. 0 proven. 6776 refuted. 0 times theorem prover too weak. 605 trivial. 0 not checked. [2019-09-10 01:52:41,917 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:52:42,370 INFO L134 CoverageAnalysis]: Checked inductivity of 7381 backedges. 0 proven. 6776 refuted. 0 times theorem prover too weak. 605 trivial. 0 not checked. [2019-09-10 01:52:42,374 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:52:42,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2019-09-10 01:52:42,375 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:52:42,375 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 01:52:42,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 01:52:42,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=483, Unknown=0, NotChecked=0, Total=702 [2019-09-10 01:52:42,376 INFO L87 Difference]: Start difference. First operand 154 states and 165 transitions. Second operand 15 states. [2019-09-10 01:52:42,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:52:42,620 INFO L93 Difference]: Finished difference Result 179 states and 192 transitions. [2019-09-10 01:52:42,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 01:52:42,620 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 153 [2019-09-10 01:52:42,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:52:42,622 INFO L225 Difference]: With dead ends: 179 [2019-09-10 01:52:42,622 INFO L226 Difference]: Without dead ends: 179 [2019-09-10 01:52:42,623 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 293 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=219, Invalid=483, Unknown=0, NotChecked=0, Total=702 [2019-09-10 01:52:42,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-09-10 01:52:42,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 167. [2019-09-10 01:52:42,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-09-10 01:52:42,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 179 transitions. [2019-09-10 01:52:42,632 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 179 transitions. Word has length 153 [2019-09-10 01:52:42,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:52:42,632 INFO L475 AbstractCegarLoop]: Abstraction has 167 states and 179 transitions. [2019-09-10 01:52:42,632 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 01:52:42,633 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 179 transitions. [2019-09-10 01:52:42,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-10 01:52:42,634 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:52:42,635 INFO L399 BasicCegarLoop]: trace histogram [120, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:52:42,635 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:52:42,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:52:42,636 INFO L82 PathProgramCache]: Analyzing trace with hash -1125925135, now seen corresponding path program 14 times [2019-09-10 01:52:42,636 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:52:42,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:52:42,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:52:42,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:52:42,638 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:52:42,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:52:43,049 INFO L134 CoverageAnalysis]: Checked inductivity of 8790 backedges. 0 proven. 8130 refuted. 0 times theorem prover too weak. 660 trivial. 0 not checked. [2019-09-10 01:52:43,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:52:43,050 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:52:43,050 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:52:43,050 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:52:43,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:52:43,050 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:52:43,068 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 01:52:43,068 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 01:57:09,823 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 53 check-sat command(s) [2019-09-10 01:57:09,824 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:57:09,880 INFO L256 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-10 01:57:09,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:57:09,976 INFO L134 CoverageAnalysis]: Checked inductivity of 8790 backedges. 0 proven. 8130 refuted. 0 times theorem prover too weak. 660 trivial. 0 not checked. [2019-09-10 01:57:09,976 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:57:10,397 INFO L134 CoverageAnalysis]: Checked inductivity of 8790 backedges. 0 proven. 8130 refuted. 0 times theorem prover too weak. 660 trivial. 0 not checked. [2019-09-10 01:57:10,416 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:57:10,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2019-09-10 01:57:10,416 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:57:10,417 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 01:57:10,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 01:57:10,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=562, Unknown=0, NotChecked=0, Total=812 [2019-09-10 01:57:10,421 INFO L87 Difference]: Start difference. First operand 167 states and 179 transitions. Second operand 16 states. [2019-09-10 01:57:10,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:57:10,674 INFO L93 Difference]: Finished difference Result 192 states and 206 transitions. [2019-09-10 01:57:10,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 01:57:10,675 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 166 [2019-09-10 01:57:10,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:57:10,677 INFO L225 Difference]: With dead ends: 192 [2019-09-10 01:57:10,677 INFO L226 Difference]: Without dead ends: 192 [2019-09-10 01:57:10,678 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 318 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=250, Invalid=562, Unknown=0, NotChecked=0, Total=812 [2019-09-10 01:57:10,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-09-10 01:57:10,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 180. [2019-09-10 01:57:10,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-09-10 01:57:10,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 193 transitions. [2019-09-10 01:57:10,681 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 193 transitions. Word has length 166 [2019-09-10 01:57:10,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:57:10,682 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 193 transitions. [2019-09-10 01:57:10,682 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 01:57:10,682 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 193 transitions. [2019-09-10 01:57:10,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-10 01:57:10,683 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:57:10,683 INFO L399 BasicCegarLoop]: trace histogram [130, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:57:10,683 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:57:10,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:57:10,684 INFO L82 PathProgramCache]: Analyzing trace with hash -1024998408, now seen corresponding path program 15 times [2019-09-10 01:57:10,684 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:57:10,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:57:10,685 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:57:10,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:57:10,685 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:57:10,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:57:11,130 INFO L134 CoverageAnalysis]: Checked inductivity of 10322 backedges. 0 proven. 9607 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2019-09-10 01:57:11,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:57:11,131 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:57:11,131 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:57:11,131 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:57:11,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:57:11,131 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 01:57:11,153 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 01:57:11,153 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:57:11,244 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 01:57:11,245 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:57:11,246 INFO L256 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-10 01:57:11,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:57:11,336 INFO L134 CoverageAnalysis]: Checked inductivity of 10322 backedges. 0 proven. 9607 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2019-09-10 01:57:11,336 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:57:11,857 INFO L134 CoverageAnalysis]: Checked inductivity of 10322 backedges. 0 proven. 9607 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2019-09-10 01:57:11,861 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:57:11,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2019-09-10 01:57:11,861 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:57:11,862 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 01:57:11,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 01:57:11,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=647, Unknown=0, NotChecked=0, Total=930 [2019-09-10 01:57:11,863 INFO L87 Difference]: Start difference. First operand 180 states and 193 transitions. Second operand 17 states. [2019-09-10 01:57:12,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:57:12,181 INFO L93 Difference]: Finished difference Result 205 states and 220 transitions. [2019-09-10 01:57:12,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 01:57:12,182 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 179 [2019-09-10 01:57:12,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:57:12,184 INFO L225 Difference]: With dead ends: 205 [2019-09-10 01:57:12,185 INFO L226 Difference]: Without dead ends: 205 [2019-09-10 01:57:12,185 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 343 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=283, Invalid=647, Unknown=0, NotChecked=0, Total=930 [2019-09-10 01:57:12,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-09-10 01:57:12,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 193. [2019-09-10 01:57:12,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-09-10 01:57:12,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 207 transitions. [2019-09-10 01:57:12,190 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 207 transitions. Word has length 179 [2019-09-10 01:57:12,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:57:12,190 INFO L475 AbstractCegarLoop]: Abstraction has 193 states and 207 transitions. [2019-09-10 01:57:12,190 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 01:57:12,191 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 207 transitions. [2019-09-10 01:57:12,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-09-10 01:57:12,192 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:57:12,192 INFO L399 BasicCegarLoop]: trace histogram [140, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:57:12,192 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:57:12,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:57:12,192 INFO L82 PathProgramCache]: Analyzing trace with hash 627335761, now seen corresponding path program 16 times [2019-09-10 01:57:12,193 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:57:12,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:57:12,193 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:57:12,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:57:12,194 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:57:12,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:57:12,625 INFO L134 CoverageAnalysis]: Checked inductivity of 11977 backedges. 0 proven. 11207 refuted. 0 times theorem prover too weak. 770 trivial. 0 not checked. [2019-09-10 01:57:12,625 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:57:12,625 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:57:12,626 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:57:12,626 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:57:12,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:57:12,626 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:57:12,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:57:12,640 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 01:57:12,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:57:12,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-10 01:57:12,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:57:12,816 INFO L134 CoverageAnalysis]: Checked inductivity of 11977 backedges. 0 proven. 11207 refuted. 0 times theorem prover too weak. 770 trivial. 0 not checked. [2019-09-10 01:57:12,816 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:57:13,347 INFO L134 CoverageAnalysis]: Checked inductivity of 11977 backedges. 0 proven. 11207 refuted. 0 times theorem prover too weak. 770 trivial. 0 not checked. [2019-09-10 01:57:13,351 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:57:13,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2019-09-10 01:57:13,351 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:57:13,351 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 01:57:13,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 01:57:13,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=318, Invalid=738, Unknown=0, NotChecked=0, Total=1056 [2019-09-10 01:57:13,352 INFO L87 Difference]: Start difference. First operand 193 states and 207 transitions. Second operand 18 states. [2019-09-10 01:57:13,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:57:13,737 INFO L93 Difference]: Finished difference Result 218 states and 234 transitions. [2019-09-10 01:57:13,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 01:57:13,741 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 192 [2019-09-10 01:57:13,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:57:13,742 INFO L225 Difference]: With dead ends: 218 [2019-09-10 01:57:13,742 INFO L226 Difference]: Without dead ends: 218 [2019-09-10 01:57:13,743 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 368 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=318, Invalid=738, Unknown=0, NotChecked=0, Total=1056 [2019-09-10 01:57:13,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-09-10 01:57:13,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 206. [2019-09-10 01:57:13,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-09-10 01:57:13,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 221 transitions. [2019-09-10 01:57:13,748 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 221 transitions. Word has length 192 [2019-09-10 01:57:13,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:57:13,748 INFO L475 AbstractCegarLoop]: Abstraction has 206 states and 221 transitions. [2019-09-10 01:57:13,748 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 01:57:13,748 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 221 transitions. [2019-09-10 01:57:13,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-09-10 01:57:13,749 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:57:13,750 INFO L399 BasicCegarLoop]: trace histogram [150, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:57:13,750 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:57:13,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:57:13,750 INFO L82 PathProgramCache]: Analyzing trace with hash 351509656, now seen corresponding path program 17 times [2019-09-10 01:57:13,750 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:57:13,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:57:13,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:57:13,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:57:13,751 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:57:13,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:57:14,199 INFO L134 CoverageAnalysis]: Checked inductivity of 13755 backedges. 0 proven. 12930 refuted. 0 times theorem prover too weak. 825 trivial. 0 not checked. [2019-09-10 01:57:14,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:57:14,199 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:57:14,199 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:57:14,199 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:57:14,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:57:14,200 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:57:14,220 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 01:57:14,220 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:04:23,161 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 66 check-sat command(s) [2019-09-10 02:04:23,161 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:04:24,299 INFO L256 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-10 02:04:24,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:04:24,416 INFO L134 CoverageAnalysis]: Checked inductivity of 13755 backedges. 0 proven. 12930 refuted. 0 times theorem prover too weak. 825 trivial. 0 not checked. [2019-09-10 02:04:24,417 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:04:25,052 INFO L134 CoverageAnalysis]: Checked inductivity of 13755 backedges. 0 proven. 12930 refuted. 0 times theorem prover too weak. 825 trivial. 0 not checked. [2019-09-10 02:04:25,065 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:04:25,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2019-09-10 02:04:25,065 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:04:25,066 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 02:04:25,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 02:04:25,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=355, Invalid=835, Unknown=0, NotChecked=0, Total=1190 [2019-09-10 02:04:25,067 INFO L87 Difference]: Start difference. First operand 206 states and 221 transitions. Second operand 19 states. [2019-09-10 02:04:25,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:25,480 INFO L93 Difference]: Finished difference Result 231 states and 248 transitions. [2019-09-10 02:04:25,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 02:04:25,481 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 205 [2019-09-10 02:04:25,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:25,483 INFO L225 Difference]: With dead ends: 231 [2019-09-10 02:04:25,484 INFO L226 Difference]: Without dead ends: 231 [2019-09-10 02:04:25,484 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 393 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=355, Invalid=835, Unknown=0, NotChecked=0, Total=1190 [2019-09-10 02:04:25,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2019-09-10 02:04:25,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 219. [2019-09-10 02:04:25,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-09-10 02:04:25,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 235 transitions. [2019-09-10 02:04:25,489 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 235 transitions. Word has length 205 [2019-09-10 02:04:25,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:25,489 INFO L475 AbstractCegarLoop]: Abstraction has 219 states and 235 transitions. [2019-09-10 02:04:25,490 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 02:04:25,490 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 235 transitions. [2019-09-10 02:04:25,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-09-10 02:04:25,491 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:25,491 INFO L399 BasicCegarLoop]: trace histogram [160, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:04:25,491 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:25,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:25,492 INFO L82 PathProgramCache]: Analyzing trace with hash 167087537, now seen corresponding path program 18 times [2019-09-10 02:04:25,492 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:25,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:25,493 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:04:25,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:25,493 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:25,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:26,016 INFO L134 CoverageAnalysis]: Checked inductivity of 15656 backedges. 0 proven. 14776 refuted. 0 times theorem prover too weak. 880 trivial. 0 not checked. [2019-09-10 02:04:26,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:04:26,016 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:04:26,017 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:04:26,017 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:04:26,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:04:26,017 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 02:04:26,044 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:04:26,045 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:04:26,162 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:04:26,162 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:04:26,164 INFO L256 TraceCheckSpWp]: Trace formula consists of 600 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-10 02:04:26,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:04:26,274 INFO L134 CoverageAnalysis]: Checked inductivity of 15656 backedges. 0 proven. 14776 refuted. 0 times theorem prover too weak. 880 trivial. 0 not checked. [2019-09-10 02:04:26,274 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:04:26,975 INFO L134 CoverageAnalysis]: Checked inductivity of 15656 backedges. 0 proven. 14776 refuted. 0 times theorem prover too weak. 880 trivial. 0 not checked. [2019-09-10 02:04:26,979 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:04:26,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2019-09-10 02:04:26,980 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:04:26,980 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 02:04:26,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 02:04:26,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=394, Invalid=938, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 02:04:26,981 INFO L87 Difference]: Start difference. First operand 219 states and 235 transitions. Second operand 20 states. [2019-09-10 02:04:27,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:27,436 INFO L93 Difference]: Finished difference Result 244 states and 262 transitions. [2019-09-10 02:04:27,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 02:04:27,436 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 218 [2019-09-10 02:04:27,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:27,439 INFO L225 Difference]: With dead ends: 244 [2019-09-10 02:04:27,439 INFO L226 Difference]: Without dead ends: 244 [2019-09-10 02:04:27,440 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 455 GetRequests, 418 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=394, Invalid=938, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 02:04:27,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2019-09-10 02:04:27,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 232. [2019-09-10 02:04:27,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-09-10 02:04:27,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 249 transitions. [2019-09-10 02:04:27,450 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 249 transitions. Word has length 218 [2019-09-10 02:04:27,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:27,451 INFO L475 AbstractCegarLoop]: Abstraction has 232 states and 249 transitions. [2019-09-10 02:04:27,451 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 02:04:27,451 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 249 transitions. [2019-09-10 02:04:27,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-09-10 02:04:27,452 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:27,452 INFO L399 BasicCegarLoop]: trace histogram [170, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:04:27,453 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:27,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:27,455 INFO L82 PathProgramCache]: Analyzing trace with hash -670307016, now seen corresponding path program 19 times [2019-09-10 02:04:27,455 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:27,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:27,456 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:04:27,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:27,456 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:27,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:28,071 INFO L134 CoverageAnalysis]: Checked inductivity of 17680 backedges. 0 proven. 16745 refuted. 0 times theorem prover too weak. 935 trivial. 0 not checked. [2019-09-10 02:04:28,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:04:28,071 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:04:28,071 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:04:28,072 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:04:28,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:04:28,072 INFO 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) [2019-09-10 02:04:28,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:28,086 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:04:28,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:28,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 636 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-10 02:04:28,205 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:04:28,339 INFO L134 CoverageAnalysis]: Checked inductivity of 17680 backedges. 0 proven. 16745 refuted. 0 times theorem prover too weak. 935 trivial. 0 not checked. [2019-09-10 02:04:28,339 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:04:29,098 INFO L134 CoverageAnalysis]: Checked inductivity of 17680 backedges. 0 proven. 16745 refuted. 0 times theorem prover too weak. 935 trivial. 0 not checked. [2019-09-10 02:04:29,102 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:04:29,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2019-09-10 02:04:29,102 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:04:29,103 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 02:04:29,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 02:04:29,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=1047, Unknown=0, NotChecked=0, Total=1482 [2019-09-10 02:04:29,104 INFO L87 Difference]: Start difference. First operand 232 states and 249 transitions. Second operand 21 states. [2019-09-10 02:04:29,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:29,628 INFO L93 Difference]: Finished difference Result 257 states and 276 transitions. [2019-09-10 02:04:29,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 02:04:29,628 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 231 [2019-09-10 02:04:29,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:29,631 INFO L225 Difference]: With dead ends: 257 [2019-09-10 02:04:29,631 INFO L226 Difference]: Without dead ends: 257 [2019-09-10 02:04:29,632 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 482 GetRequests, 443 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=435, Invalid=1047, Unknown=0, NotChecked=0, Total=1482 [2019-09-10 02:04:29,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2019-09-10 02:04:29,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 245. [2019-09-10 02:04:29,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-09-10 02:04:29,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 263 transitions. [2019-09-10 02:04:29,639 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 263 transitions. Word has length 231 [2019-09-10 02:04:29,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:29,639 INFO L475 AbstractCegarLoop]: Abstraction has 245 states and 263 transitions. [2019-09-10 02:04:29,639 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 02:04:29,640 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 263 transitions. [2019-09-10 02:04:29,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-09-10 02:04:29,641 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:29,641 INFO L399 BasicCegarLoop]: trace histogram [180, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:04:29,641 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:29,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:29,642 INFO L82 PathProgramCache]: Analyzing trace with hash -2021834479, now seen corresponding path program 20 times [2019-09-10 02:04:29,642 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:29,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:29,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:29,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:29,643 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:29,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:30,413 INFO L134 CoverageAnalysis]: Checked inductivity of 19827 backedges. 0 proven. 18837 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-09-10 02:04:30,414 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:04:30,414 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:04:30,414 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:04:30,416 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:04:30,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:04:30,416 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:04:30,452 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:04:30,453 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP)