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/recursive/Fibonacci03.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 02:51:30,894 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 02:51:30,896 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 02:51:30,908 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 02:51:30,909 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 02:51:30,910 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 02:51:30,911 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 02:51:30,913 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 02:51:30,915 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 02:51:30,916 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 02:51:30,917 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 02:51:30,918 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 02:51:30,918 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 02:51:30,919 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 02:51:30,920 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 02:51:30,921 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 02:51:30,922 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 02:51:30,923 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 02:51:30,925 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 02:51:30,927 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 02:51:30,928 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 02:51:30,929 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 02:51:30,930 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 02:51:30,931 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 02:51:30,933 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 02:51:30,934 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 02:51:30,934 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 02:51:30,935 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 02:51:30,935 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 02:51:30,936 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 02:51:30,937 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 02:51:30,937 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 02:51:30,938 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 02:51:30,939 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 02:51:30,940 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 02:51:30,940 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 02:51:30,941 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 02:51:30,941 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 02:51:30,941 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 02:51:30,942 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 02:51:30,943 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 02:51:30,944 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 02:51:30,958 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 02:51:30,959 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 02:51:30,959 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 02:51:30,959 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 02:51:30,960 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 02:51:30,960 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 02:51:30,960 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 02:51:30,960 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 02:51:30,961 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 02:51:30,961 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 02:51:30,962 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 02:51:30,962 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 02:51:30,962 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 02:51:30,962 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 02:51:30,962 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 02:51:30,963 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 02:51:30,963 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 02:51:30,963 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 02:51:30,963 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 02:51:30,963 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 02:51:30,964 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 02:51:30,964 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 02:51:30,964 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 02:51:30,964 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 02:51:30,964 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 02:51:30,965 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 02:51:30,965 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 02:51:30,965 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 02:51:30,965 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 02:51:30,965 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 02:51:31,008 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 02:51:31,020 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 02:51:31,024 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 02:51:31,025 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 02:51:31,026 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 02:51:31,027 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive/Fibonacci03.c [2019-09-10 02:51:31,105 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/982619051/da1c0a59b41645d6b7f8b5663cad7d02/FLAG8b7dcd806 [2019-09-10 02:51:31,597 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 02:51:31,598 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive/Fibonacci03.c [2019-09-10 02:51:31,605 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/982619051/da1c0a59b41645d6b7f8b5663cad7d02/FLAG8b7dcd806 [2019-09-10 02:51:31,963 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/982619051/da1c0a59b41645d6b7f8b5663cad7d02 [2019-09-10 02:51:31,972 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 02:51:31,973 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 02:51:31,974 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 02:51:31,974 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 02:51:31,978 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 02:51:31,979 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:51:31" (1/1) ... [2019-09-10 02:51:31,982 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ac25b2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:51:31, skipping insertion in model container [2019-09-10 02:51:31,982 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:51:31" (1/1) ... [2019-09-10 02:51:31,990 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 02:51:32,008 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 02:51:32,196 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:51:32,200 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 02:51:32,215 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:51:32,227 INFO L192 MainTranslator]: Completed translation [2019-09-10 02:51:32,228 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:51:32 WrapperNode [2019-09-10 02:51:32,228 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 02:51:32,229 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 02:51:32,229 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 02:51:32,229 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 02:51:32,323 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:51:32" (1/1) ... [2019-09-10 02:51:32,323 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:51:32" (1/1) ... [2019-09-10 02:51:32,328 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:51:32" (1/1) ... [2019-09-10 02:51:32,329 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:51:32" (1/1) ... [2019-09-10 02:51:32,332 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:51:32" (1/1) ... [2019-09-10 02:51:32,334 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:51:32" (1/1) ... [2019-09-10 02:51:32,335 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:51:32" (1/1) ... [2019-09-10 02:51:32,336 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 02:51:32,337 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 02:51:32,337 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 02:51:32,337 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 02:51:32,338 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:51:32" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 02:51:32,390 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 02:51:32,390 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 02:51:32,390 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2019-09-10 02:51:32,390 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 02:51:32,391 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 02:51:32,391 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-10 02:51:32,391 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2019-09-10 02:51:32,391 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 02:51:32,391 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 02:51:32,391 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 02:51:32,571 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 02:51:32,571 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 02:51:32,573 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:51:32 BoogieIcfgContainer [2019-09-10 02:51:32,573 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 02:51:32,574 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 02:51:32,574 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 02:51:32,576 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 02:51:32,577 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 02:51:31" (1/3) ... [2019-09-10 02:51:32,577 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ddaede9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:51:32, skipping insertion in model container [2019-09-10 02:51:32,578 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:51:32" (2/3) ... [2019-09-10 02:51:32,578 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ddaede9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:51:32, skipping insertion in model container [2019-09-10 02:51:32,578 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:51:32" (3/3) ... [2019-09-10 02:51:32,580 INFO L109 eAbstractionObserver]: Analyzing ICFG Fibonacci03.c [2019-09-10 02:51:32,590 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 02:51:32,598 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 02:51:32,616 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 02:51:32,644 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 02:51:32,645 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 02:51:32,645 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 02:51:32,645 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 02:51:32,645 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 02:51:32,645 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 02:51:32,646 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 02:51:32,646 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 02:51:32,659 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2019-09-10 02:51:32,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-10 02:51:32,668 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:51:32,669 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:51:32,671 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:51:32,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:51:32,676 INFO L82 PathProgramCache]: Analyzing trace with hash 1900973920, now seen corresponding path program 1 times [2019-09-10 02:51:32,678 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:51:32,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:32,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:51:32,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:32,719 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:51:32,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:51:32,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:51:32,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:51:32,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 02:51:32,867 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:51:32,882 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 02:51:32,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 02:51:32,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:51:32,926 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 5 states. [2019-09-10 02:51:33,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:51:33,061 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2019-09-10 02:51:33,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 02:51:33,063 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-09-10 02:51:33,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:51:33,072 INFO L225 Difference]: With dead ends: 30 [2019-09-10 02:51:33,072 INFO L226 Difference]: Without dead ends: 22 [2019-09-10 02:51:33,074 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:51:33,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-09-10 02:51:33,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-09-10 02:51:33,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-09-10 02:51:33,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2019-09-10 02:51:33,117 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 14 [2019-09-10 02:51:33,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:51:33,118 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2019-09-10 02:51:33,118 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 02:51:33,118 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2019-09-10 02:51:33,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-10 02:51:33,120 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:51:33,120 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:51:33,121 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:51:33,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:51:33,122 INFO L82 PathProgramCache]: Analyzing trace with hash -509871596, now seen corresponding path program 1 times [2019-09-10 02:51:33,122 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:51:33,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:33,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:51:33,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:33,125 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:51:33,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:51:33,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:51:33,224 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:51:33,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 02:51:33,225 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:51:33,227 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 02:51:33,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 02:51:33,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:51:33,228 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand 5 states. [2019-09-10 02:51:33,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:51:33,331 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2019-09-10 02:51:33,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 02:51:33,334 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-09-10 02:51:33,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:51:33,336 INFO L225 Difference]: With dead ends: 26 [2019-09-10 02:51:33,337 INFO L226 Difference]: Without dead ends: 24 [2019-09-10 02:51:33,338 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:51:33,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-09-10 02:51:33,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2019-09-10 02:51:33,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-09-10 02:51:33,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2019-09-10 02:51:33,351 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 15 [2019-09-10 02:51:33,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:51:33,352 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2019-09-10 02:51:33,352 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 02:51:33,353 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2019-09-10 02:51:33,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-10 02:51:33,355 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:51:33,356 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:51:33,356 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:51:33,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:51:33,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1203666899, now seen corresponding path program 1 times [2019-09-10 02:51:33,357 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:51:33,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:33,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:51:33,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:33,362 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:51:33,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:51:33,477 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 02:51:33,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:51:33,478 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:51:33,478 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 28 with the following transitions: [2019-09-10 02:51:33,481 INFO L207 CegarAbsIntRunner]: [0], [3], [4], [8], [10], [12], [13], [14], [18], [22], [24], [28], [30], [33], [34], [35], [36], [37], [38], [39], [41], [42] [2019-09-10 02:51:33,516 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 02:51:33,516 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 02:51:33,605 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 02:51:33,607 INFO L272 AbstractInterpreter]: Visited 17 different actions 32 times. Never merged. Never widened. Performed 30 root evaluator evaluations with a maximum evaluation depth of 4. Performed 30 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 5 variables. [2019-09-10 02:51:33,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:51:33,612 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 02:51:33,613 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:51:33,613 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:51:33,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:51:33,630 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:51:33,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:51:33,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-10 02:51:33,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:51:33,758 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 02:51:33,758 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:51:33,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:33,997 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 02:51:34,002 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:51:34,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 12 [2019-09-10 02:51:34,003 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:51:34,003 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 02:51:34,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 02:51:34,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-09-10 02:51:34,004 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand 8 states. [2019-09-10 02:51:34,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:51:34,133 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2019-09-10 02:51:34,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 02:51:34,134 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2019-09-10 02:51:34,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:51:34,135 INFO L225 Difference]: With dead ends: 24 [2019-09-10 02:51:34,135 INFO L226 Difference]: Without dead ends: 24 [2019-09-10 02:51:34,136 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 48 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2019-09-10 02:51:34,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-09-10 02:51:34,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-09-10 02:51:34,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-09-10 02:51:34,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2019-09-10 02:51:34,142 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 27 [2019-09-10 02:51:34,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:51:34,142 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2019-09-10 02:51:34,143 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 02:51:34,143 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2019-09-10 02:51:34,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-10 02:51:34,145 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:51:34,145 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:51:34,145 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:51:34,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:51:34,146 INFO L82 PathProgramCache]: Analyzing trace with hash -603082491, now seen corresponding path program 1 times [2019-09-10 02:51:34,146 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:51:34,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:34,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:51:34,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:34,147 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:51:34,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:51:34,219 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-10 02:51:34,219 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:51:34,219 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:51:34,219 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2019-09-10 02:51:34,220 INFO L207 CegarAbsIntRunner]: [0], [3], [4], [7], [8], [10], [12], [13], [14], [18], [22], [24], [28], [30], [33], [34], [35], [36], [37], [38], [39], [41], [42] [2019-09-10 02:51:34,227 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 02:51:34,228 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 02:51:35,267 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 02:51:35,268 INFO L272 AbstractInterpreter]: Visited 23 different actions 4427 times. Merged at 10 different actions 1119 times. Never widened. Performed 5405 root evaluator evaluations with a maximum evaluation depth of 4. Performed 5405 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 480 fixpoints after 5 different actions. Largest state had 5 variables. [2019-09-10 02:51:35,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:51:35,269 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 02:51:35,269 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:51:35,269 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 02:51:35,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:51:35,292 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:51:35,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:51:35,318 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-10 02:51:35,324 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:51:35,341 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-10 02:51:35,341 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:51:35,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:35,587 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 02:51:35,592 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:51:35,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 10 [2019-09-10 02:51:35,592 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:51:35,594 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:51:35,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:51:35,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-09-10 02:51:35,595 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand 6 states. [2019-09-10 02:51:35,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:51:35,719 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2019-09-10 02:51:35,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:51:35,722 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-09-10 02:51:35,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:51:35,724 INFO L225 Difference]: With dead ends: 31 [2019-09-10 02:51:35,724 INFO L226 Difference]: Without dead ends: 29 [2019-09-10 02:51:35,726 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 53 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-09-10 02:51:35,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-09-10 02:51:35,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-09-10 02:51:35,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-09-10 02:51:35,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2019-09-10 02:51:35,745 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 38 transitions. Word has length 28 [2019-09-10 02:51:35,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:51:35,747 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 38 transitions. [2019-09-10 02:51:35,747 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:51:35,747 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2019-09-10 02:51:35,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-10 02:51:35,750 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:51:35,750 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:51:35,750 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:51:35,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:51:35,751 INFO L82 PathProgramCache]: Analyzing trace with hash -2046185202, now seen corresponding path program 2 times [2019-09-10 02:51:35,751 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:51:35,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:35,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:51:35,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:35,755 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:51:35,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:51:35,933 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 23 proven. 8 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-10 02:51:35,933 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:51:35,933 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:51:35,933 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:51:35,934 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:51:35,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:51:35,934 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) [2019-09-10 02:51:35,957 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:51:35,958 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:51:35,982 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-09-10 02:51:35,983 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:51:35,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-10 02:51:35,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:51:36,024 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-10 02:51:36,024 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:51:36,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:36,236 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-10 02:51:36,241 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:51:36,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 7] total 15 [2019-09-10 02:51:36,241 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:51:36,242 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 02:51:36,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 02:51:36,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2019-09-10 02:51:36,243 INFO L87 Difference]: Start difference. First operand 29 states and 38 transitions. Second operand 11 states. [2019-09-10 02:51:36,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:51:36,536 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2019-09-10 02:51:36,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 02:51:36,537 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 41 [2019-09-10 02:51:36,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:51:36,539 INFO L225 Difference]: With dead ends: 35 [2019-09-10 02:51:36,539 INFO L226 Difference]: Without dead ends: 35 [2019-09-10 02:51:36,540 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 74 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2019-09-10 02:51:36,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-09-10 02:51:36,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 29. [2019-09-10 02:51:36,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-09-10 02:51:36,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2019-09-10 02:51:36,560 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 41 [2019-09-10 02:51:36,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:51:36,563 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2019-09-10 02:51:36,563 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 02:51:36,563 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2019-09-10 02:51:36,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-10 02:51:36,565 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:51:36,565 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:51:36,567 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:51:36,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:51:36,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1391487784, now seen corresponding path program 3 times [2019-09-10 02:51:36,567 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:51:36,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:36,569 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:51:36,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:36,569 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:51:36,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:51:36,654 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-10 02:51:36,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:51:36,654 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:51:36,654 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:51:36,654 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:51:36,655 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:51:36,655 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:51:36,676 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:51:36,677 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:51:36,692 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:51:36,693 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:51:36,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-10 02:51:36,696 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:51:36,706 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-10 02:51:36,706 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:51:36,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:36,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:36,981 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 31 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-10 02:51:36,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:51:36,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 9] total 12 [2019-09-10 02:51:36,985 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:51:36,986 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 02:51:36,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 02:51:36,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-09-10 02:51:36,988 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. Second operand 7 states. [2019-09-10 02:51:37,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:51:37,089 INFO L93 Difference]: Finished difference Result 36 states and 50 transitions. [2019-09-10 02:51:37,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 02:51:37,089 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2019-09-10 02:51:37,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:51:37,094 INFO L225 Difference]: With dead ends: 36 [2019-09-10 02:51:37,094 INFO L226 Difference]: Without dead ends: 34 [2019-09-10 02:51:37,095 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 79 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2019-09-10 02:51:37,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-09-10 02:51:37,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-09-10 02:51:37,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-09-10 02:51:37,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions. [2019-09-10 02:51:37,110 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 48 transitions. Word has length 42 [2019-09-10 02:51:37,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:51:37,113 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 48 transitions. [2019-09-10 02:51:37,113 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 02:51:37,113 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 48 transitions. [2019-09-10 02:51:37,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 02:51:37,116 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:51:37,118 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 9, 5, 5, 5, 5, 5, 5, 5, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:51:37,118 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:51:37,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:51:37,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1611334083, now seen corresponding path program 4 times [2019-09-10 02:51:37,119 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:51:37,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:37,120 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:51:37,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:37,120 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:51:37,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:51:37,240 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 41 proven. 82 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2019-09-10 02:51:37,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:51:37,241 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:51:37,241 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:51:37,241 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:51:37,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:51:37,242 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:51:37,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:51:37,269 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:51:37,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:51:37,307 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-10 02:51:37,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:51:37,352 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 22 proven. 127 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2019-09-10 02:51:37,352 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:51:37,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:37,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:37,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:37,865 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 22 proven. 142 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (6)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 02:51:37,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:51:37,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 11] total 14 [2019-09-10 02:51:37,873 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:51:37,873 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 02:51:37,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 02:51:37,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2019-09-10 02:51:37,874 INFO L87 Difference]: Start difference. First operand 34 states and 48 transitions. Second operand 8 states. [2019-09-10 02:51:38,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:51:38,004 INFO L93 Difference]: Finished difference Result 41 states and 63 transitions. [2019-09-10 02:51:38,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 02:51:38,006 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 83 [2019-09-10 02:51:38,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:51:38,010 INFO L225 Difference]: With dead ends: 41 [2019-09-10 02:51:38,011 INFO L226 Difference]: Without dead ends: 39 [2019-09-10 02:51:38,011 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 155 SyntacticMatches, 7 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2019-09-10 02:51:38,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-09-10 02:51:38,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-09-10 02:51:38,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-10 02:51:38,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 61 transitions. [2019-09-10 02:51:38,030 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 61 transitions. Word has length 83 [2019-09-10 02:51:38,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:51:38,031 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 61 transitions. [2019-09-10 02:51:38,031 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 02:51:38,031 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 61 transitions. [2019-09-10 02:51:38,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-09-10 02:51:38,042 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:51:38,043 INFO L399 BasicCegarLoop]: trace histogram [27, 27, 23, 13, 13, 13, 13, 13, 13, 13, 10, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:51:38,043 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:51:38,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:51:38,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1652159313, now seen corresponding path program 5 times [2019-09-10 02:51:38,044 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:51:38,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:38,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:51:38,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:38,046 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:51:38,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:51:38,276 INFO L134 CoverageAnalysis]: Checked inductivity of 1969 backedges. 110 proven. 383 refuted. 0 times theorem prover too weak. 1476 trivial. 0 not checked. [2019-09-10 02:51:38,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:51:38,280 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:51:38,280 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:51:38,281 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:51:38,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:51:38,281 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 02:51:38,298 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:51:38,298 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:51:38,353 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-09-10 02:51:38,353 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:51:38,354 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-10 02:51:38,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:51:38,441 INFO L134 CoverageAnalysis]: Checked inductivity of 1969 backedges. 493 proven. 17 refuted. 0 times theorem prover too weak. 1459 trivial. 0 not checked. [2019-09-10 02:51:38,442 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:51:38,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:39,067 INFO L134 CoverageAnalysis]: Checked inductivity of 1969 backedges. 493 proven. 18 refuted. 0 times theorem prover too weak. 1458 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (7)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 02:51:39,070 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:51:39,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 15 [2019-09-10 02:51:39,071 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:51:39,072 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 02:51:39,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 02:51:39,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2019-09-10 02:51:39,072 INFO L87 Difference]: Start difference. First operand 39 states and 61 transitions. Second operand 12 states. [2019-09-10 02:51:39,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:51:39,459 INFO L93 Difference]: Finished difference Result 75 states and 103 transitions. [2019-09-10 02:51:39,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 02:51:39,460 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 193 [2019-09-10 02:51:39,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:51:39,462 INFO L225 Difference]: With dead ends: 75 [2019-09-10 02:51:39,462 INFO L226 Difference]: Without dead ends: 73 [2019-09-10 02:51:39,463 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 376 SyntacticMatches, 7 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=213, Invalid=543, Unknown=0, NotChecked=0, Total=756 [2019-09-10 02:51:39,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-09-10 02:51:39,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 57. [2019-09-10 02:51:39,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-09-10 02:51:39,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 76 transitions. [2019-09-10 02:51:39,473 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 76 transitions. Word has length 193 [2019-09-10 02:51:39,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:51:39,473 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 76 transitions. [2019-09-10 02:51:39,473 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 02:51:39,474 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 76 transitions. [2019-09-10 02:51:39,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-10 02:51:39,476 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:51:39,477 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 17, 10, 10, 10, 10, 10, 10, 10, 7, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:51:39,477 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:51:39,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:51:39,477 INFO L82 PathProgramCache]: Analyzing trace with hash -2067982896, now seen corresponding path program 6 times [2019-09-10 02:51:39,477 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:51:39,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:39,479 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:51:39,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:39,479 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:51:39,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:51:39,610 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 133 proven. 288 refuted. 0 times theorem prover too weak. 735 trivial. 0 not checked. [2019-09-10 02:51:39,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:51:39,610 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:51:39,610 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:51:39,610 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:51:39,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:51:39,610 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:51:39,621 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:51:39,621 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:51:39,659 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:51:39,659 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:51:39,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-10 02:51:39,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:51:39,722 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 380 proven. 4 refuted. 0 times theorem prover too weak. 772 trivial. 0 not checked. [2019-09-10 02:51:39,722 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:51:40,145 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 108 proven. 238 refuted. 0 times theorem prover too weak. 810 trivial. 0 not checked. [2019-09-10 02:51:40,156 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:51:40,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 15 [2019-09-10 02:51:40,157 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:51:40,158 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 02:51:40,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 02:51:40,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2019-09-10 02:51:40,159 INFO L87 Difference]: Start difference. First operand 57 states and 76 transitions. Second operand 13 states. [2019-09-10 02:51:40,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:51:40,382 INFO L93 Difference]: Finished difference Result 62 states and 79 transitions. [2019-09-10 02:51:40,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 02:51:40,384 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 151 [2019-09-10 02:51:40,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:51:40,386 INFO L225 Difference]: With dead ends: 62 [2019-09-10 02:51:40,386 INFO L226 Difference]: Without dead ends: 62 [2019-09-10 02:51:40,387 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 294 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=135, Invalid=327, Unknown=0, NotChecked=0, Total=462 [2019-09-10 02:51:40,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-09-10 02:51:40,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 53. [2019-09-10 02:51:40,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-09-10 02:51:40,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 68 transitions. [2019-09-10 02:51:40,395 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 68 transitions. Word has length 151 [2019-09-10 02:51:40,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:51:40,396 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 68 transitions. [2019-09-10 02:51:40,396 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 02:51:40,396 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 68 transitions. [2019-09-10 02:51:40,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-09-10 02:51:40,399 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:51:40,399 INFO L399 BasicCegarLoop]: trace histogram [31, 31, 25, 15, 15, 15, 15, 15, 15, 15, 10, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:51:40,400 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:51:40,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:51:40,400 INFO L82 PathProgramCache]: Analyzing trace with hash -516480259, now seen corresponding path program 7 times [2019-09-10 02:51:40,400 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:51:40,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:40,401 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:51:40,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:40,401 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:51:40,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:51:40,519 INFO L134 CoverageAnalysis]: Checked inductivity of 2580 backedges. 167 proven. 537 refuted. 0 times theorem prover too weak. 1876 trivial. 0 not checked. [2019-09-10 02:51:40,519 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:51:40,520 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:51:40,520 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:51:40,520 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:51:40,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:51:40,520 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 02:51:40,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:51:40,533 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:51:40,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:51:40,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-10 02:51:40,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:51:40,703 INFO L134 CoverageAnalysis]: Checked inductivity of 2580 backedges. 108 proven. 716 refuted. 0 times theorem prover too weak. 1756 trivial. 0 not checked. [2019-09-10 02:51:40,703 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:51:41,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:41,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:41,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:42,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:42,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:42,155 INFO L134 CoverageAnalysis]: Checked inductivity of 2580 backedges. 108 proven. 756 refuted. 0 times theorem prover too weak. 1716 trivial. 0 not checked. [2019-09-10 02:51:42,159 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:51:42,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 15] total 18 [2019-09-10 02:51:42,162 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:51:42,162 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 02:51:42,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 02:51:42,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2019-09-10 02:51:42,163 INFO L87 Difference]: Start difference. First operand 53 states and 68 transitions. Second operand 10 states. [2019-09-10 02:51:42,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:51:42,354 INFO L93 Difference]: Finished difference Result 68 states and 103 transitions. [2019-09-10 02:51:42,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 02:51:42,355 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 219 [2019-09-10 02:51:42,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:51:42,357 INFO L225 Difference]: With dead ends: 68 [2019-09-10 02:51:42,357 INFO L226 Difference]: Without dead ends: 66 [2019-09-10 02:51:42,358 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 423 SyntacticMatches, 11 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=179, Invalid=373, Unknown=0, NotChecked=0, Total=552 [2019-09-10 02:51:42,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-09-10 02:51:42,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 63. [2019-09-10 02:51:42,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-09-10 02:51:42,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 94 transitions. [2019-09-10 02:51:42,368 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 94 transitions. Word has length 219 [2019-09-10 02:51:42,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:51:42,368 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 94 transitions. [2019-09-10 02:51:42,368 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 02:51:42,369 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 94 transitions. [2019-09-10 02:51:42,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2019-09-10 02:51:42,374 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:51:42,375 INFO L399 BasicCegarLoop]: trace histogram [51, 51, 41, 25, 25, 25, 25, 25, 25, 25, 16, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:51:42,375 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:51:42,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:51:42,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1077898513, now seen corresponding path program 8 times [2019-09-10 02:51:42,376 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:51:42,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:42,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:51:42,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:42,377 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:51:42,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:51:42,585 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 235 proven. 1470 refuted. 0 times theorem prover too weak. 5415 trivial. 0 not checked. [2019-09-10 02:51:42,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:51:42,585 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:51:42,585 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:51:42,585 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:51:42,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:51:42,586 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:51:42,596 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:51:42,596 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:51:42,668 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-09-10 02:51:42,668 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:51:42,669 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-10 02:51:42,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:51:42,797 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 2552 proven. 71 refuted. 0 times theorem prover too weak. 4497 trivial. 0 not checked. [2019-09-10 02:51:42,798 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:51:43,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:43,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:43,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:44,259 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 1364 proven. 219 refuted. 0 times theorem prover too weak. 5537 trivial. 0 not checked. [2019-09-10 02:51:44,272 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:51:44,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 13] total 21 [2019-09-10 02:51:44,272 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:51:44,276 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 02:51:44,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 02:51:44,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2019-09-10 02:51:44,278 INFO L87 Difference]: Start difference. First operand 63 states and 94 transitions. Second operand 16 states. [2019-09-10 02:51:45,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:51:45,066 INFO L93 Difference]: Finished difference Result 99 states and 133 transitions. [2019-09-10 02:51:45,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-10 02:51:45,067 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 355 [2019-09-10 02:51:45,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:51:45,070 INFO L225 Difference]: With dead ends: 99 [2019-09-10 02:51:45,070 INFO L226 Difference]: Without dead ends: 97 [2019-09-10 02:51:45,071 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 751 GetRequests, 696 SyntacticMatches, 11 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 412 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=523, Invalid=1547, Unknown=0, NotChecked=0, Total=2070 [2019-09-10 02:51:45,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-09-10 02:51:45,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 87. [2019-09-10 02:51:45,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-09-10 02:51:45,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 117 transitions. [2019-09-10 02:51:45,085 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 117 transitions. Word has length 355 [2019-09-10 02:51:45,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:51:45,086 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 117 transitions. [2019-09-10 02:51:45,086 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 02:51:45,086 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 117 transitions. [2019-09-10 02:51:45,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 465 [2019-09-10 02:51:45,089 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:51:45,090 INFO L399 BasicCegarLoop]: trace histogram [67, 67, 54, 33, 33, 33, 33, 33, 33, 33, 21, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:51:45,090 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:51:45,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:51:45,090 INFO L82 PathProgramCache]: Analyzing trace with hash -211711407, now seen corresponding path program 9 times [2019-09-10 02:51:45,091 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:51:45,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:45,091 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:51:45,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:45,092 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:51:45,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:51:45,373 INFO L134 CoverageAnalysis]: Checked inductivity of 12387 backedges. 361 proven. 2270 refuted. 0 times theorem prover too weak. 9756 trivial. 0 not checked. [2019-09-10 02:51:45,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:51:45,374 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:51:45,374 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:51:45,374 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:51:45,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:51:45,374 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:51:45,385 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:51:45,385 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:51:45,535 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:51:45,535 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:51:45,537 INFO L256 TraceCheckSpWp]: Trace formula consists of 1033 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-10 02:51:45,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:51:45,670 INFO L134 CoverageAnalysis]: Checked inductivity of 12387 backedges. 361 proven. 2270 refuted. 0 times theorem prover too weak. 9756 trivial. 0 not checked. [2019-09-10 02:51:45,670 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:51:47,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:47,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:48,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:48,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:48,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:48,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:48,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:48,871 INFO L134 CoverageAnalysis]: Checked inductivity of 12387 backedges. 361 proven. 2347 refuted. 0 times theorem prover too weak. 9679 trivial. 0 not checked. [2019-09-10 02:51:48,875 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:51:48,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 19] total 20 [2019-09-10 02:51:48,876 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:51:48,876 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 02:51:48,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 02:51:48,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2019-09-10 02:51:48,877 INFO L87 Difference]: Start difference. First operand 87 states and 117 transitions. Second operand 12 states. [2019-09-10 02:51:49,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:51:49,144 INFO L93 Difference]: Finished difference Result 94 states and 132 transitions. [2019-09-10 02:51:49,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 02:51:49,144 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 464 [2019-09-10 02:51:49,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:51:49,147 INFO L225 Difference]: With dead ends: 94 [2019-09-10 02:51:49,147 INFO L226 Difference]: Without dead ends: 92 [2019-09-10 02:51:49,152 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 954 GetRequests, 911 SyntacticMatches, 17 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=261, Invalid=495, Unknown=0, NotChecked=0, Total=756 [2019-09-10 02:51:49,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-09-10 02:51:49,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-09-10 02:51:49,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-09-10 02:51:49,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 130 transitions. [2019-09-10 02:51:49,173 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 130 transitions. Word has length 464 [2019-09-10 02:51:49,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:51:49,176 INFO L475 AbstractCegarLoop]: Abstraction has 92 states and 130 transitions. [2019-09-10 02:51:49,176 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 02:51:49,177 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 130 transitions. [2019-09-10 02:51:49,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 860 [2019-09-10 02:51:49,187 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:51:49,188 INFO L399 BasicCegarLoop]: trace histogram [125, 125, 101, 62, 62, 62, 62, 62, 62, 62, 39, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:51:49,188 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:51:49,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:51:49,189 INFO L82 PathProgramCache]: Analyzing trace with hash 2137696566, now seen corresponding path program 10 times [2019-09-10 02:51:49,189 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:51:49,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:49,190 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:51:49,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:49,191 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:51:49,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:51:50,161 INFO L134 CoverageAnalysis]: Checked inductivity of 43614 backedges. 2155 proven. 5769 refuted. 0 times theorem prover too weak. 35690 trivial. 0 not checked. [2019-09-10 02:51:50,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:51:50,162 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:51:50,162 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:51:50,162 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:51:50,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:51:50,163 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 02:51:50,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:51:50,179 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:51:50,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:51:50,408 INFO L256 TraceCheckSpWp]: Trace formula consists of 1910 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-10 02:51:50,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:51:50,807 INFO L134 CoverageAnalysis]: Checked inductivity of 43614 backedges. 21304 proven. 3686 refuted. 0 times theorem prover too weak. 18624 trivial. 0 not checked. [2019-09-10 02:51:50,807 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:51:54,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:54,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:54,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:55,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:55,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:56,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:56,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:56,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:56,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:57,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:57,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:57,453 INFO L134 CoverageAnalysis]: Checked inductivity of 43614 backedges. 2265 proven. 6953 refuted. 0 times theorem prover too weak. 34396 trivial. 0 not checked. [2019-09-10 02:51:57,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:51:57,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 30] total 36 [2019-09-10 02:51:57,458 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:51:57,459 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 02:51:57,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 02:51:57,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=1048, Unknown=0, NotChecked=0, Total=1260 [2019-09-10 02:51:57,460 INFO L87 Difference]: Start difference. First operand 92 states and 130 transitions. Second operand 22 states. [2019-09-10 02:51:58,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:51:58,507 INFO L93 Difference]: Finished difference Result 127 states and 178 transitions. [2019-09-10 02:51:58,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-10 02:51:58,507 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 859 [2019-09-10 02:51:58,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:51:58,510 INFO L225 Difference]: With dead ends: 127 [2019-09-10 02:51:58,510 INFO L226 Difference]: Without dead ends: 127 [2019-09-10 02:51:58,512 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1774 GetRequests, 1682 SyntacticMatches, 28 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1183 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1060, Invalid=3230, Unknown=0, NotChecked=0, Total=4290 [2019-09-10 02:51:58,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-09-10 02:51:58,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 116. [2019-09-10 02:51:58,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-09-10 02:51:58,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 165 transitions. [2019-09-10 02:51:58,523 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 165 transitions. Word has length 859 [2019-09-10 02:51:58,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:51:58,524 INFO L475 AbstractCegarLoop]: Abstraction has 116 states and 165 transitions. [2019-09-10 02:51:58,524 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 02:51:58,525 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 165 transitions. [2019-09-10 02:51:58,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1078 [2019-09-10 02:51:58,536 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:51:58,537 INFO L399 BasicCegarLoop]: trace histogram [157, 157, 127, 78, 78, 78, 78, 78, 78, 78, 49, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:51:58,537 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:51:58,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:51:58,538 INFO L82 PathProgramCache]: Analyzing trace with hash 856745370, now seen corresponding path program 11 times [2019-09-10 02:51:58,538 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:51:58,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:58,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:51:58,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:58,539 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:51:58,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:51:59,493 INFO L134 CoverageAnalysis]: Checked inductivity of 68997 backedges. 3891 proven. 7345 refuted. 0 times theorem prover too weak. 57761 trivial. 0 not checked. [2019-09-10 02:51:59,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:51:59,493 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:51:59,494 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:51:59,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 02:51:59,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:51:59,494 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:51:59,505 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:51:59,505 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:51:59,885 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 94 check-sat command(s) [2019-09-10 02:51:59,885 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:51:59,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 1572 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-10 02:51:59,904 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:52:00,507 INFO L134 CoverageAnalysis]: Checked inductivity of 68997 backedges. 26398 proven. 503 refuted. 0 times theorem prover too weak. 42096 trivial. 0 not checked. [2019-09-10 02:52:00,507 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:52:02,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:02,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:03,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:03,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:03,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:04,414 INFO L134 CoverageAnalysis]: Checked inductivity of 68997 backedges. 5653 proven. 1789 refuted. 0 times theorem prover too weak. 61555 trivial. 0 not checked. [2019-09-10 02:52:04,418 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:52:04,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 12, 17] total 31 [2019-09-10 02:52:04,419 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:52:04,420 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-10 02:52:04,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-10 02:52:04,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=767, Unknown=0, NotChecked=0, Total=930 [2019-09-10 02:52:04,421 INFO L87 Difference]: Start difference. First operand 116 states and 165 transitions. Second operand 24 states. [2019-09-10 02:52:05,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:52:05,946 INFO L93 Difference]: Finished difference Result 155 states and 222 transitions. [2019-09-10 02:52:05,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-10 02:52:05,947 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 1077 [2019-09-10 02:52:05,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:52:05,951 INFO L225 Difference]: With dead ends: 155 [2019-09-10 02:52:05,951 INFO L226 Difference]: Without dead ends: 155 [2019-09-10 02:52:05,953 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2218 GetRequests, 2140 SyntacticMatches, 15 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1047 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=949, Invalid=3211, Unknown=0, NotChecked=0, Total=4160 [2019-09-10 02:52:05,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-09-10 02:52:05,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 130. [2019-09-10 02:52:05,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-09-10 02:52:05,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 187 transitions. [2019-09-10 02:52:05,966 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 187 transitions. Word has length 1077 [2019-09-10 02:52:05,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:52:05,967 INFO L475 AbstractCegarLoop]: Abstraction has 130 states and 187 transitions. [2019-09-10 02:52:05,967 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-10 02:52:05,967 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 187 transitions. [2019-09-10 02:52:05,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 751 [2019-09-10 02:52:05,973 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:52:05,974 INFO L399 BasicCegarLoop]: trace histogram [109, 109, 88, 54, 54, 54, 54, 54, 54, 54, 34, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:52:05,974 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:52:05,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:52:05,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1020040988, now seen corresponding path program 12 times [2019-09-10 02:52:05,975 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:52:05,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:52:05,975 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:52:05,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:52:05,976 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:52:06,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:52:07,095 INFO L134 CoverageAnalysis]: Checked inductivity of 33096 backedges. 5957 proven. 4942 refuted. 0 times theorem prover too weak. 22197 trivial. 0 not checked. [2019-09-10 02:52:07,096 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:52:07,096 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:52:07,096 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:52:07,096 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:52:07,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:52:07,097 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:52:07,112 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:52:07,112 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:52:07,357 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:52:07,358 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:52:07,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 1668 conjuncts, 220 conjunts are in the unsatisfiable core [2019-09-10 02:52:07,382 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:52:08,277 INFO L134 CoverageAnalysis]: Checked inductivity of 33096 backedges. 5957 proven. 4942 refuted. 0 times theorem prover too weak. 22197 trivial. 0 not checked. [2019-09-10 02:52:08,277 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:52:09,687 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-09-10 02:52:09,867 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-09-10 02:52:10,057 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2019-09-10 02:52:10,247 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2019-09-10 02:52:11,047 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2019-09-10 02:52:11,614 WARN L188 SmtUtils]: Spent 392.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2019-09-10 02:52:12,020 WARN L188 SmtUtils]: Spent 403.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2019-09-10 02:52:12,429 WARN L188 SmtUtils]: Spent 405.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2019-09-10 02:52:12,851 WARN L188 SmtUtils]: Spent 418.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2019-09-10 02:52:14,297 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-09-10 02:52:14,476 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-09-10 02:52:14,665 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2019-09-10 02:52:14,853 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2019-09-10 02:52:15,805 WARN L188 SmtUtils]: Spent 945.00 ms on a formula simplification that was a NOOP. DAG size: 302 [2019-09-10 02:52:16,787 WARN L188 SmtUtils]: Spent 976.00 ms on a formula simplification that was a NOOP. DAG size: 302 [2019-09-10 02:52:17,837 WARN L188 SmtUtils]: Spent 1.04 s on a formula simplification that was a NOOP. DAG size: 304 [2019-09-10 02:52:18,826 WARN L188 SmtUtils]: Spent 983.00 ms on a formula simplification that was a NOOP. DAG size: 304 [2019-09-10 02:52:20,248 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-09-10 02:52:20,434 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-09-10 02:52:20,626 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2019-09-10 02:52:20,821 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2019-09-10 02:52:22,086 WARN L188 SmtUtils]: Spent 392.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2019-09-10 02:52:22,498 WARN L188 SmtUtils]: Spent 409.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2019-09-10 02:52:22,942 WARN L188 SmtUtils]: Spent 438.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2019-09-10 02:52:23,375 WARN L188 SmtUtils]: Spent 430.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2019-09-10 02:52:25,900 WARN L188 SmtUtils]: Spent 2.51 s on a formula simplification that was a NOOP. DAG size: 491 [2019-09-10 02:52:28,351 WARN L188 SmtUtils]: Spent 2.44 s on a formula simplification that was a NOOP. DAG size: 491 [2019-09-10 02:52:30,862 WARN L188 SmtUtils]: Spent 2.50 s on a formula simplification that was a NOOP. DAG size: 493 [2019-09-10 02:52:33,275 WARN L188 SmtUtils]: Spent 2.40 s on a formula simplification that was a NOOP. DAG size: 493 [2019-09-10 02:52:34,796 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-09-10 02:52:34,977 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-09-10 02:52:35,162 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2019-09-10 02:52:35,342 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2019-09-10 02:52:36,616 WARN L188 SmtUtils]: Spent 425.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2019-09-10 02:52:37,050 WARN L188 SmtUtils]: Spent 429.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2019-09-10 02:52:37,485 WARN L188 SmtUtils]: Spent 430.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2019-09-10 02:52:37,911 WARN L188 SmtUtils]: Spent 423.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2019-09-10 02:52:38,353 WARN L188 SmtUtils]: Spent 426.00 ms on a formula simplification that was a NOOP. DAG size: 269 [2019-09-10 02:52:38,760 WARN L188 SmtUtils]: Spent 405.00 ms on a formula simplification that was a NOOP. DAG size: 265 [2019-09-10 02:52:39,173 WARN L188 SmtUtils]: Spent 412.00 ms on a formula simplification that was a NOOP. DAG size: 262 [2019-09-10 02:52:39,570 WARN L188 SmtUtils]: Spent 395.00 ms on a formula simplification that was a NOOP. DAG size: 258 [2019-09-10 02:52:39,966 WARN L188 SmtUtils]: Spent 395.00 ms on a formula simplification that was a NOOP. DAG size: 254 [2019-09-10 02:52:40,343 WARN L188 SmtUtils]: Spent 375.00 ms on a formula simplification that was a NOOP. DAG size: 250 [2019-09-10 02:52:40,714 WARN L188 SmtUtils]: Spent 370.00 ms on a formula simplification that was a NOOP. DAG size: 246 [2019-09-10 02:52:41,089 WARN L188 SmtUtils]: Spent 374.00 ms on a formula simplification that was a NOOP. DAG size: 242 [2019-09-10 02:52:41,439 WARN L188 SmtUtils]: Spent 347.00 ms on a formula simplification that was a NOOP. DAG size: 238 [2019-09-10 02:52:41,777 WARN L188 SmtUtils]: Spent 337.00 ms on a formula simplification that was a NOOP. DAG size: 234 [2019-09-10 02:52:42,110 WARN L188 SmtUtils]: Spent 332.00 ms on a formula simplification that was a NOOP. DAG size: 230 [2019-09-10 02:52:42,443 WARN L188 SmtUtils]: Spent 331.00 ms on a formula simplification that was a NOOP. DAG size: 226 [2019-09-10 02:52:42,761 WARN L188 SmtUtils]: Spent 317.00 ms on a formula simplification that was a NOOP. DAG size: 222 [2019-09-10 02:52:43,071 WARN L188 SmtUtils]: Spent 308.00 ms on a formula simplification that was a NOOP. DAG size: 219 [2019-09-10 02:52:43,377 WARN L188 SmtUtils]: Spent 305.00 ms on a formula simplification that was a NOOP. DAG size: 215 [2019-09-10 02:52:43,711 WARN L188 SmtUtils]: Spent 332.00 ms on a formula simplification that was a NOOP. DAG size: 211 [2019-09-10 02:52:44,000 WARN L188 SmtUtils]: Spent 288.00 ms on a formula simplification that was a NOOP. DAG size: 207 [2019-09-10 02:52:44,288 WARN L188 SmtUtils]: Spent 286.00 ms on a formula simplification that was a NOOP. DAG size: 205 [2019-09-10 02:52:44,569 WARN L188 SmtUtils]: Spent 280.00 ms on a formula simplification that was a NOOP. DAG size: 201 [2019-09-10 02:52:44,850 WARN L188 SmtUtils]: Spent 280.00 ms on a formula simplification that was a NOOP. DAG size: 197 [2019-09-10 02:52:45,116 WARN L188 SmtUtils]: Spent 264.00 ms on a formula simplification that was a NOOP. DAG size: 194 [2019-09-10 02:52:45,372 WARN L188 SmtUtils]: Spent 255.00 ms on a formula simplification that was a NOOP. DAG size: 190 [2019-09-10 02:52:45,628 WARN L188 SmtUtils]: Spent 254.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2019-09-10 02:52:45,864 WARN L188 SmtUtils]: Spent 235.00 ms on a formula simplification that was a NOOP. DAG size: 183 [2019-09-10 02:52:46,108 WARN L188 SmtUtils]: Spent 242.00 ms on a formula simplification that was a NOOP. DAG size: 179 [2019-09-10 02:52:46,353 WARN L188 SmtUtils]: Spent 243.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2019-09-10 02:52:46,575 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification that was a NOOP. DAG size: 173 [2019-09-10 02:52:46,792 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-09-10 02:52:47,010 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 165 [2019-09-10 02:52:47,227 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 161 [2019-09-10 02:52:47,429 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 158 [2019-09-10 02:52:47,626 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 156 [2019-09-10 02:52:47,816 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 153 [2019-09-10 02:52:48,006 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 150 [2019-09-10 02:52:48,186 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 147 [2019-09-10 02:52:48,368 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2019-09-10 02:52:48,545 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-09-10 02:52:48,716 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2019-09-10 02:52:48,880 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 131 [2019-09-10 02:52:49,037 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2019-09-10 02:52:49,186 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 125 [2019-09-10 02:52:49,332 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2019-09-10 02:52:49,479 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2019-09-10 02:52:49,613 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-09-10 02:52:49,746 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2019-09-10 02:52:49,872 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2019-09-10 02:52:49,991 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2019-09-10 02:52:50,103 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2019-09-10 02:52:50,212 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2019-09-10 02:52:50,319 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2019-09-10 02:52:52,679 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2019-09-10 02:52:56,104 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-09-10 02:52:56,288 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-09-10 02:52:56,476 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2019-09-10 02:52:56,658 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2019-09-10 02:53:00,623 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-09-10 02:53:01,266 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-09-10 02:53:01,448 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-09-10 02:53:01,630 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2019-09-10 02:53:01,818 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2019-09-10 02:53:03,122 WARN L188 SmtUtils]: Spent 400.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2019-09-10 02:53:03,532 WARN L188 SmtUtils]: Spent 407.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2019-09-10 02:53:03,950 WARN L188 SmtUtils]: Spent 412.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2019-09-10 02:53:04,369 WARN L188 SmtUtils]: Spent 415.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2019-09-10 02:53:05,761 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-09-10 02:53:05,943 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-09-10 02:53:06,132 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2019-09-10 02:53:06,320 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2019-09-10 02:53:07,278 WARN L188 SmtUtils]: Spent 952.00 ms on a formula simplification that was a NOOP. DAG size: 302 [2019-09-10 02:53:08,231 WARN L188 SmtUtils]: Spent 947.00 ms on a formula simplification that was a NOOP. DAG size: 302 [2019-09-10 02:53:09,264 WARN L188 SmtUtils]: Spent 1.03 s on a formula simplification that was a NOOP. DAG size: 304 [2019-09-10 02:53:10,233 WARN L188 SmtUtils]: Spent 964.00 ms on a formula simplification that was a NOOP. DAG size: 304 [2019-09-10 02:53:11,715 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-09-10 02:53:11,897 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-09-10 02:53:12,100 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2019-09-10 02:53:12,292 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2019-09-10 02:53:12,493 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 165 [2019-09-10 02:53:12,678 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 161 [2019-09-10 02:53:12,858 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 157 [2019-09-10 02:53:13,031 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 153 [2019-09-10 02:53:13,200 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-09-10 02:53:13,362 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 145 [2019-09-10 02:53:13,521 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 141 [2019-09-10 02:53:13,676 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 137 [2019-09-10 02:53:13,827 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-09-10 02:53:13,969 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2019-09-10 02:53:14,106 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2019-09-10 02:53:14,241 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2019-09-10 02:53:14,370 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2019-09-10 02:53:14,489 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-09-10 02:53:14,607 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2019-09-10 02:53:14,719 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2019-09-10 02:53:14,824 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2019-09-10 02:53:14,931 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-09-10 02:53:20,635 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-09-10 02:53:20,815 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-09-10 02:53:21,002 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2019-09-10 02:53:21,188 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2019-09-10 02:53:22,420 WARN L188 SmtUtils]: Spent 388.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2019-09-10 02:53:22,834 WARN L188 SmtUtils]: Spent 411.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2019-09-10 02:53:23,244 WARN L188 SmtUtils]: Spent 405.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2019-09-10 02:53:23,650 WARN L188 SmtUtils]: Spent 404.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2019-09-10 02:53:24,899 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2019-09-10 02:53:28,119 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-09-10 02:53:28,301 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-09-10 02:53:28,494 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2019-09-10 02:53:28,695 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2019-09-10 02:53:31,986 INFO L134 CoverageAnalysis]: Checked inductivity of 33096 backedges. 5957 proven. 4942 refuted. 0 times theorem prover too weak. 22197 trivial. 0 not checked. [2019-09-10 02:53:31,991 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:53:31,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 36 [2019-09-10 02:53:31,991 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:53:31,993 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-10 02:53:31,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-10 02:53:31,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=1013, Unknown=0, NotChecked=0, Total=1260 [2019-09-10 02:53:31,994 INFO L87 Difference]: Start difference. First operand 130 states and 187 transitions. Second operand 36 states. [2019-09-10 02:53:32,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:53:32,183 INFO L93 Difference]: Finished difference Result 129 states and 186 transitions. [2019-09-10 02:53:32,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-10 02:53:32,184 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 750 [2019-09-10 02:53:32,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:53:32,185 INFO L225 Difference]: With dead ends: 129 [2019-09-10 02:53:32,185 INFO L226 Difference]: Without dead ends: 0 [2019-09-10 02:53:32,186 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1721 GetRequests, 1468 SyntacticMatches, 218 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5500 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=271, Invalid=1061, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 02:53:32,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-10 02:53:32,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-10 02:53:32,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-10 02:53:32,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-10 02:53:32,187 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 750 [2019-09-10 02:53:32,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:53:32,188 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-10 02:53:32,188 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-10 02:53:32,188 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-10 02:53:32,188 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-10 02:53:32,193 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 02:53:32 BoogieIcfgContainer [2019-09-10 02:53:32,193 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-10 02:53:32,195 INFO L168 Benchmark]: Toolchain (without parser) took 120222.06 ms. Allocated memory was 135.8 MB in the beginning and 1.8 GB in the end (delta: 1.7 GB). Free memory was 92.1 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 263.2 MB. Max. memory is 7.1 GB. [2019-09-10 02:53:32,196 INFO L168 Benchmark]: CDTParser took 1.16 ms. Allocated memory is still 135.8 MB. Free memory was 110.3 MB in the beginning and 110.1 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-10 02:53:32,196 INFO L168 Benchmark]: CACSL2BoogieTranslator took 254.46 ms. Allocated memory is still 135.8 MB. Free memory was 91.9 MB in the beginning and 82.3 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. [2019-09-10 02:53:32,197 INFO L168 Benchmark]: Boogie Preprocessor took 107.55 ms. Allocated memory was 135.8 MB in the beginning and 201.3 MB in the end (delta: 65.5 MB). Free memory was 82.3 MB in the beginning and 178.5 MB in the end (delta: -96.2 MB). Peak memory consumption was 15.9 MB. Max. memory is 7.1 GB. [2019-09-10 02:53:32,197 INFO L168 Benchmark]: RCFGBuilder took 236.16 ms. Allocated memory is still 201.3 MB. Free memory was 178.5 MB in the beginning and 166.9 MB in the end (delta: 11.7 MB). Peak memory consumption was 11.7 MB. Max. memory is 7.1 GB. [2019-09-10 02:53:32,198 INFO L168 Benchmark]: TraceAbstraction took 119619.91 ms. Allocated memory was 201.3 MB in the beginning and 1.8 GB in the end (delta: 1.6 GB). Free memory was 166.3 MB in the beginning and 1.5 GB in the end (delta: -1.3 GB). Peak memory consumption was 271.8 MB. Max. memory is 7.1 GB. [2019-09-10 02:53:32,200 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.16 ms. Allocated memory is still 135.8 MB. Free memory was 110.3 MB in the beginning and 110.1 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 254.46 ms. Allocated memory is still 135.8 MB. Free memory was 91.9 MB in the beginning and 82.3 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 107.55 ms. Allocated memory was 135.8 MB in the beginning and 201.3 MB in the end (delta: 65.5 MB). Free memory was 82.3 MB in the beginning and 178.5 MB in the end (delta: -96.2 MB). Peak memory consumption was 15.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 236.16 ms. Allocated memory is still 201.3 MB. Free memory was 178.5 MB in the beginning and 166.9 MB in the end (delta: 11.7 MB). Peak memory consumption was 11.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 119619.91 ms. Allocated memory was 201.3 MB in the beginning and 1.8 GB in the end (delta: 1.6 GB). Free memory was 166.3 MB in the beginning and 1.5 GB in the end (delta: -1.3 GB). Peak memory consumption was 271.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 34]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 24 locations, 1 error locations. SAFE Result, 119.5s OverallTime, 15 OverallIterations, 157 TraceHistogramMax, 5.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 365 SDtfs, 820 SDslu, 1646 SDs, 0 SdLazy, 2673 SolverSat, 1023 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 9118 GetRequests, 8403 SyntacticMatches, 334 SemanticMatches, 381 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8796 ImplicationChecksByTransitivity, 6.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=130occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.1s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 82 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 2.0s SatisfiabilityAnalysisTime, 107.9s InterpolantComputationTime, 8607 NumberOfCodeBlocks, 7866 NumberOfCodeBlocksAsserted, 150 NumberOfCheckSat, 12855 ConstructedInterpolants, 0 QuantifiedInterpolants, 12489069 SizeOfPredicates, 81 NumberOfNonLiveVariables, 7892 ConjunctsInSsa, 359 ConjunctsInUnsatCore, 41 InterpolantComputations, 2 PerfectInterpolantSequences, 461045/514011 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...