java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/loop-acceleration/nested_1-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 01:50:29,008 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 01:50:29,010 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 01:50:29,021 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 01:50:29,022 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 01:50:29,023 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 01:50:29,024 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 01:50:29,026 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 01:50:29,027 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 01:50:29,028 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 01:50:29,029 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 01:50:29,030 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 01:50:29,030 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 01:50:29,031 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 01:50:29,032 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 01:50:29,033 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 01:50:29,034 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 01:50:29,035 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 01:50:29,036 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 01:50:29,038 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 01:50:29,039 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 01:50:29,040 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 01:50:29,041 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 01:50:29,042 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 01:50:29,044 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 01:50:29,044 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 01:50:29,044 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 01:50:29,045 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 01:50:29,046 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 01:50:29,046 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 01:50:29,047 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 01:50:29,047 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 01:50:29,048 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 01:50:29,049 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 01:50:29,050 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 01:50:29,050 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 01:50:29,051 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 01:50:29,051 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 01:50:29,051 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 01:50:29,052 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 01:50:29,053 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 01:50:29,054 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 01:50:29,068 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 01:50:29,068 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 01:50:29,068 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 01:50:29,069 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 01:50:29,069 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 01:50:29,069 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 01:50:29,070 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 01:50:29,070 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 01:50:29,070 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 01:50:29,070 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 01:50:29,071 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 01:50:29,071 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 01:50:29,071 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 01:50:29,071 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 01:50:29,072 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 01:50:29,072 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 01:50:29,072 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 01:50:29,072 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 01:50:29,072 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 01:50:29,073 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 01:50:29,073 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 01:50:29,073 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 01:50:29,073 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 01:50:29,073 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 01:50:29,074 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 01:50:29,074 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 01:50:29,074 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 01:50:29,074 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 01:50:29,074 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 01:50:29,075 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 01:50:29,127 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 01:50:29,138 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 01:50:29,141 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 01:50:29,142 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 01:50:29,143 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 01:50:29,143 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/nested_1-1.c [2019-09-10 01:50:29,204 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d0e7124b/43a50868bb1b4ade9c0fe91e5f8ab1c0/FLAG08662598b [2019-09-10 01:50:29,618 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 01:50:29,619 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/nested_1-1.c [2019-09-10 01:50:29,625 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d0e7124b/43a50868bb1b4ade9c0fe91e5f8ab1c0/FLAG08662598b [2019-09-10 01:50:30,027 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d0e7124b/43a50868bb1b4ade9c0fe91e5f8ab1c0 [2019-09-10 01:50:30,037 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 01:50:30,039 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 01:50:30,040 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 01:50:30,040 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 01:50:30,043 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 01:50:30,044 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 01:50:30" (1/1) ... [2019-09-10 01:50:30,047 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a2301ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:50:30, skipping insertion in model container [2019-09-10 01:50:30,047 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 01:50:30" (1/1) ... [2019-09-10 01:50:30,054 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 01:50:30,070 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 01:50:30,226 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 01:50:30,230 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 01:50:30,244 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 01:50:30,256 INFO L192 MainTranslator]: Completed translation [2019-09-10 01:50:30,257 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:50:30 WrapperNode [2019-09-10 01:50:30,257 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 01:50:30,258 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 01:50:30,258 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 01:50:30,258 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 01:50:30,353 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:50:30" (1/1) ... [2019-09-10 01:50:30,353 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:50:30" (1/1) ... [2019-09-10 01:50:30,358 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:50:30" (1/1) ... [2019-09-10 01:50:30,359 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:50:30" (1/1) ... [2019-09-10 01:50:30,362 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:50:30" (1/1) ... [2019-09-10 01:50:30,368 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:50:30" (1/1) ... [2019-09-10 01:50:30,369 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:50:30" (1/1) ... [2019-09-10 01:50:30,370 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 01:50:30,371 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 01:50:30,371 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 01:50:30,371 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 01:50:30,372 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:50:30" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 01:50:30,428 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 01:50:30,429 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 01:50:30,429 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-10 01:50:30,429 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 01:50:30,429 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 01:50:30,429 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-10 01:50:30,429 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 01:50:30,429 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 01:50:30,429 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 01:50:30,594 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 01:50:30,594 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-09-10 01:50:30,595 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 01:50:30 BoogieIcfgContainer [2019-09-10 01:50:30,596 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 01:50:30,596 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 01:50:30,597 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 01:50:30,600 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 01:50:30,600 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 01:50:30" (1/3) ... [2019-09-10 01:50:30,601 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@569ea5ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 01:50:30, skipping insertion in model container [2019-09-10 01:50:30,601 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:50:30" (2/3) ... [2019-09-10 01:50:30,601 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@569ea5ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 01:50:30, skipping insertion in model container [2019-09-10 01:50:30,602 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 01:50:30" (3/3) ... [2019-09-10 01:50:30,603 INFO L109 eAbstractionObserver]: Analyzing ICFG nested_1-1.c [2019-09-10 01:50:30,614 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 01:50:30,622 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 01:50:30,639 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 01:50:30,676 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 01:50:30,677 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 01:50:30,677 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 01:50:30,677 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 01:50:30,677 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 01:50:30,677 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 01:50:30,677 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 01:50:30,678 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 01:50:30,697 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-09-10 01:50:30,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-10 01:50:30,708 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:50:30,709 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:50:30,711 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:50:30,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:50:30,717 INFO L82 PathProgramCache]: Analyzing trace with hash -873786703, now seen corresponding path program 1 times [2019-09-10 01:50:30,720 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:50:30,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:50:30,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:50:30,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:50:30,775 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:50:30,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:50:30,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:50:30,941 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:50:30,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 01:50:30,942 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:50:30,946 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 01:50:30,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 01:50:30,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 01:50:30,965 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 3 states. [2019-09-10 01:50:31,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:50:31,005 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2019-09-10 01:50:31,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 01:50:31,007 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-09-10 01:50:31,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:50:31,016 INFO L225 Difference]: With dead ends: 22 [2019-09-10 01:50:31,017 INFO L226 Difference]: Without dead ends: 16 [2019-09-10 01:50:31,019 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 01:50:31,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-09-10 01:50:31,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 14. [2019-09-10 01:50:31,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-09-10 01:50:31,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2019-09-10 01:50:31,063 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 10 [2019-09-10 01:50:31,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:50:31,064 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2019-09-10 01:50:31,064 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 01:50:31,064 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2019-09-10 01:50:31,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-10 01:50:31,065 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:50:31,065 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:50:31,065 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:50:31,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:50:31,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1621360120, now seen corresponding path program 1 times [2019-09-10 01:50:31,066 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:50:31,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:50:31,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:50:31,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:50:31,067 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:50:31,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:50:31,129 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:50:31,129 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:50:31,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 01:50:31,130 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:50:31,131 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 01:50:31,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 01:50:31,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 01:50:31,132 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 3 states. [2019-09-10 01:50:31,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:50:31,145 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2019-09-10 01:50:31,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 01:50:31,146 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-09-10 01:50:31,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:50:31,147 INFO L225 Difference]: With dead ends: 15 [2019-09-10 01:50:31,147 INFO L226 Difference]: Without dead ends: 15 [2019-09-10 01:50:31,150 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 01:50:31,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-09-10 01:50:31,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-09-10 01:50:31,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-09-10 01:50:31,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-09-10 01:50:31,158 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 13 [2019-09-10 01:50:31,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:50:31,158 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-09-10 01:50:31,159 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 01:50:31,160 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2019-09-10 01:50:31,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-10 01:50:31,160 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:50:31,160 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:50:31,161 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:50:31,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:50:31,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1574756514, now seen corresponding path program 1 times [2019-09-10 01:50:31,161 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:50:31,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:50:31,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:50:31,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:50:31,165 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:50:31,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:50:31,295 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:50:31,298 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:50:31,298 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:50:31,300 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 15 with the following transitions: [2019-09-10 01:50:31,302 INFO L207 CegarAbsIntRunner]: [0], [4], [11], [13], [20], [22], [26], [32], [35], [37], [43], [44], [45], [47] [2019-09-10 01:50:31,345 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 01:50:31,345 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 01:50:31,439 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 01:50:31,820 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 01:50:31,823 INFO L272 AbstractInterpreter]: Visited 14 different actions 110 times. Merged at 5 different actions 44 times. Widened at 3 different actions 17 times. Performed 231 root evaluator evaluations with a maximum evaluation depth of 12. Performed 231 inverse root evaluator evaluations with a maximum inverse evaluation depth of 12. Found 14 fixpoints after 3 different actions. Largest state had 4 variables. [2019-09-10 01:50:31,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:50:31,828 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 01:50:31,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:50:31,829 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 01:50:31,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:50:31,856 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:50:31,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:50:31,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-10 01:50:31,885 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:50:31,929 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:50:31,930 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:50:31,971 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-10 01:50:31,976 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:50:31,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 4] total 9 [2019-09-10 01:50:31,976 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:50:31,977 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 01:50:31,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 01:50:31,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-09-10 01:50:31,978 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 7 states. [2019-09-10 01:50:32,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:50:32,068 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2019-09-10 01:50:32,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 01:50:32,069 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2019-09-10 01:50:32,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:50:32,070 INFO L225 Difference]: With dead ends: 25 [2019-09-10 01:50:32,070 INFO L226 Difference]: Without dead ends: 25 [2019-09-10 01:50:32,071 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-09-10 01:50:32,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-09-10 01:50:32,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2019-09-10 01:50:32,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-09-10 01:50:32,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2019-09-10 01:50:32,075 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 14 [2019-09-10 01:50:32,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:50:32,075 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2019-09-10 01:50:32,075 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 01:50:32,075 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2019-09-10 01:50:32,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-10 01:50:32,076 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:50:32,076 INFO L399 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:50:32,077 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:50:32,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:50:32,077 INFO L82 PathProgramCache]: Analyzing trace with hash 93409041, now seen corresponding path program 2 times [2019-09-10 01:50:32,077 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:50:32,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:50:32,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:50:32,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:50:32,079 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:50:32,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:50:32,163 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-10 01:50:32,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:50:32,164 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:50:32,164 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:50:32,165 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:50:32,165 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:50:32,165 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:50:32,184 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 01:50:32,184 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 01:50:32,219 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-09-10 01:50:32,220 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:50:32,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-10 01:50:32,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:50:32,284 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 01:50:32,284 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:50:32,343 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-10 01:50:32,348 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:50:32,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 5] total 13 [2019-09-10 01:50:32,348 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:50:32,349 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 01:50:32,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 01:50:32,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2019-09-10 01:50:32,350 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 10 states. [2019-09-10 01:50:32,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:50:32,568 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2019-09-10 01:50:32,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 01:50:32,568 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-09-10 01:50:32,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:50:32,569 INFO L225 Difference]: With dead ends: 34 [2019-09-10 01:50:32,569 INFO L226 Difference]: Without dead ends: 34 [2019-09-10 01:50:32,570 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2019-09-10 01:50:32,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-09-10 01:50:32,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 29. [2019-09-10 01:50:32,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-09-10 01:50:32,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2019-09-10 01:50:32,580 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 20 [2019-09-10 01:50:32,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:50:32,580 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2019-09-10 01:50:32,580 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 01:50:32,580 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2019-09-10 01:50:32,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-10 01:50:32,582 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:50:32,583 INFO L399 BasicCegarLoop]: trace histogram [9, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:50:32,583 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:50:32,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:50:32,584 INFO L82 PathProgramCache]: Analyzing trace with hash 50981508, now seen corresponding path program 3 times [2019-09-10 01:50:32,584 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:50:32,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:50:32,587 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:50:32,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:50:32,587 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:50:32,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:50:32,736 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 35 proven. 6 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-10 01:50:32,737 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:50:32,737 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:50:32,737 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:50:32,737 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:50:32,737 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:50:32,738 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:50:32,755 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 01:50:32,756 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 01:50:32,776 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 01:50:32,776 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:50:32,777 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-10 01:50:32,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:50:32,882 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-10 01:50:32,884 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:50:32,984 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-10 01:50:32,988 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:50:32,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 6] total 17 [2019-09-10 01:50:32,988 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:50:32,989 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 01:50:32,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 01:50:32,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2019-09-10 01:50:32,991 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 13 states. [2019-09-10 01:50:33,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:50:33,413 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2019-09-10 01:50:33,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 01:50:33,414 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 28 [2019-09-10 01:50:33,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:50:33,415 INFO L225 Difference]: With dead ends: 45 [2019-09-10 01:50:33,415 INFO L226 Difference]: Without dead ends: 45 [2019-09-10 01:50:33,416 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=196, Invalid=674, Unknown=0, NotChecked=0, Total=870 [2019-09-10 01:50:33,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-09-10 01:50:33,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2019-09-10 01:50:33,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-10 01:50:33,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2019-09-10 01:50:33,421 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 28 [2019-09-10 01:50:33,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:50:33,422 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-09-10 01:50:33,422 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 01:50:33,422 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2019-09-10 01:50:33,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-10 01:50:33,424 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:50:33,424 INFO L399 BasicCegarLoop]: trace histogram [16, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:50:33,424 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:50:33,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:50:33,424 INFO L82 PathProgramCache]: Analyzing trace with hash 1027694321, now seen corresponding path program 4 times [2019-09-10 01:50:33,425 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:50:33,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:50:33,426 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:50:33,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:50:33,426 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:50:33,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:50:33,558 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 79 proven. 10 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-09-10 01:50:33,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:50:33,559 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:50:33,559 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:50:33,559 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:50:33,559 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:50:33,559 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 01:50:33,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:50:33,576 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:50:33,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:50:33,601 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-10 01:50:33,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:50:33,746 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-10 01:50:33,746 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:50:33,878 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 0 proven. 166 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-10 01:50:33,882 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:50:33,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 7] total 21 [2019-09-10 01:50:33,883 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:50:33,883 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 01:50:33,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 01:50:33,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-09-10 01:50:33,884 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 16 states. [2019-09-10 01:50:34,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:50:34,472 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2019-09-10 01:50:34,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-10 01:50:34,478 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 38 [2019-09-10 01:50:34,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:50:34,479 INFO L225 Difference]: With dead ends: 58 [2019-09-10 01:50:34,480 INFO L226 Difference]: Without dead ends: 58 [2019-09-10 01:50:34,481 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=325, Invalid=1397, Unknown=0, NotChecked=0, Total=1722 [2019-09-10 01:50:34,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-09-10 01:50:34,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 51. [2019-09-10 01:50:34,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-09-10 01:50:34,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2019-09-10 01:50:34,496 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 38 [2019-09-10 01:50:34,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:50:34,498 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2019-09-10 01:50:34,498 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 01:50:34,498 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2019-09-10 01:50:34,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-10 01:50:34,499 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:50:34,500 INFO L399 BasicCegarLoop]: trace histogram [25, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:50:34,500 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:50:34,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:50:34,501 INFO L82 PathProgramCache]: Analyzing trace with hash 79747558, now seen corresponding path program 5 times [2019-09-10 01:50:34,502 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:50:34,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:50:34,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:50:34,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:50:34,503 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:50:34,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:50:34,663 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 149 proven. 15 refuted. 0 times theorem prover too weak. 296 trivial. 0 not checked. [2019-09-10 01:50:34,663 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:50:34,663 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:50:34,664 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:50:34,664 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:50:34,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:50:34,664 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 01:50:34,678 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 01:50:34,679 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:50:34,753 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-09-10 01:50:34,753 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:50:34,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-10 01:50:34,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:50:34,801 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 153 proven. 15 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2019-09-10 01:50:34,801 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:50:34,930 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 153 proven. 15 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2019-09-10 01:50:34,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:50:34,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2019-09-10 01:50:34,934 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:50:34,934 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 01:50:34,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 01:50:34,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2019-09-10 01:50:34,935 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand 9 states. [2019-09-10 01:50:34,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:50:34,999 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2019-09-10 01:50:34,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 01:50:35,000 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2019-09-10 01:50:35,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:50:35,001 INFO L225 Difference]: With dead ends: 56 [2019-09-10 01:50:35,001 INFO L226 Difference]: Without dead ends: 56 [2019-09-10 01:50:35,001 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2019-09-10 01:50:35,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-09-10 01:50:35,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-09-10 01:50:35,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-09-10 01:50:35,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2019-09-10 01:50:35,006 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 50 [2019-09-10 01:50:35,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:50:35,007 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2019-09-10 01:50:35,007 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 01:50:35,007 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2019-09-10 01:50:35,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-10 01:50:35,008 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:50:35,008 INFO L399 BasicCegarLoop]: trace histogram [30, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:50:35,009 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:50:35,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:50:35,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1763701256, now seen corresponding path program 6 times [2019-09-10 01:50:35,009 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:50:35,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:50:35,010 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:50:35,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:50:35,010 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:50:35,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:50:35,129 INFO L134 CoverageAnalysis]: Checked inductivity of 620 backedges. 201 proven. 21 refuted. 0 times theorem prover too weak. 398 trivial. 0 not checked. [2019-09-10 01:50:35,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:50:35,129 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:50:35,130 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:50:35,130 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:50:35,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:50:35,130 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 01:50:35,159 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 01:50:35,160 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:50:35,190 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 01:50:35,190 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:50:35,191 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-10 01:50:35,194 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:50:35,377 INFO L134 CoverageAnalysis]: Checked inductivity of 620 backedges. 0 proven. 536 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-10 01:50:35,378 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:50:35,928 INFO L134 CoverageAnalysis]: Checked inductivity of 620 backedges. 6 proven. 530 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-10 01:50:35,932 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:50:35,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14, 14] total 33 [2019-09-10 01:50:35,932 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:50:35,933 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 01:50:35,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 01:50:35,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=818, Unknown=0, NotChecked=0, Total=1056 [2019-09-10 01:50:35,934 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand 21 states. [2019-09-10 01:50:37,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:50:37,116 INFO L93 Difference]: Finished difference Result 80 states and 87 transitions. [2019-09-10 01:50:37,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-09-10 01:50:37,116 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 55 [2019-09-10 01:50:37,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:50:37,118 INFO L225 Difference]: With dead ends: 80 [2019-09-10 01:50:37,118 INFO L226 Difference]: Without dead ends: 80 [2019-09-10 01:50:37,121 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1065 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=880, Invalid=3812, Unknown=0, NotChecked=0, Total=4692 [2019-09-10 01:50:37,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-09-10 01:50:37,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 71. [2019-09-10 01:50:37,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-09-10 01:50:37,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 77 transitions. [2019-09-10 01:50:37,128 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 77 transitions. Word has length 55 [2019-09-10 01:50:37,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:50:37,128 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 77 transitions. [2019-09-10 01:50:37,128 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 01:50:37,128 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2019-09-10 01:50:37,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-10 01:50:37,130 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:50:37,130 INFO L399 BasicCegarLoop]: trace histogram [42, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:50:37,130 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:50:37,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:50:37,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1703496983, now seen corresponding path program 7 times [2019-09-10 01:50:37,131 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:50:37,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:50:37,132 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:50:37,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:50:37,132 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:50:37,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:50:37,295 INFO L134 CoverageAnalysis]: Checked inductivity of 1164 backedges. 326 proven. 28 refuted. 0 times theorem prover too weak. 810 trivial. 0 not checked. [2019-09-10 01:50:37,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:50:37,295 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:50:37,295 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:50:37,296 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:50:37,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:50:37,296 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:50:37,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:50:37,307 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 01:50:37,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:50:37,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-10 01:50:37,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:50:37,548 INFO L134 CoverageAnalysis]: Checked inductivity of 1164 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2019-09-10 01:50:37,549 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:50:38,067 INFO L134 CoverageAnalysis]: Checked inductivity of 1164 backedges. 7 proven. 1017 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2019-09-10 01:50:38,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:50:38,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 16, 16] total 38 [2019-09-10 01:50:38,071 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:50:38,072 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-10 01:50:38,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-10 01:50:38,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=310, Invalid=1096, Unknown=0, NotChecked=0, Total=1406 [2019-09-10 01:50:38,073 INFO L87 Difference]: Start difference. First operand 71 states and 77 transitions. Second operand 24 states. [2019-09-10 01:50:39,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:50:39,635 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2019-09-10 01:50:39,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-09-10 01:50:39,636 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 70 [2019-09-10 01:50:39,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:50:39,637 INFO L225 Difference]: With dead ends: 98 [2019-09-10 01:50:39,637 INFO L226 Difference]: Without dead ends: 98 [2019-09-10 01:50:39,640 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1813 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1283, Invalid=6199, Unknown=0, NotChecked=0, Total=7482 [2019-09-10 01:50:39,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-09-10 01:50:39,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 88. [2019-09-10 01:50:39,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-09-10 01:50:39,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2019-09-10 01:50:39,649 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 70 [2019-09-10 01:50:39,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:50:39,649 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2019-09-10 01:50:39,649 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-10 01:50:39,649 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2019-09-10 01:50:39,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 01:50:39,651 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:50:39,651 INFO L399 BasicCegarLoop]: trace histogram [56, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:50:39,651 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:50:39,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:50:39,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1048409624, now seen corresponding path program 8 times [2019-09-10 01:50:39,652 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:50:39,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:50:39,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:50:39,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:50:39,653 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:50:39,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:50:39,801 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 493 proven. 36 refuted. 0 times theorem prover too weak. 1473 trivial. 0 not checked. [2019-09-10 01:50:39,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:50:39,802 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:50:39,802 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:50:39,802 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:50:39,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:50:39,803 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:50:39,814 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 01:50:39,814 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 01:50:40,062 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-09-10 01:50:40,062 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:50:40,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-10 01:50:40,068 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:50:40,105 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 499 proven. 36 refuted. 0 times theorem prover too weak. 1467 trivial. 0 not checked. [2019-09-10 01:50:40,106 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:50:40,283 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 499 proven. 36 refuted. 0 times theorem prover too weak. 1467 trivial. 0 not checked. [2019-09-10 01:50:40,287 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:50:40,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2019-09-10 01:50:40,288 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:50:40,288 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 01:50:40,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 01:50:40,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2019-09-10 01:50:40,289 INFO L87 Difference]: Start difference. First operand 88 states and 95 transitions. Second operand 12 states. [2019-09-10 01:50:40,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:50:40,386 INFO L93 Difference]: Finished difference Result 95 states and 102 transitions. [2019-09-10 01:50:40,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 01:50:40,386 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 87 [2019-09-10 01:50:40,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:50:40,388 INFO L225 Difference]: With dead ends: 95 [2019-09-10 01:50:40,388 INFO L226 Difference]: Without dead ends: 95 [2019-09-10 01:50:40,388 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 164 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2019-09-10 01:50:40,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-09-10 01:50:40,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-09-10 01:50:40,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-09-10 01:50:40,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 102 transitions. [2019-09-10 01:50:40,395 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 102 transitions. Word has length 87 [2019-09-10 01:50:40,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:50:40,396 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 102 transitions. [2019-09-10 01:50:40,396 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 01:50:40,396 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 102 transitions. [2019-09-10 01:50:40,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-10 01:50:40,397 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:50:40,397 INFO L399 BasicCegarLoop]: trace histogram [63, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:50:40,398 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:50:40,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:50:40,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1289232840, now seen corresponding path program 9 times [2019-09-10 01:50:40,398 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:50:40,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:50:40,399 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:50:40,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:50:40,399 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:50:40,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:50:40,586 INFO L134 CoverageAnalysis]: Checked inductivity of 2464 backedges. 607 proven. 45 refuted. 0 times theorem prover too weak. 1812 trivial. 0 not checked. [2019-09-10 01:50:40,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:50:40,586 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:50:40,587 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:50:40,587 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:50:40,587 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:50:40,587 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:50:40,598 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 01:50:40,598 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 01:50:40,645 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 01:50:40,645 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:50:40,646 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-10 01:50:40,649 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:50:40,902 INFO L134 CoverageAnalysis]: Checked inductivity of 2464 backedges. 0 proven. 2193 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2019-09-10 01:50:40,903 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:50:41,597 INFO L134 CoverageAnalysis]: Checked inductivity of 2464 backedges. 16 proven. 2177 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2019-09-10 01:50:41,601 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:50:41,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 18, 18] total 44 [2019-09-10 01:50:41,601 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:50:41,602 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-10 01:50:41,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-10 01:50:41,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=403, Invalid=1489, Unknown=0, NotChecked=0, Total=1892 [2019-09-10 01:50:41,603 INFO L87 Difference]: Start difference. First operand 95 states and 102 transitions. Second operand 28 states. [2019-09-10 01:50:44,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:50:44,448 INFO L93 Difference]: Finished difference Result 127 states and 136 transitions. [2019-09-10 01:50:44,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-09-10 01:50:44,448 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 94 [2019-09-10 01:50:44,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:50:44,450 INFO L225 Difference]: With dead ends: 127 [2019-09-10 01:50:44,450 INFO L226 Difference]: Without dead ends: 127 [2019-09-10 01:50:44,454 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3512 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1979, Invalid=11361, Unknown=0, NotChecked=0, Total=13340 [2019-09-10 01:50:44,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-09-10 01:50:44,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 115. [2019-09-10 01:50:44,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-09-10 01:50:44,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 123 transitions. [2019-09-10 01:50:44,472 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 123 transitions. Word has length 94 [2019-09-10 01:50:44,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:50:44,473 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 123 transitions. [2019-09-10 01:50:44,473 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-10 01:50:44,473 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 123 transitions. [2019-09-10 01:50:44,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-10 01:50:44,475 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:50:44,475 INFO L399 BasicCegarLoop]: trace histogram [80, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:50:44,475 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:50:44,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:50:44,475 INFO L82 PathProgramCache]: Analyzing trace with hash -352579535, now seen corresponding path program 10 times [2019-09-10 01:50:44,475 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:50:44,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:50:44,479 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:50:44,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:50:44,479 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:50:44,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:50:44,722 INFO L134 CoverageAnalysis]: Checked inductivity of 3892 backedges. 0 proven. 3452 refuted. 0 times theorem prover too weak. 440 trivial. 0 not checked. [2019-09-10 01:50:44,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:50:44,723 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:50:44,723 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:50:44,723 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:50:44,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:50:44,723 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:50:44,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:50:44,737 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 01:50:44,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:50:44,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-10 01:50:44,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:50:45,036 INFO L134 CoverageAnalysis]: Checked inductivity of 3892 backedges. 0 proven. 3506 refuted. 0 times theorem prover too weak. 386 trivial. 0 not checked. [2019-09-10 01:50:45,036 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:50:46,169 INFO L134 CoverageAnalysis]: Checked inductivity of 3892 backedges. 18 proven. 3488 refuted. 0 times theorem prover too weak. 386 trivial. 0 not checked. [2019-09-10 01:50:46,178 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:50:46,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 20, 20] total 39 [2019-09-10 01:50:46,178 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:50:46,178 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 01:50:46,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 01:50:46,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=453, Invalid=1029, Unknown=0, NotChecked=0, Total=1482 [2019-09-10 01:50:46,180 INFO L87 Difference]: Start difference. First operand 115 states and 123 transitions. Second operand 21 states. [2019-09-10 01:50:46,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:50:46,720 INFO L93 Difference]: Finished difference Result 140 states and 150 transitions. [2019-09-10 01:50:46,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 01:50:46,721 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 114 [2019-09-10 01:50:46,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:50:46,723 INFO L225 Difference]: With dead ends: 140 [2019-09-10 01:50:46,723 INFO L226 Difference]: Without dead ends: 140 [2019-09-10 01:50:46,724 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 200 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=453, Invalid=1029, Unknown=0, NotChecked=0, Total=1482 [2019-09-10 01:50:46,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-09-10 01:50:46,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 128. [2019-09-10 01:50:46,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-09-10 01:50:46,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 137 transitions. [2019-09-10 01:50:46,729 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 137 transitions. Word has length 114 [2019-09-10 01:50:46,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:50:46,730 INFO L475 AbstractCegarLoop]: Abstraction has 128 states and 137 transitions. [2019-09-10 01:50:46,730 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 01:50:46,730 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 137 transitions. [2019-09-10 01:50:46,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-10 01:50:46,732 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:50:46,732 INFO L399 BasicCegarLoop]: trace histogram [90, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:50:46,733 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:50:46,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:50:46,733 INFO L82 PathProgramCache]: Analyzing trace with hash -535987528, now seen corresponding path program 11 times [2019-09-10 01:50:46,733 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:50:46,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:50:46,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:50:46,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:50:46,734 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:50:46,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:50:46,995 INFO L134 CoverageAnalysis]: Checked inductivity of 4932 backedges. 0 proven. 4437 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2019-09-10 01:50:46,995 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:50:46,995 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:50:46,995 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:50:46,995 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:50:46,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:50:46,996 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:50:47,010 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 01:50:47,010 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 01:50:47,340 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-09-10 01:50:47,340 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:50:47,342 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-10 01:50:47,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:50:47,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:50:47,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:50:47,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:50:47,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:50:47,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:51:02,181 WARN L188 SmtUtils]: Spent 2.21 s on a formula simplification. DAG size of input: 43 DAG size of output: 19 [2019-09-10 01:51:04,194 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_main_~x~0_BEFORE_CALL_1 Int)) (let ((.cse0 (mod v_main_~x~0_BEFORE_CALL_1 4294967296)) (.cse1 (mod v_main_~x~0_BEFORE_CALL_1 2))) (and (<= 268435455 .cse0) (< (mod (+ v_main_~x~0_BEFORE_CALL_1 4294967295) 4294967296) 268435455) (<= 0 .cse0) (<= .cse1 2147483647) (= .cse1 c___VERIFIER_assert_~cond)))) is different from true [2019-09-10 01:51:04,229 INFO L134 CoverageAnalysis]: Checked inductivity of 4932 backedges. 985 proven. 0 refuted. 0 times theorem prover too weak. 3947 trivial. 0 not checked. [2019-09-10 01:51:04,230 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:51:06,585 INFO L134 CoverageAnalysis]: Checked inductivity of 4932 backedges. 985 proven. 0 refuted. 0 times theorem prover too weak. 3947 trivial. 0 not checked. [2019-09-10 01:51:06,598 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-10 01:51:06,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [12] total 22 [2019-09-10 01:51:06,599 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:51:06,599 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 01:51:06,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 01:51:06,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=319, Unknown=5, NotChecked=38, Total=462 [2019-09-10 01:51:06,602 INFO L87 Difference]: Start difference. First operand 128 states and 137 transitions. Second operand 7 states. [2019-09-10 01:51:15,260 WARN L188 SmtUtils]: Spent 2.19 s on a formula simplification that was a NOOP. DAG size: 24 [2019-09-10 01:51:15,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:51:15,261 INFO L93 Difference]: Finished difference Result 126 states and 135 transitions. [2019-09-10 01:51:15,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 01:51:15,262 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 127 [2019-09-10 01:51:15,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:51:15,262 INFO L225 Difference]: With dead ends: 126 [2019-09-10 01:51:15,263 INFO L226 Difference]: Without dead ends: 0 [2019-09-10 01:51:15,263 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 245 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 25.6s TimeCoverageRelationStatistics Valid=118, Invalid=385, Unknown=7, NotChecked=42, Total=552 [2019-09-10 01:51:15,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-10 01:51:15,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-10 01:51:15,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-10 01:51:15,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-10 01:51:15,264 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 127 [2019-09-10 01:51:15,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:51:15,265 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-10 01:51:15,265 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 01:51:15,265 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-10 01:51:15,265 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-10 01:51:15,269 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 01:51:15 BoogieIcfgContainer [2019-09-10 01:51:15,270 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-10 01:51:15,271 INFO L168 Benchmark]: Toolchain (without parser) took 45232.39 ms. Allocated memory was 133.2 MB in the beginning and 399.5 MB in the end (delta: 266.3 MB). Free memory was 87.8 MB in the beginning and 295.4 MB in the end (delta: -207.6 MB). Peak memory consumption was 58.8 MB. Max. memory is 7.1 GB. [2019-09-10 01:51:15,272 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 133.2 MB. Free memory was 106.4 MB in the beginning and 106.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 01:51:15,273 INFO L168 Benchmark]: CACSL2BoogieTranslator took 217.51 ms. Allocated memory is still 133.2 MB. Free memory was 87.6 MB in the beginning and 78.4 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. [2019-09-10 01:51:15,274 INFO L168 Benchmark]: Boogie Preprocessor took 112.83 ms. Allocated memory was 133.2 MB in the beginning and 200.8 MB in the end (delta: 67.6 MB). Free memory was 78.4 MB in the beginning and 177.8 MB in the end (delta: -99.4 MB). Peak memory consumption was 16.0 MB. Max. memory is 7.1 GB. [2019-09-10 01:51:15,275 INFO L168 Benchmark]: RCFGBuilder took 224.64 ms. Allocated memory is still 200.8 MB. Free memory was 177.8 MB in the beginning and 165.9 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 7.1 GB. [2019-09-10 01:51:15,277 INFO L168 Benchmark]: TraceAbstraction took 44673.17 ms. Allocated memory was 200.8 MB in the beginning and 399.5 MB in the end (delta: 198.7 MB). Free memory was 165.9 MB in the beginning and 295.4 MB in the end (delta: -129.5 MB). Peak memory consumption was 69.2 MB. Max. memory is 7.1 GB. [2019-09-10 01:51:15,286 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 133.2 MB. Free memory was 106.4 MB in the beginning and 106.1 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 217.51 ms. Allocated memory is still 133.2 MB. Free memory was 87.6 MB in the beginning and 78.4 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 112.83 ms. Allocated memory was 133.2 MB in the beginning and 200.8 MB in the end (delta: 67.6 MB). Free memory was 78.4 MB in the beginning and 177.8 MB in the end (delta: -99.4 MB). Peak memory consumption was 16.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 224.64 ms. Allocated memory is still 200.8 MB. Free memory was 177.8 MB in the beginning and 165.9 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 44673.17 ms. Allocated memory was 200.8 MB in the beginning and 399.5 MB in the end (delta: 198.7 MB). Free memory was 165.9 MB in the beginning and 295.4 MB in the end (delta: -129.5 MB). Peak memory consumption was 69.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: 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, 19 locations, 1 error locations. SAFE Result, 44.6s OverallTime, 13 OverallIterations, 90 TraceHistogramMax, 16.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 199 SDtfs, 65 SDslu, 1183 SDs, 0 SdLazy, 5184 SolverSat, 349 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 5.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1691 GetRequests, 1230 SyntacticMatches, 6 SemanticMatches, 455 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 7503 ImplicationChecksByTransitivity, 33.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=128occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.5s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 67 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 25.5s InterpolantComputationTime, 1417 NumberOfCodeBlocks, 1247 NumberOfCodeBlocksAsserted, 60 NumberOfCheckSat, 2079 ConstructedInterpolants, 2 QuantifiedInterpolants, 712330 SizeOfPredicates, 17 NumberOfNonLiveVariables, 1389 ConjunctsInSsa, 230 ConjunctsInUnsatCore, 35 InterpolantComputations, 4 PerfectInterpolantSequences, 24388/47509 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...