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/simple_1-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 01:53:44,832 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 01:53:44,834 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 01:53:44,848 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 01:53:44,849 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 01:53:44,850 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 01:53:44,851 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 01:53:44,853 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 01:53:44,855 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 01:53:44,856 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 01:53:44,857 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 01:53:44,859 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 01:53:44,859 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 01:53:44,860 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 01:53:44,861 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 01:53:44,862 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 01:53:44,863 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 01:53:44,864 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 01:53:44,866 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 01:53:44,868 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 01:53:44,870 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 01:53:44,872 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 01:53:44,873 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 01:53:44,874 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 01:53:44,877 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 01:53:44,877 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 01:53:44,877 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 01:53:44,878 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 01:53:44,879 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 01:53:44,880 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 01:53:44,880 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 01:53:44,881 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 01:53:44,882 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 01:53:44,883 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 01:53:44,884 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 01:53:44,884 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 01:53:44,885 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 01:53:44,885 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 01:53:44,885 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 01:53:44,886 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 01:53:44,887 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 01:53:44,888 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:53:44,909 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 01:53:44,909 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 01:53:44,910 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 01:53:44,910 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 01:53:44,911 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 01:53:44,911 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 01:53:44,911 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 01:53:44,911 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 01:53:44,911 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 01:53:44,912 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 01:53:44,912 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 01:53:44,913 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 01:53:44,913 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 01:53:44,913 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 01:53:44,913 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 01:53:44,913 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 01:53:44,914 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 01:53:44,914 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 01:53:44,914 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 01:53:44,914 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 01:53:44,914 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 01:53:44,915 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 01:53:44,915 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 01:53:44,915 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 01:53:44,915 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 01:53:44,915 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 01:53:44,916 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 01:53:44,916 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 01:53:44,916 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 01:53:44,916 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 01:53:44,959 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 01:53:44,973 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 01:53:44,977 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 01:53:44,978 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 01:53:44,979 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 01:53:44,980 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/simple_1-1.c [2019-09-10 01:53:45,052 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48f63ac79/ff01764666094624ad2a6bc2a8749446/FLAG7ad7b9210 [2019-09-10 01:53:45,483 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 01:53:45,484 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/simple_1-1.c [2019-09-10 01:53:45,495 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48f63ac79/ff01764666094624ad2a6bc2a8749446/FLAG7ad7b9210 [2019-09-10 01:53:45,899 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48f63ac79/ff01764666094624ad2a6bc2a8749446 [2019-09-10 01:53:45,909 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 01:53:45,911 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 01:53:45,912 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 01:53:45,912 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 01:53:45,916 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 01:53:45,917 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 01:53:45" (1/1) ... [2019-09-10 01:53:45,920 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19027eb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:53:45, skipping insertion in model container [2019-09-10 01:53:45,920 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 01:53:45" (1/1) ... [2019-09-10 01:53:45,928 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 01:53:45,945 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 01:53:46,187 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 01:53:46,193 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 01:53:46,211 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 01:53:46,230 INFO L192 MainTranslator]: Completed translation [2019-09-10 01:53:46,231 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:53:46 WrapperNode [2019-09-10 01:53:46,231 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 01:53:46,232 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 01:53:46,232 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 01:53:46,232 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 01:53:46,359 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:53:46" (1/1) ... [2019-09-10 01:53:46,362 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:53:46" (1/1) ... [2019-09-10 01:53:46,367 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:53:46" (1/1) ... [2019-09-10 01:53:46,368 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:53:46" (1/1) ... [2019-09-10 01:53:46,377 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:53:46" (1/1) ... [2019-09-10 01:53:46,383 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:53:46" (1/1) ... [2019-09-10 01:53:46,384 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:53:46" (1/1) ... [2019-09-10 01:53:46,393 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 01:53:46,394 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 01:53:46,394 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 01:53:46,394 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 01:53:46,395 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:53:46" (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:53:46,453 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 01:53:46,453 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 01:53:46,453 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-10 01:53:46,453 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 01:53:46,453 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 01:53:46,453 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-10 01:53:46,454 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 01:53:46,454 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 01:53:46,454 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 01:53:46,615 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 01:53:46,615 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-10 01:53:46,616 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 01:53:46 BoogieIcfgContainer [2019-09-10 01:53:46,617 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 01:53:46,618 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 01:53:46,618 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 01:53:46,621 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 01:53:46,622 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 01:53:45" (1/3) ... [2019-09-10 01:53:46,623 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fa34ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 01:53:46, skipping insertion in model container [2019-09-10 01:53:46,623 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:53:46" (2/3) ... [2019-09-10 01:53:46,623 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fa34ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 01:53:46, skipping insertion in model container [2019-09-10 01:53:46,623 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 01:53:46" (3/3) ... [2019-09-10 01:53:46,625 INFO L109 eAbstractionObserver]: Analyzing ICFG simple_1-1.c [2019-09-10 01:53:46,635 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 01:53:46,643 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 01:53:46,660 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 01:53:46,687 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 01:53:46,688 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 01:53:46,688 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 01:53:46,688 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 01:53:46,688 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 01:53:46,688 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 01:53:46,688 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 01:53:46,689 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 01:53:46,705 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2019-09-10 01:53:46,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-10 01:53:46,714 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:53:46,716 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:53:46,718 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:53:46,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:53:46,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1846144830, now seen corresponding path program 1 times [2019-09-10 01:53:46,727 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:53:46,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:53:46,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:53:46,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:53:46,776 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:53:46,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:53:46,936 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:53:46,938 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:53:46,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 01:53:46,939 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:53:46,944 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 01:53:46,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 01:53:46,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 01:53:46,971 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 3 states. [2019-09-10 01:53:47,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:53:47,018 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-09-10 01:53:47,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 01:53:47,021 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-09-10 01:53:47,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:53:47,032 INFO L225 Difference]: With dead ends: 18 [2019-09-10 01:53:47,032 INFO L226 Difference]: Without dead ends: 12 [2019-09-10 01:53:47,034 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:53:47,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-09-10 01:53:47,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-09-10 01:53:47,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-09-10 01:53:47,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-09-10 01:53:47,075 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-09-10 01:53:47,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:53:47,075 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-09-10 01:53:47,075 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 01:53:47,076 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-09-10 01:53:47,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-09-10 01:53:47,076 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:53:47,077 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:53:47,077 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:53:47,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:53:47,078 INFO L82 PathProgramCache]: Analyzing trace with hash 1432376145, now seen corresponding path program 1 times [2019-09-10 01:53:47,078 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:53:47,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:53:47,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:53:47,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:53:47,080 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:53:47,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:53:47,222 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:53:47,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:53:47,222 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:53:47,223 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 12 with the following transitions: [2019-09-10 01:53:47,225 INFO L207 CegarAbsIntRunner]: [0], [4], [11], [13], [19], [22], [24], [30], [31], [32], [34] [2019-09-10 01:53:47,257 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 01:53:47,257 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 01:53:47,316 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 01:53:47,612 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 01:53:47,615 INFO L272 AbstractInterpreter]: Visited 11 different actions 47 times. Merged at 2 different actions 12 times. Widened at 1 different actions 4 times. Performed 66 root evaluator evaluations with a maximum evaluation depth of 12. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 12. Found 1 fixpoints after 1 different actions. Largest state had 2 variables. [2019-09-10 01:53:47,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:53:47,620 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 01:53:47,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:53:47,621 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:53:47,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:53:47,640 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:53:47,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:53:47,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-10 01:53:47,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:53:47,734 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:53:47,735 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:53:47,784 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:53:47,791 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:53:47,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2019-09-10 01:53:47,792 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:53:47,793 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 01:53:47,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 01:53:47,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-09-10 01:53:47,795 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 5 states. [2019-09-10 01:53:47,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:53:47,835 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-09-10 01:53:47,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 01:53:47,838 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-09-10 01:53:47,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:53:47,839 INFO L225 Difference]: With dead ends: 13 [2019-09-10 01:53:47,839 INFO L226 Difference]: Without dead ends: 13 [2019-09-10 01:53:47,840 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-09-10 01:53:47,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-09-10 01:53:47,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-09-10 01:53:47,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-09-10 01:53:47,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-09-10 01:53:47,847 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-09-10 01:53:47,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:53:47,850 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-09-10 01:53:47,850 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 01:53:47,850 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-09-10 01:53:47,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-10 01:53:47,851 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:53:47,852 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:53:47,853 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:53:47,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:53:47,854 INFO L82 PathProgramCache]: Analyzing trace with hash 1490448798, now seen corresponding path program 2 times [2019-09-10 01:53:47,855 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:53:47,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:53:47,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:53:47,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:53:47,860 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:53:47,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:53:48,000 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:53:48,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:53:48,001 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:53:48,001 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:53:48,002 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:53:48,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:53:48,002 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:53:48,048 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 01:53:48,048 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 01:53:48,062 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-09-10 01:53:48,062 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:53:48,063 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-10 01:53:48,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:53:48,091 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:53:48,091 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:53:48,145 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:53:48,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:53:48,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2019-09-10 01:53:48,150 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:53:48,150 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 01:53:48,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 01:53:48,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-09-10 01:53:48,152 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 6 states. [2019-09-10 01:53:48,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:53:48,179 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-09-10 01:53:48,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 01:53:48,180 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2019-09-10 01:53:48,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:53:48,181 INFO L225 Difference]: With dead ends: 14 [2019-09-10 01:53:48,181 INFO L226 Difference]: Without dead ends: 14 [2019-09-10 01:53:48,182 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-09-10 01:53:48,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-09-10 01:53:48,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-09-10 01:53:48,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-09-10 01:53:48,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-09-10 01:53:48,185 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-09-10 01:53:48,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:53:48,185 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-09-10 01:53:48,185 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 01:53:48,185 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-09-10 01:53:48,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-10 01:53:48,186 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:53:48,186 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:53:48,187 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:53:48,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:53:48,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1004266255, now seen corresponding path program 3 times [2019-09-10 01:53:48,187 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:53:48,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:53:48,188 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:53:48,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:53:48,189 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:53:48,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:53:48,282 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:53:48,282 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:53:48,282 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:53:48,283 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:53:48,283 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:53:48,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:53:48,283 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:53:48,305 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 01:53:48,306 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 01:53:48,316 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 01:53:48,317 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:53:48,317 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-10 01:53:48,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:53:48,345 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:53:48,346 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:53:48,425 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:53:48,429 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:53:48,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2019-09-10 01:53:48,429 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:53:48,430 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 01:53:48,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 01:53:48,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-09-10 01:53:48,431 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 7 states. [2019-09-10 01:53:48,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:53:48,473 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-09-10 01:53:48,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 01:53:48,474 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2019-09-10 01:53:48,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:53:48,474 INFO L225 Difference]: With dead ends: 15 [2019-09-10 01:53:48,474 INFO L226 Difference]: Without dead ends: 15 [2019-09-10 01:53:48,475 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-09-10 01:53:48,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-09-10 01:53:48,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-09-10 01:53:48,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-09-10 01:53:48,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-09-10 01:53:48,478 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-09-10 01:53:48,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:53:48,478 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-09-10 01:53:48,478 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 01:53:48,478 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-09-10 01:53:48,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-10 01:53:48,479 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:53:48,479 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:53:48,479 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:53:48,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:53:48,480 INFO L82 PathProgramCache]: Analyzing trace with hash -1031021570, now seen corresponding path program 4 times [2019-09-10 01:53:48,480 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:53:48,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:53:48,481 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:53:48,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:53:48,481 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:53:48,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:53:48,604 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:53:48,604 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:53:48,604 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:53:48,604 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:53:48,604 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:53:48,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:53:48,605 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:53:48,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:53:48,630 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:53:48,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:53:48,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-10 01:53:48,649 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:53:48,678 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:53:48,678 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:53:48,831 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:53:48,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:53:48,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2019-09-10 01:53:48,839 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:53:48,840 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 01:53:48,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 01:53:48,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-09-10 01:53:48,840 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 8 states. [2019-09-10 01:53:48,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:53:48,885 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-09-10 01:53:48,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 01:53:48,885 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-09-10 01:53:48,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:53:48,886 INFO L225 Difference]: With dead ends: 16 [2019-09-10 01:53:48,886 INFO L226 Difference]: Without dead ends: 16 [2019-09-10 01:53:48,886 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-09-10 01:53:48,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-09-10 01:53:48,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-09-10 01:53:48,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-09-10 01:53:48,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-09-10 01:53:48,889 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-09-10 01:53:48,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:53:48,890 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-09-10 01:53:48,890 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 01:53:48,890 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-09-10 01:53:48,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-10 01:53:48,890 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:53:48,891 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:53:48,891 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:53:48,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:53:48,891 INFO L82 PathProgramCache]: Analyzing trace with hash -1860436335, now seen corresponding path program 5 times [2019-09-10 01:53:48,891 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:53:48,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:53:48,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:53:48,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:53:48,893 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:53:48,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:53:49,014 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:53:49,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:53:49,014 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:53:49,015 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:53:49,015 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:53:49,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:53:49,015 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 01:53:49,029 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 01:53:49,029 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:53:49,056 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-10 01:53:49,057 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:53:49,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-10 01:53:49,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:53:49,087 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:53:49,087 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:53:49,287 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:53:49,291 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:53:49,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2019-09-10 01:53:49,292 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:53:49,292 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 01:53:49,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 01:53:49,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-09-10 01:53:49,293 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 9 states. [2019-09-10 01:53:49,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:53:49,363 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-09-10 01:53:49,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 01:53:49,364 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-09-10 01:53:49,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:53:49,365 INFO L225 Difference]: With dead ends: 17 [2019-09-10 01:53:49,365 INFO L226 Difference]: Without dead ends: 17 [2019-09-10 01:53:49,365 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-09-10 01:53:49,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-09-10 01:53:49,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-09-10 01:53:49,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-09-10 01:53:49,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-09-10 01:53:49,369 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-09-10 01:53:49,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:53:49,369 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-09-10 01:53:49,369 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 01:53:49,369 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-09-10 01:53:49,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-10 01:53:49,370 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:53:49,370 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:53:49,370 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:53:49,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:53:49,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1802490274, now seen corresponding path program 6 times [2019-09-10 01:53:49,371 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:53:49,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:53:49,372 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:53:49,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:53:49,372 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:53:49,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:53:49,504 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:53:49,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:53:49,505 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:53:49,505 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:53:49,505 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:53:49,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:53:49,506 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:53:49,535 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 01:53:49,535 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 01:53:49,549 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 01:53:49,550 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:53:49,550 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-10 01:53:49,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:53:49,576 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:53:49,576 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:53:49,768 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:53:49,773 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:53:49,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2019-09-10 01:53:49,773 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:53:49,773 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 01:53:49,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 01:53:49,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2019-09-10 01:53:49,774 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 10 states. [2019-09-10 01:53:49,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:53:49,841 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-09-10 01:53:49,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 01:53:49,842 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-09-10 01:53:49,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:53:49,842 INFO L225 Difference]: With dead ends: 18 [2019-09-10 01:53:49,843 INFO L226 Difference]: Without dead ends: 18 [2019-09-10 01:53:49,843 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2019-09-10 01:53:49,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-09-10 01:53:49,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-09-10 01:53:49,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-09-10 01:53:49,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-09-10 01:53:49,846 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-09-10 01:53:49,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:53:49,847 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-09-10 01:53:49,847 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 01:53:49,847 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-09-10 01:53:49,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-10 01:53:49,847 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:53:49,848 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:53:49,848 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:53:49,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:53:49,848 INFO L82 PathProgramCache]: Analyzing trace with hash -6162383, now seen corresponding path program 7 times [2019-09-10 01:53:49,848 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:53:49,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:53:49,849 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:53:49,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:53:49,850 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:53:49,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:53:49,989 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:53:49,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:53:49,989 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:53:49,990 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:53:49,990 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:53:49,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:53:49,990 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:53:50,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:53:50,007 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 01:53:50,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:53:50,016 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-10 01:53:50,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:53:50,077 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:53:50,077 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:53:50,309 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:53:50,313 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:53:50,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2019-09-10 01:53:50,314 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:53:50,314 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 01:53:50,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 01:53:50,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2019-09-10 01:53:50,315 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 11 states. [2019-09-10 01:53:50,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:53:50,428 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-09-10 01:53:50,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 01:53:50,428 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 17 [2019-09-10 01:53:50,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:53:50,429 INFO L225 Difference]: With dead ends: 19 [2019-09-10 01:53:50,430 INFO L226 Difference]: Without dead ends: 19 [2019-09-10 01:53:50,430 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2019-09-10 01:53:50,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-09-10 01:53:50,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-09-10 01:53:50,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-09-10 01:53:50,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-09-10 01:53:50,433 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-09-10 01:53:50,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:53:50,434 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-09-10 01:53:50,434 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 01:53:50,434 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-09-10 01:53:50,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-10 01:53:50,434 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:53:50,435 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:53:50,435 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:53:50,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:53:50,435 INFO L82 PathProgramCache]: Analyzing trace with hash -154572610, now seen corresponding path program 8 times [2019-09-10 01:53:50,435 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:53:50,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:53:50,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:53:50,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:53:50,436 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:53:50,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:53:50,568 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:53:50,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:53:50,569 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:53:50,569 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:53:50,569 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:53:50,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:53:50,569 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:53:50,585 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 01:53:50,585 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 01:53:50,607 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-09-10 01:53:50,607 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:53:50,609 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-10 01:53:50,610 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:53:50,642 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:53:50,643 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:53:50,889 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:53:50,894 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:53:50,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2019-09-10 01:53:50,895 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:53:50,895 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 01:53:50,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 01:53:50,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2019-09-10 01:53:50,896 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 12 states. [2019-09-10 01:53:51,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:53:51,032 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-09-10 01:53:51,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 01:53:51,033 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2019-09-10 01:53:51,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:53:51,034 INFO L225 Difference]: With dead ends: 20 [2019-09-10 01:53:51,034 INFO L226 Difference]: Without dead ends: 20 [2019-09-10 01:53:51,034 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2019-09-10 01:53:51,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-09-10 01:53:51,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-09-10 01:53:51,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-09-10 01:53:51,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-09-10 01:53:51,037 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-09-10 01:53:51,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:53:51,038 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-09-10 01:53:51,038 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 01:53:51,038 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-09-10 01:53:51,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-10 01:53:51,039 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:53:51,039 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:53:51,039 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:53:51,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:53:51,039 INFO L82 PathProgramCache]: Analyzing trace with hash -460322351, now seen corresponding path program 9 times [2019-09-10 01:53:51,039 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:53:51,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:53:51,040 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:53:51,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:53:51,041 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:53:51,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:53:51,266 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:53:51,266 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:53:51,266 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:53:51,266 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:53:51,266 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:53:51,266 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:53:51,266 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:53:51,277 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 01:53:51,278 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 01:53:51,287 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 01:53:51,287 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:53:51,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-10 01:53:51,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:53:51,321 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:53:51,322 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:53:51,619 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:53:51,622 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:53:51,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2019-09-10 01:53:51,622 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:53:51,622 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 01:53:51,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 01:53:51,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2019-09-10 01:53:51,624 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 13 states. [2019-09-10 01:53:51,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:53:51,751 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-09-10 01:53:51,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 01:53:51,753 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 19 [2019-09-10 01:53:51,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:53:51,754 INFO L225 Difference]: With dead ends: 21 [2019-09-10 01:53:51,754 INFO L226 Difference]: Without dead ends: 21 [2019-09-10 01:53:51,754 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2019-09-10 01:53:51,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-09-10 01:53:51,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-09-10 01:53:51,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-09-10 01:53:51,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-09-10 01:53:51,757 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-09-10 01:53:51,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:53:51,758 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-09-10 01:53:51,758 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 01:53:51,758 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-09-10 01:53:51,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-10 01:53:51,758 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:53:51,759 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:53:51,759 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:53:51,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:53:51,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1348629730, now seen corresponding path program 10 times [2019-09-10 01:53:51,759 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:53:51,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:53:51,760 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:53:51,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:53:51,760 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:53:51,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:53:51,940 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:53:51,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:53:51,940 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:53:51,940 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:53:51,941 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:53:51,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:53:51,941 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:53:51,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:53:51,967 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 01:53:51,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:53:51,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-10 01:53:51,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:53:52,017 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:53:52,017 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:53:52,355 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:53:52,359 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:53:52,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2019-09-10 01:53:52,359 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:53:52,359 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 01:53:52,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 01:53:52,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2019-09-10 01:53:52,360 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 14 states. [2019-09-10 01:53:52,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:53:52,520 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-09-10 01:53:52,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 01:53:52,522 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 20 [2019-09-10 01:53:52,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:53:52,523 INFO L225 Difference]: With dead ends: 22 [2019-09-10 01:53:52,523 INFO L226 Difference]: Without dead ends: 22 [2019-09-10 01:53:52,524 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2019-09-10 01:53:52,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-09-10 01:53:52,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-09-10 01:53:52,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-09-10 01:53:52,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-09-10 01:53:52,527 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-09-10 01:53:52,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:53:52,527 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-09-10 01:53:52,527 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-10 01:53:52,528 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-09-10 01:53:52,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-10 01:53:52,528 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:53:52,528 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:53:52,528 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:53:52,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:53:52,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1178612593, now seen corresponding path program 11 times [2019-09-10 01:53:52,529 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:53:52,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:53:52,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:53:52,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:53:52,530 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:53:52,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:53:52,792 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:53:52,792 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:53:52,793 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:53:52,793 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:53:52,793 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:53:52,793 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:53:52,794 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) [2019-09-10 01:53:52,826 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 01:53:52,826 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:53:53,026 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-09-10 01:53:53,027 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:53:53,028 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-10 01:53:53,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:53:53,111 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:53:53,111 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:53:53,493 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:53:53,497 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:53:53,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2019-09-10 01:53:53,497 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:53:53,498 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 01:53:53,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 01:53:53,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=483, Unknown=0, NotChecked=0, Total=702 [2019-09-10 01:53:53,499 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 15 states. [2019-09-10 01:53:53,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:53:53,667 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-09-10 01:53:53,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 01:53:53,668 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 21 [2019-09-10 01:53:53,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:53:53,668 INFO L225 Difference]: With dead ends: 23 [2019-09-10 01:53:53,668 INFO L226 Difference]: Without dead ends: 23 [2019-09-10 01:53:53,669 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=219, Invalid=483, Unknown=0, NotChecked=0, Total=702 [2019-09-10 01:53:53,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-09-10 01:53:53,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-09-10 01:53:53,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-10 01:53:53,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-09-10 01:53:53,672 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-09-10 01:53:53,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:53:53,672 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-09-10 01:53:53,673 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 01:53:53,673 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-09-10 01:53:53,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-10 01:53:53,673 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:53:53,673 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:53:53,673 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:53:53,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:53:53,674 INFO L82 PathProgramCache]: Analyzing trace with hash -2081254018, now seen corresponding path program 12 times [2019-09-10 01:53:53,674 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:53:53,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:53:53,675 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:53:53,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:53:53,675 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:53:53,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:53:53,879 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:53:53,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:53:53,879 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:53:53,879 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:53:53,879 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:53:53,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:53:53,879 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:53:53,890 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 01:53:53,890 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 01:53:53,904 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 01:53:53,904 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:53:53,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-10 01:53:53,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:53:53,946 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:53:53,946 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:53:54,405 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:53:54,409 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:53:54,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2019-09-10 01:53:54,409 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:53:54,409 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 01:53:54,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 01:53:54,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=562, Unknown=0, NotChecked=0, Total=812 [2019-09-10 01:53:54,411 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 16 states. [2019-09-10 01:53:54,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:53:54,620 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-09-10 01:53:54,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 01:53:54,621 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-09-10 01:53:54,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:53:54,622 INFO L225 Difference]: With dead ends: 24 [2019-09-10 01:53:54,623 INFO L226 Difference]: Without dead ends: 24 [2019-09-10 01:53:54,623 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=250, Invalid=562, Unknown=0, NotChecked=0, Total=812 [2019-09-10 01:53:54,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-09-10 01:53:54,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-09-10 01:53:54,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-09-10 01:53:54,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-09-10 01:53:54,627 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-09-10 01:53:54,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:53:54,627 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-09-10 01:53:54,627 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 01:53:54,627 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-09-10 01:53:54,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-10 01:53:54,628 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:53:54,628 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:53:54,629 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:53:54,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:53:54,629 INFO L82 PathProgramCache]: Analyzing trace with hash -57903855, now seen corresponding path program 13 times [2019-09-10 01:53:54,629 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:53:54,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:53:54,630 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:53:54,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:53:54,631 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:53:54,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:53:54,916 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:53:54,917 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:53:54,917 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:53:54,917 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:53:54,917 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:53:54,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:53:54,918 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:53:54,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:53:54,940 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 01:53:54,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:53:54,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-10 01:53:54,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:53:54,986 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:53:54,986 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:53:55,510 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:53:55,513 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:53:55,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2019-09-10 01:53:55,514 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:53:55,514 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 01:53:55,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 01:53:55,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=647, Unknown=0, NotChecked=0, Total=930 [2019-09-10 01:53:55,515 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 17 states. [2019-09-10 01:53:55,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:53:55,743 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-09-10 01:53:55,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 01:53:55,745 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 23 [2019-09-10 01:53:55,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:53:55,746 INFO L225 Difference]: With dead ends: 25 [2019-09-10 01:53:55,746 INFO L226 Difference]: Without dead ends: 25 [2019-09-10 01:53:55,747 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 31 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:53:55,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-09-10 01:53:55,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-09-10 01:53:55,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-09-10 01:53:55,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-09-10 01:53:55,752 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2019-09-10 01:53:55,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:53:55,752 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-09-10 01:53:55,752 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 01:53:55,753 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-09-10 01:53:55,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-10 01:53:55,753 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:53:55,753 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:53:55,754 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:53:55,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:53:55,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1758558242, now seen corresponding path program 14 times [2019-09-10 01:53:55,754 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:53:55,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:53:55,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:53:55,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:53:55,755 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:53:55,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:53:56,001 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:53:56,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:53:56,001 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:53:56,001 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:53:56,001 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:53:56,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:53:56,002 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:53:56,013 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 01:53:56,013 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 01:54:22,714 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-09-10 01:54:22,714 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:54:23,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-10 01:54:23,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:54:23,443 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:54:23,443 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:54:23,979 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:54:23,986 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:54:23,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2019-09-10 01:54:23,986 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:54:23,987 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 01:54:23,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 01:54:23,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=318, Invalid=738, Unknown=0, NotChecked=0, Total=1056 [2019-09-10 01:54:23,988 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 18 states. [2019-09-10 01:54:24,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:54:24,250 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-09-10 01:54:24,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 01:54:24,252 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 24 [2019-09-10 01:54:24,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:54:24,252 INFO L225 Difference]: With dead ends: 26 [2019-09-10 01:54:24,253 INFO L226 Difference]: Without dead ends: 26 [2019-09-10 01:54:24,253 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 32 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:54:24,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-09-10 01:54:24,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-09-10 01:54:24,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-09-10 01:54:24,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-09-10 01:54:24,256 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2019-09-10 01:54:24,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:54:24,256 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-09-10 01:54:24,256 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 01:54:24,257 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-09-10 01:54:24,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-10 01:54:24,257 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:54:24,257 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:54:24,258 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:54:24,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:54:24,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1355730609, now seen corresponding path program 15 times [2019-09-10 01:54:24,258 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:54:24,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:54:24,259 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:54:24,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:54:24,259 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:54:24,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:54:24,552 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:54:24,553 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:54:24,553 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:54:24,553 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:54:24,553 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:54:24,553 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:54:24,554 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:54:24,570 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 01:54:24,571 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 01:54:24,583 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 01:54:24,583 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:54:24,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-10 01:54:24,585 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:54:24,619 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:54:24,620 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:54:25,252 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:54:25,256 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:54:25,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2019-09-10 01:54:25,256 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:54:25,256 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 01:54:25,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 01:54:25,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=355, Invalid=835, Unknown=0, NotChecked=0, Total=1190 [2019-09-10 01:54:25,257 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 19 states. [2019-09-10 01:54:25,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:54:25,554 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-09-10 01:54:25,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 01:54:25,557 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 25 [2019-09-10 01:54:25,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:54:25,558 INFO L225 Difference]: With dead ends: 27 [2019-09-10 01:54:25,558 INFO L226 Difference]: Without dead ends: 27 [2019-09-10 01:54:25,559 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=355, Invalid=835, Unknown=0, NotChecked=0, Total=1190 [2019-09-10 01:54:25,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-09-10 01:54:25,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-09-10 01:54:25,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-10 01:54:25,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-09-10 01:54:25,562 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2019-09-10 01:54:25,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:54:25,562 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-09-10 01:54:25,563 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 01:54:25,563 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-09-10 01:54:25,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-10 01:54:25,563 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:54:25,564 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:54:25,564 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:54:25,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:54:25,564 INFO L82 PathProgramCache]: Analyzing trace with hash -885562818, now seen corresponding path program 16 times [2019-09-10 01:54:25,564 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:54:25,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:54:25,565 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:54:25,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:54:25,566 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:54:25,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:54:25,863 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:54:25,863 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:54:25,863 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:54:25,864 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:54:25,864 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:54:25,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:54:25,864 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:54:25,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:54:25,881 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 01:54:25,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:54:25,895 WARN L254 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-10 01:54:25,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:54:25,932 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:54:25,932 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:54:26,678 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:54:26,681 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:54:26,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2019-09-10 01:54:26,681 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:54:26,682 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 01:54:26,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 01:54:26,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=394, Invalid=938, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 01:54:26,683 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 20 states. [2019-09-10 01:54:26,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:54:26,962 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-09-10 01:54:26,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 01:54:26,962 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 26 [2019-09-10 01:54:26,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:54:26,963 INFO L225 Difference]: With dead ends: 28 [2019-09-10 01:54:26,963 INFO L226 Difference]: Without dead ends: 28 [2019-09-10 01:54:26,964 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=394, Invalid=938, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 01:54:26,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-09-10 01:54:26,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-09-10 01:54:26,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-09-10 01:54:26,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-09-10 01:54:26,967 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2019-09-10 01:54:26,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:54:26,967 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-09-10 01:54:26,967 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 01:54:26,967 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-09-10 01:54:26,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-10 01:54:26,968 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:54:26,968 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:54:26,969 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:54:26,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:54:26,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1646182319, now seen corresponding path program 17 times [2019-09-10 01:54:26,969 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:54:26,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:54:26,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:54:26,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:54:26,970 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:54:26,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:54:27,264 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:54:27,265 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:54:27,265 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:54:27,265 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:54:27,265 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:54:27,265 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:54:27,265 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:54:27,277 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 01:54:27,277 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 01:54:27,497 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-09-10 01:54:27,497 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:54:27,499 WARN L254 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-10 01:54:27,500 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:54:27,533 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:54:27,533 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:54:28,481 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:54:28,486 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:54:28,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2019-09-10 01:54:28,486 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:54:28,487 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 01:54:28,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 01:54:28,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=1047, Unknown=0, NotChecked=0, Total=1482 [2019-09-10 01:54:28,488 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 21 states. [2019-09-10 01:54:28,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:54:28,834 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-09-10 01:54:28,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 01:54:28,838 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 27 [2019-09-10 01:54:28,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:54:28,839 INFO L225 Difference]: With dead ends: 29 [2019-09-10 01:54:28,839 INFO L226 Difference]: Without dead ends: 29 [2019-09-10 01:54:28,840 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=435, Invalid=1047, Unknown=0, NotChecked=0, Total=1482 [2019-09-10 01:54:28,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-09-10 01:54:28,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-09-10 01:54:28,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-09-10 01:54:28,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-09-10 01:54:28,842 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2019-09-10 01:54:28,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:54:28,843 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-09-10 01:54:28,843 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 01:54:28,843 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-09-10 01:54:28,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-10 01:54:28,844 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:54:28,844 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:54:28,844 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:54:28,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:54:28,844 INFO L82 PathProgramCache]: Analyzing trace with hash 544416926, now seen corresponding path program 18 times [2019-09-10 01:54:28,844 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:54:28,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:54:28,845 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:54:28,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:54:28,846 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:54:28,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:54:29,273 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:54:29,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:54:29,273 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:54:29,274 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:54:29,274 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:54:29,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:54:29,274 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:54:29,289 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 01:54:29,290 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 01:54:29,308 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 01:54:29,309 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:54:29,310 WARN L254 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-10 01:54:29,311 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:54:29,354 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:54:29,354 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:54:30,597 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:54:30,600 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:54:30,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2019-09-10 01:54:30,600 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:54:30,601 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 01:54:30,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 01:54:30,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=478, Invalid=1162, Unknown=0, NotChecked=0, Total=1640 [2019-09-10 01:54:30,602 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 22 states. [2019-09-10 01:54:30,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:54:30,979 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-09-10 01:54:30,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 01:54:30,980 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 28 [2019-09-10 01:54:30,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:54:30,981 INFO L225 Difference]: With dead ends: 30 [2019-09-10 01:54:30,981 INFO L226 Difference]: Without dead ends: 30 [2019-09-10 01:54:30,982 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=478, Invalid=1162, Unknown=0, NotChecked=0, Total=1640 [2019-09-10 01:54:30,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-09-10 01:54:30,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-09-10 01:54:30,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-10 01:54:30,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-09-10 01:54:30,985 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2019-09-10 01:54:30,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:54:30,986 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-09-10 01:54:30,986 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 01:54:30,986 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-09-10 01:54:30,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-10 01:54:30,987 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:54:30,987 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:54:30,987 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:54:30,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:54:30,988 INFO L82 PathProgramCache]: Analyzing trace with hash -266483215, now seen corresponding path program 19 times [2019-09-10 01:54:30,988 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:54:30,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:54:30,989 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:54:30,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:54:30,989 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:54:30,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:54:31,377 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:54:31,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:54:31,378 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:54:31,378 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:54:31,378 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:54:31,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:54:31,378 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:54:31,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:54:31,392 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 01:54:31,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:54:31,415 WARN L254 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-10 01:54:31,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:54:31,472 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:54:31,472 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:54:32,421 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:54:32,424 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:54:32,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2019-09-10 01:54:32,425 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:54:32,425 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-10 01:54:32,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-10 01:54:32,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=523, Invalid=1283, Unknown=0, NotChecked=0, Total=1806 [2019-09-10 01:54:32,426 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 23 states. [2019-09-10 01:54:32,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:54:32,804 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-09-10 01:54:32,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-10 01:54:32,804 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 29 [2019-09-10 01:54:32,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:54:32,805 INFO L225 Difference]: With dead ends: 31 [2019-09-10 01:54:32,805 INFO L226 Difference]: Without dead ends: 31 [2019-09-10 01:54:32,805 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=523, Invalid=1283, Unknown=0, NotChecked=0, Total=1806 [2019-09-10 01:54:32,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-09-10 01:54:32,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-09-10 01:54:32,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-10 01:54:32,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-09-10 01:54:32,809 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2019-09-10 01:54:32,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:54:32,809 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-09-10 01:54:32,810 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-10 01:54:32,810 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-09-10 01:54:32,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-10 01:54:32,810 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:54:32,811 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:54:32,811 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:54:32,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:54:32,811 INFO L82 PathProgramCache]: Analyzing trace with hash 365416190, now seen corresponding path program 20 times [2019-09-10 01:54:32,811 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:54:32,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:54:32,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:54:32,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:54:32,812 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:54:32,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:54:33,255 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:54:33,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:54:33,256 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:54:33,256 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:54:33,256 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:54:33,256 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:54:33,256 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:54:33,286 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 01:54:33,287 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 01:54:33,601 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-09-10 01:54:33,601 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:54:33,602 WARN L254 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 43 conjunts are in the unsatisfiable core [2019-09-10 01:54:33,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:54:33,667 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:54:33,668 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:54:34,729 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:54:34,734 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:54:34,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2019-09-10 01:54:34,734 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:54:34,735 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-10 01:54:34,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-10 01:54:34,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=570, Invalid=1410, Unknown=0, NotChecked=0, Total=1980 [2019-09-10 01:54:34,736 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 24 states. [2019-09-10 01:54:35,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:54:35,159 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-09-10 01:54:35,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 01:54:35,161 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 30 [2019-09-10 01:54:35,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:54:35,162 INFO L225 Difference]: With dead ends: 32 [2019-09-10 01:54:35,162 INFO L226 Difference]: Without dead ends: 32 [2019-09-10 01:54:35,164 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=570, Invalid=1410, Unknown=0, NotChecked=0, Total=1980 [2019-09-10 01:54:35,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-09-10 01:54:35,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-09-10 01:54:35,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-09-10 01:54:35,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-09-10 01:54:35,167 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2019-09-10 01:54:35,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:54:35,168 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-09-10 01:54:35,168 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-10 01:54:35,168 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-09-10 01:54:35,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-10 01:54:35,169 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:54:35,169 INFO L399 BasicCegarLoop]: trace histogram [21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:54:35,169 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:54:35,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:54:35,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1520538735, now seen corresponding path program 21 times [2019-09-10 01:54:35,169 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:54:35,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:54:35,170 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:54:35,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:54:35,171 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:54:35,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:54:35,621 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:54:35,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:54:35,621 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:54:35,622 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:54:35,622 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:54:35,622 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:54:35,622 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 01:54:35,639 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 01:54:35,639 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:54:35,659 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 01:54:35,660 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:54:35,661 WARN L254 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 45 conjunts are in the unsatisfiable core [2019-09-10 01:54:35,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:54:35,714 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:54:35,714 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:54:36,951 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:54:36,954 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:54:36,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2019-09-10 01:54:36,955 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:54:36,955 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-10 01:54:36,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-10 01:54:36,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=619, Invalid=1543, Unknown=0, NotChecked=0, Total=2162 [2019-09-10 01:54:36,956 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 25 states. [2019-09-10 01:54:37,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:54:37,433 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-09-10 01:54:37,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-10 01:54:37,436 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 31 [2019-09-10 01:54:37,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:54:37,437 INFO L225 Difference]: With dead ends: 33 [2019-09-10 01:54:37,437 INFO L226 Difference]: Without dead ends: 33 [2019-09-10 01:54:37,438 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=619, Invalid=1543, Unknown=0, NotChecked=0, Total=2162 [2019-09-10 01:54:37,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-09-10 01:54:37,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-09-10 01:54:37,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-10 01:54:37,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-09-10 01:54:37,442 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2019-09-10 01:54:37,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:54:37,442 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-09-10 01:54:37,442 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-10 01:54:37,442 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-09-10 01:54:37,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-10 01:54:37,443 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:54:37,443 INFO L399 BasicCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:54:37,444 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:54:37,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:54:37,444 INFO L82 PathProgramCache]: Analyzing trace with hash 144400734, now seen corresponding path program 22 times [2019-09-10 01:54:37,444 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:54:37,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:54:37,445 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:54:37,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:54:37,445 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:54:37,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:54:37,932 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:54:37,933 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:54:37,933 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:54:37,933 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:54:37,933 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:54:37,933 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:54:37,933 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 01:54:37,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:54:37,947 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:54:37,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:54:37,965 WARN L254 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 47 conjunts are in the unsatisfiable core [2019-09-10 01:54:37,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:54:38,012 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:54:38,013 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:54:40,664 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:54:40,667 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:54:40,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2019-09-10 01:54:40,668 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:54:40,668 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-10 01:54:40,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-10 01:54:40,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=670, Invalid=1682, Unknown=0, NotChecked=0, Total=2352 [2019-09-10 01:54:40,669 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 26 states. [2019-09-10 01:54:41,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:54:41,161 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-09-10 01:54:41,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 01:54:41,162 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 32 [2019-09-10 01:54:41,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:54:41,162 INFO L225 Difference]: With dead ends: 34 [2019-09-10 01:54:41,162 INFO L226 Difference]: Without dead ends: 34 [2019-09-10 01:54:41,163 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=670, Invalid=1682, Unknown=0, NotChecked=0, Total=2352 [2019-09-10 01:54:41,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-09-10 01:54:41,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-09-10 01:54:41,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-09-10 01:54:41,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-09-10 01:54:41,167 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2019-09-10 01:54:41,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:54:41,167 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-09-10 01:54:41,167 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-10 01:54:41,167 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-09-10 01:54:41,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-10 01:54:41,168 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:54:41,168 INFO L399 BasicCegarLoop]: trace histogram [23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:54:41,168 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:54:41,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:54:41,169 INFO L82 PathProgramCache]: Analyzing trace with hash 217916721, now seen corresponding path program 23 times [2019-09-10 01:54:41,169 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:54:41,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:54:41,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:54:41,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:54:41,170 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:54:41,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:54:41,621 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:54:41,622 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:54:41,622 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:54:41,622 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:54:41,622 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:54:41,622 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:54:41,622 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:54:41,635 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 01:54:41,635 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 01:54:48,886 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-09-10 01:54:48,886 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:54:48,891 WARN L254 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 49 conjunts are in the unsatisfiable core [2019-09-10 01:54:48,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:54:48,954 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:54:48,954 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:54:50,335 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:54:50,342 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:54:50,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2019-09-10 01:54:50,342 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:54:50,343 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-10 01:54:50,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-10 01:54:50,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=723, Invalid=1827, Unknown=0, NotChecked=0, Total=2550 [2019-09-10 01:54:50,345 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 27 states. [2019-09-10 01:54:50,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:54:50,925 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-09-10 01:54:50,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 01:54:50,926 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 33 [2019-09-10 01:54:50,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:54:50,927 INFO L225 Difference]: With dead ends: 35 [2019-09-10 01:54:50,927 INFO L226 Difference]: Without dead ends: 35 [2019-09-10 01:54:50,928 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=723, Invalid=1827, Unknown=0, NotChecked=0, Total=2550 [2019-09-10 01:54:50,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-09-10 01:54:50,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-09-10 01:54:50,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-09-10 01:54:50,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-09-10 01:54:50,934 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2019-09-10 01:54:50,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:54:50,934 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-09-10 01:54:50,934 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-10 01:54:50,934 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-09-10 01:54:50,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-10 01:54:50,935 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:54:50,935 INFO L399 BasicCegarLoop]: trace histogram [24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:54:50,936 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:54:50,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:54:50,936 INFO L82 PathProgramCache]: Analyzing trace with hash -1798054978, now seen corresponding path program 24 times [2019-09-10 01:54:50,936 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:54:50,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:54:50,937 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:54:50,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:54:50,938 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:54:50,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:54:51,493 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:54:51,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:54:51,494 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:54:51,494 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:54:51,494 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:54:51,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:54:51,495 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:54:51,517 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 01:54:51,517 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 01:54:51,537 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 01:54:51,537 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:54:51,539 WARN L254 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 51 conjunts are in the unsatisfiable core [2019-09-10 01:54:51,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:54:51,580 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:54:51,581 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:54:53,080 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:54:53,083 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:54:53,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2019-09-10 01:54:53,083 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:54:53,083 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-10 01:54:53,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-10 01:54:53,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=778, Invalid=1978, Unknown=0, NotChecked=0, Total=2756 [2019-09-10 01:54:53,085 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 28 states. [2019-09-10 01:54:53,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:54:53,615 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-09-10 01:54:53,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-10 01:54:53,616 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 34 [2019-09-10 01:54:53,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:54:53,617 INFO L225 Difference]: With dead ends: 36 [2019-09-10 01:54:53,617 INFO L226 Difference]: Without dead ends: 36 [2019-09-10 01:54:53,618 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=778, Invalid=1978, Unknown=0, NotChecked=0, Total=2756 [2019-09-10 01:54:53,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-09-10 01:54:53,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-09-10 01:54:53,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-09-10 01:54:53,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-09-10 01:54:53,621 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2019-09-10 01:54:53,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:54:53,621 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-09-10 01:54:53,621 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-10 01:54:53,621 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-09-10 01:54:53,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-09-10 01:54:53,621 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:54:53,622 INFO L399 BasicCegarLoop]: trace histogram [25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:54:53,622 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:54:53,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:54:53,622 INFO L82 PathProgramCache]: Analyzing trace with hash 131331793, now seen corresponding path program 25 times [2019-09-10 01:54:53,622 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:54:53,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:54:53,623 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:54:53,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:54:53,623 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:54:53,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:54:54,321 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:54:54,322 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:54:54,322 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:54:54,322 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:54:54,322 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:54:54,322 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:54:54,322 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 01:54:54,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:54:54,344 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:54:54,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:54:54,364 WARN L254 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 53 conjunts are in the unsatisfiable core [2019-09-10 01:54:54,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:54:54,412 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:54:54,412 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:54:56,189 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:54:56,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:54:56,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 55 [2019-09-10 01:54:56,193 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:54:56,193 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-10 01:54:56,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-10 01:54:56,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=835, Invalid=2135, Unknown=0, NotChecked=0, Total=2970 [2019-09-10 01:54:56,195 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 29 states. [2019-09-10 01:54:56,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:54:56,831 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-09-10 01:54:56,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-10 01:54:56,831 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 35 [2019-09-10 01:54:56,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:54:56,832 INFO L225 Difference]: With dead ends: 37 [2019-09-10 01:54:56,832 INFO L226 Difference]: Without dead ends: 37 [2019-09-10 01:54:56,833 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=835, Invalid=2135, Unknown=0, NotChecked=0, Total=2970 [2019-09-10 01:54:56,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-09-10 01:54:56,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-09-10 01:54:56,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-09-10 01:54:56,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-09-10 01:54:56,836 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2019-09-10 01:54:56,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:54:56,836 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-09-10 01:54:56,836 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-10 01:54:56,836 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-09-10 01:54:56,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-10 01:54:56,837 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:54:56,837 INFO L399 BasicCegarLoop]: trace histogram [26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:54:56,837 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:54:56,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:54:56,838 INFO L82 PathProgramCache]: Analyzing trace with hash -187220450, now seen corresponding path program 26 times [2019-09-10 01:54:56,838 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:54:56,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:54:56,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:54:56,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:54:56,839 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:54:56,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:54:57,388 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:54:57,388 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:54:57,388 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:54:57,388 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:54:57,388 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:54:57,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:54:57,389 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 01:54:57,407 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 01:54:57,408 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:56:11,789 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-09-10 01:56:11,790 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:56:11,823 WARN L254 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 56 conjunts are in the unsatisfiable core [2019-09-10 01:56:11,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:56:11,904 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:56:11,905 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:59:10,053 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 338 refuted. 13 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:59:10,060 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:59:10,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2019-09-10 01:59:10,061 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:59:10,061 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-10 01:59:10,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-10 01:59:10,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=894, Invalid=2230, Unknown=68, NotChecked=0, Total=3192 [2019-09-10 01:59:10,062 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 30 states. [2019-09-10 01:59:10,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:59:10,750 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-09-10 01:59:10,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-10 01:59:10,751 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 36 [2019-09-10 01:59:10,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:59:10,751 INFO L225 Difference]: With dead ends: 38 [2019-09-10 01:59:10,751 INFO L226 Difference]: Without dead ends: 38 [2019-09-10 01:59:10,752 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 178.7s TimeCoverageRelationStatistics Valid=894, Invalid=2230, Unknown=68, NotChecked=0, Total=3192 [2019-09-10 01:59:10,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-09-10 01:59:10,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-09-10 01:59:10,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-09-10 01:59:10,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-09-10 01:59:10,755 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2019-09-10 01:59:10,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:59:10,756 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-09-10 01:59:10,756 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-10 01:59:10,756 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-09-10 01:59:10,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-09-10 01:59:10,756 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:59:10,757 INFO L399 BasicCegarLoop]: trace histogram [27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:59:10,757 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:59:10,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:59:10,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1472405391, now seen corresponding path program 27 times [2019-09-10 01:59:10,757 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:59:10,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:59:10,758 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:59:10,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:59:10,758 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:59:10,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:59:11,307 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:59:11,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:59:11,308 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:59:11,308 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:59:11,308 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:59:11,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:59:11,308 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:59:11,324 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 01:59:11,324 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 01:59:11,347 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 01:59:11,347 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:59:11,349 WARN L254 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 57 conjunts are in the unsatisfiable core [2019-09-10 01:59:11,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:59:11,427 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:59:11,427 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:59:13,336 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:59:13,340 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:59:13,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 59 [2019-09-10 01:59:13,340 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:59:13,341 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-10 01:59:13,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-10 01:59:13,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=955, Invalid=2467, Unknown=0, NotChecked=0, Total=3422 [2019-09-10 01:59:13,342 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 31 states. [2019-09-10 01:59:14,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:59:14,041 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-09-10 01:59:14,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-10 01:59:14,041 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 37 [2019-09-10 01:59:14,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:59:14,042 INFO L225 Difference]: With dead ends: 39 [2019-09-10 01:59:14,042 INFO L226 Difference]: Without dead ends: 39 [2019-09-10 01:59:14,043 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=955, Invalid=2467, Unknown=0, NotChecked=0, Total=3422 [2019-09-10 01:59:14,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-09-10 01:59:14,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-09-10 01:59:14,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-10 01:59:14,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-09-10 01:59:14,047 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2019-09-10 01:59:14,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:59:14,048 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-09-10 01:59:14,048 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-10 01:59:14,048 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-09-10 01:59:14,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-10 01:59:14,048 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:59:14,048 INFO L399 BasicCegarLoop]: trace histogram [28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:59:14,049 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:59:14,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:59:14,049 INFO L82 PathProgramCache]: Analyzing trace with hash 1636534398, now seen corresponding path program 28 times [2019-09-10 01:59:14,049 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:59:14,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:59:14,050 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:59:14,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:59:14,050 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:59:14,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:59:14,715 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:59:14,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:59:14,715 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:59:14,715 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:59:14,715 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:59:14,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:59:14,715 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:59:14,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:59:14,726 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 01:59:14,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:59:14,745 WARN L254 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 59 conjunts are in the unsatisfiable core [2019-09-10 01:59:14,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:59:14,789 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:59:14,789 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:59:17,158 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:59:17,162 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:59:17,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 61 [2019-09-10 01:59:17,162 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:59:17,163 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-10 01:59:17,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-10 01:59:17,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1018, Invalid=2642, Unknown=0, NotChecked=0, Total=3660 [2019-09-10 01:59:17,164 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 32 states. [2019-09-10 01:59:17,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:59:17,953 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-09-10 01:59:17,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-10 01:59:17,953 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 38 [2019-09-10 01:59:17,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:59:17,954 INFO L225 Difference]: With dead ends: 40 [2019-09-10 01:59:17,954 INFO L226 Difference]: Without dead ends: 40 [2019-09-10 01:59:17,955 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1018, Invalid=2642, Unknown=0, NotChecked=0, Total=3660 [2019-09-10 01:59:17,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-09-10 01:59:17,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-09-10 01:59:17,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-09-10 01:59:17,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-09-10 01:59:17,959 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2019-09-10 01:59:17,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:59:17,959 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-09-10 01:59:17,959 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-10 01:59:17,959 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-09-10 01:59:17,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-10 01:59:17,960 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:59:17,960 INFO L399 BasicCegarLoop]: trace histogram [29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:59:17,960 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:59:17,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:59:17,960 INFO L82 PathProgramCache]: Analyzing trace with hash -770579951, now seen corresponding path program 29 times [2019-09-10 01:59:17,960 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:59:17,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:59:17,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:59:17,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:59:17,961 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:59:17,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:59:18,679 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:59:18,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:59:18,680 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:59:18,680 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:59:18,680 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:59:18,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:59:18,680 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:59:18,692 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 01:59:18,692 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:00:18,774 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-09-10 02:00:18,774 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:00:20,657 WARN L254 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 61 conjunts are in the unsatisfiable core [2019-09-10 02:00:20,658 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:00:20,712 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:00:20,712 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:00:22,876 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:00:22,884 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:00:22,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2019-09-10 02:00:22,884 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:00:22,885 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-10 02:00:22,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-10 02:00:22,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1083, Invalid=2823, Unknown=0, NotChecked=0, Total=3906 [2019-09-10 02:00:22,886 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 33 states. [2019-09-10 02:00:23,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:00:23,735 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-09-10 02:00:23,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-10 02:00:23,736 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 39 [2019-09-10 02:00:23,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:00:23,736 INFO L225 Difference]: With dead ends: 41 [2019-09-10 02:00:23,736 INFO L226 Difference]: Without dead ends: 41 [2019-09-10 02:00:23,737 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1083, Invalid=2823, Unknown=0, NotChecked=0, Total=3906 [2019-09-10 02:00:23,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-09-10 02:00:23,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-09-10 02:00:23,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-09-10 02:00:23,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-09-10 02:00:23,739 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2019-09-10 02:00:23,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:00:23,740 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-09-10 02:00:23,740 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-10 02:00:23,740 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-09-10 02:00:23,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-10 02:00:23,741 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:00:23,741 INFO L399 BasicCegarLoop]: trace histogram [30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:00:23,741 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:00:23,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:00:23,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1918286558, now seen corresponding path program 30 times [2019-09-10 02:00:23,741 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:00:23,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:00:23,742 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:00:23,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:00:23,742 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:00:23,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:00:24,622 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:00:24,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:00:24,623 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:00:24,623 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:00:24,624 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:00:24,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:00:24,624 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:00:24,653 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:00:24,654 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:00:24,676 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:00:24,676 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:00:24,678 WARN L254 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 63 conjunts are in the unsatisfiable core [2019-09-10 02:00:24,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:00:24,746 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:00:24,746 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:00:27,248 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:00:27,251 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:00:27,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2019-09-10 02:00:27,252 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:00:27,252 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-10 02:00:27,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-10 02:00:27,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1150, Invalid=3010, Unknown=0, NotChecked=0, Total=4160 [2019-09-10 02:00:27,253 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 34 states. [2019-09-10 02:00:28,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:00:28,121 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-09-10 02:00:28,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-10 02:00:28,122 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 40 [2019-09-10 02:00:28,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:00:28,122 INFO L225 Difference]: With dead ends: 42 [2019-09-10 02:00:28,123 INFO L226 Difference]: Without dead ends: 42 [2019-09-10 02:00:28,123 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1150, Invalid=3010, Unknown=0, NotChecked=0, Total=4160 [2019-09-10 02:00:28,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-10 02:00:28,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-09-10 02:00:28,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-09-10 02:00:28,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-09-10 02:00:28,126 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2019-09-10 02:00:28,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:00:28,126 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-09-10 02:00:28,127 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-10 02:00:28,127 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-09-10 02:00:28,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-10 02:00:28,127 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:00:28,127 INFO L399 BasicCegarLoop]: trace histogram [31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:00:28,128 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:00:28,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:00:28,128 INFO L82 PathProgramCache]: Analyzing trace with hash -626197583, now seen corresponding path program 31 times [2019-09-10 02:00:28,128 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:00:28,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:00:28,129 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:00:28,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:00:28,129 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:00:28,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:00:28,828 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:00:28,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:00:28,829 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:00:28,829 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:00:28,829 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:00:28,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:00:28,829 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:00:28,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:00:28,843 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:00:28,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:00:28,867 WARN L254 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 65 conjunts are in the unsatisfiable core [2019-09-10 02:00:28,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:00:28,909 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:00:28,909 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:00:31,662 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:00:31,665 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:00:31,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 67 [2019-09-10 02:00:31,666 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:00:31,666 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-10 02:00:31,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-10 02:00:31,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1219, Invalid=3203, Unknown=0, NotChecked=0, Total=4422 [2019-09-10 02:00:31,667 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 35 states. [2019-09-10 02:00:32,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:00:32,627 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-09-10 02:00:32,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-10 02:00:32,631 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 41 [2019-09-10 02:00:32,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:00:32,632 INFO L225 Difference]: With dead ends: 43 [2019-09-10 02:00:32,632 INFO L226 Difference]: Without dead ends: 43 [2019-09-10 02:00:32,633 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1219, Invalid=3203, Unknown=0, NotChecked=0, Total=4422 [2019-09-10 02:00:32,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-09-10 02:00:32,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-09-10 02:00:32,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-09-10 02:00:32,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-09-10 02:00:32,636 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2019-09-10 02:00:32,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:00:32,636 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-09-10 02:00:32,636 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-10 02:00:32,636 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-09-10 02:00:32,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-10 02:00:32,637 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:00:32,637 INFO L399 BasicCegarLoop]: trace histogram [32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:00:32,637 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:00:32,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:00:32,639 INFO L82 PathProgramCache]: Analyzing trace with hash 2099172670, now seen corresponding path program 32 times [2019-09-10 02:00:32,639 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:00:32,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:00:32,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:00:32,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:00:32,641 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:00:32,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:00:33,518 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:00:33,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:00:33,519 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:00:33,519 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:00:33,519 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:00:33,519 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:00:33,519 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:00:33,530 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:00:33,530 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:02:17,583 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-09-10 02:02:17,584 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:02:17,757 WARN L254 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 68 conjunts are in the unsatisfiable core [2019-09-10 02:02:17,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:02:17,816 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:02:17,816 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:07:12,380 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 505 refuted. 23 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:07:12,387 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:07:12,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2019-09-10 02:07:12,387 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:07:12,387 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-10 02:07:12,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-10 02:07:12,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1290, Invalid=3296, Unknown=106, NotChecked=0, Total=4692 [2019-09-10 02:07:12,388 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 36 states. [2019-09-10 02:07:13,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:07:13,370 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-09-10 02:07:13,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-10 02:07:13,371 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 42 [2019-09-10 02:07:13,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:07:13,372 INFO L225 Difference]: With dead ends: 44 [2019-09-10 02:07:13,372 INFO L226 Difference]: Without dead ends: 44 [2019-09-10 02:07:13,374 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 295.4s TimeCoverageRelationStatistics Valid=1290, Invalid=3296, Unknown=106, NotChecked=0, Total=4692 [2019-09-10 02:07:13,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-09-10 02:07:13,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-09-10 02:07:13,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-09-10 02:07:13,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-09-10 02:07:13,376 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2019-09-10 02:07:13,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:07:13,376 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-09-10 02:07:13,376 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-10 02:07:13,376 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-09-10 02:07:13,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-09-10 02:07:13,377 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:07:13,377 INFO L399 BasicCegarLoop]: trace histogram [33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:07:13,377 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:07:13,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:07:13,378 INFO L82 PathProgramCache]: Analyzing trace with hash 686304593, now seen corresponding path program 33 times [2019-09-10 02:07:13,378 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:07:13,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:13,378 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:07:13,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:13,379 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:07:13,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:14,153 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:07:14,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:14,153 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:07:14,154 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:07:14,154 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:07:14,154 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:14,154 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:07:14,164 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:07:14,164 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:07:14,190 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:07:14,190 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:07:14,191 WARN L254 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 69 conjunts are in the unsatisfiable core [2019-09-10 02:07:14,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:07:14,235 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:07:14,235 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:07:16,877 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:07:16,880 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:07:16,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 71 [2019-09-10 02:07:16,880 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:07:16,881 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-10 02:07:16,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-10 02:07:16,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1363, Invalid=3607, Unknown=0, NotChecked=0, Total=4970 [2019-09-10 02:07:16,882 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 37 states. [2019-09-10 02:07:17,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:07:17,912 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-09-10 02:07:17,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-10 02:07:17,912 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 43 [2019-09-10 02:07:17,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:07:17,913 INFO L225 Difference]: With dead ends: 45 [2019-09-10 02:07:17,913 INFO L226 Difference]: Without dead ends: 45 [2019-09-10 02:07:17,914 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1363, Invalid=3607, Unknown=0, NotChecked=0, Total=4970 [2019-09-10 02:07:17,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-09-10 02:07:17,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-09-10 02:07:17,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-09-10 02:07:17,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-09-10 02:07:17,916 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2019-09-10 02:07:17,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:07:17,917 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-09-10 02:07:17,917 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-10 02:07:17,917 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-09-10 02:07:17,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-10 02:07:17,917 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:07:17,918 INFO L399 BasicCegarLoop]: trace histogram [34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:07:17,918 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:07:17,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:07:17,918 INFO L82 PathProgramCache]: Analyzing trace with hash -162932834, now seen corresponding path program 34 times [2019-09-10 02:07:17,918 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:07:17,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:17,919 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:07:17,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:17,919 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:07:17,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:18,719 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:07:18,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:18,720 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:07:18,720 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:07:18,720 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:07:18,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:18,720 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:07:18,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:07:18,736 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:07:18,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:18,769 WARN L254 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 71 conjunts are in the unsatisfiable core [2019-09-10 02:07:18,770 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:07:18,821 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:07:18,822 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:07:21,630 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:07:21,633 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:07:21,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 73 [2019-09-10 02:07:21,633 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:07:21,634 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-10 02:07:21,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-10 02:07:21,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1438, Invalid=3818, Unknown=0, NotChecked=0, Total=5256 [2019-09-10 02:07:21,634 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 38 states. [2019-09-10 02:07:22,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:07:22,723 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-09-10 02:07:22,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-10 02:07:22,724 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 44 [2019-09-10 02:07:22,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:07:22,724 INFO L225 Difference]: With dead ends: 46 [2019-09-10 02:07:22,724 INFO L226 Difference]: Without dead ends: 46 [2019-09-10 02:07:22,725 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=1438, Invalid=3818, Unknown=0, NotChecked=0, Total=5256 [2019-09-10 02:07:22,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-09-10 02:07:22,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-09-10 02:07:22,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-09-10 02:07:22,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-09-10 02:07:22,727 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2019-09-10 02:07:22,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:07:22,728 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-09-10 02:07:22,728 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-10 02:07:22,728 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-09-10 02:07:22,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-10 02:07:22,728 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:07:22,729 INFO L399 BasicCegarLoop]: trace histogram [35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:07:22,729 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:07:22,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:07:22,729 INFO L82 PathProgramCache]: Analyzing trace with hash -719489295, now seen corresponding path program 35 times [2019-09-10 02:07:22,729 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:07:22,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:22,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:07:22,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:07:22,730 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:07:22,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:07:23,604 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:07:23,604 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:23,604 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:07:23,604 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:07:23,604 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:07:23,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:07:23,605 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:07:23,614 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:07:23,615 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP)