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-invgen/nested6.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-efa34d5 [2019-09-16 17:03:26,908 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-16 17:03:26,910 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-16 17:03:26,927 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-16 17:03:26,927 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-16 17:03:26,929 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-16 17:03:26,931 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-16 17:03:26,940 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-16 17:03:26,944 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-16 17:03:26,948 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-16 17:03:26,950 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-16 17:03:26,951 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-16 17:03:26,952 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-16 17:03:26,953 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-16 17:03:26,955 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-16 17:03:26,956 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-16 17:03:26,957 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-16 17:03:26,959 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-16 17:03:26,960 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-16 17:03:26,965 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-16 17:03:26,968 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-16 17:03:26,970 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-16 17:03:26,972 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-16 17:03:26,973 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-16 17:03:26,975 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-16 17:03:26,976 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-16 17:03:26,976 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-16 17:03:26,977 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-16 17:03:26,978 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-16 17:03:26,979 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-16 17:03:26,979 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-16 17:03:26,981 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-16 17:03:26,982 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-16 17:03:26,982 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-16 17:03:26,984 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-16 17:03:26,984 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-16 17:03:26,985 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-16 17:03:26,985 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-16 17:03:26,985 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-16 17:03:26,986 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-16 17:03:26,987 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-16 17:03:26,988 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-16 17:03:27,019 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-16 17:03:27,020 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-16 17:03:27,020 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-16 17:03:27,021 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-16 17:03:27,021 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-16 17:03:27,021 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-16 17:03:27,022 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-16 17:03:27,022 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-16 17:03:27,022 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-16 17:03:27,022 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-16 17:03:27,024 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-16 17:03:27,024 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-16 17:03:27,024 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-16 17:03:27,025 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-16 17:03:27,025 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-16 17:03:27,025 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-16 17:03:27,025 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-16 17:03:27,025 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-16 17:03:27,025 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-16 17:03:27,026 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-16 17:03:27,026 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-16 17:03:27,026 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-16 17:03:27,026 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-16 17:03:27,026 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-16 17:03:27,027 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-16 17:03:27,027 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-16 17:03:27,027 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-16 17:03:27,027 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-16 17:03:27,027 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-16 17:03:27,028 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-16 17:03:27,061 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-16 17:03:27,077 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-16 17:03:27,082 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-16 17:03:27,083 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-16 17:03:27,084 INFO L275 PluginConnector]: CDTParser initialized [2019-09-16 17:03:27,085 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/nested6.i [2019-09-16 17:03:27,141 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5cbd9b7a/082fa50907a64dcc9a2df4e0af11172e/FLAGb0e706b8c [2019-09-16 17:03:27,519 INFO L306 CDTParser]: Found 1 translation units. [2019-09-16 17:03:27,520 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/nested6.i [2019-09-16 17:03:27,526 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5cbd9b7a/082fa50907a64dcc9a2df4e0af11172e/FLAGb0e706b8c [2019-09-16 17:03:27,954 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5cbd9b7a/082fa50907a64dcc9a2df4e0af11172e [2019-09-16 17:03:27,962 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-16 17:03:27,963 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-16 17:03:27,964 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-16 17:03:27,965 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-16 17:03:27,968 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-16 17:03:27,969 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 05:03:27" (1/1) ... [2019-09-16 17:03:27,972 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8962239 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:03:27, skipping insertion in model container [2019-09-16 17:03:27,972 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 05:03:27" (1/1) ... [2019-09-16 17:03:27,979 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-16 17:03:27,997 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-16 17:03:28,197 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 17:03:28,201 INFO L188 MainTranslator]: Completed pre-run [2019-09-16 17:03:28,219 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 17:03:28,234 INFO L192 MainTranslator]: Completed translation [2019-09-16 17:03:28,234 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:03:28 WrapperNode [2019-09-16 17:03:28,235 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-16 17:03:28,235 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-16 17:03:28,235 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-16 17:03:28,236 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-16 17:03:28,335 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:03:28" (1/1) ... [2019-09-16 17:03:28,335 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:03:28" (1/1) ... [2019-09-16 17:03:28,341 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:03:28" (1/1) ... [2019-09-16 17:03:28,342 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:03:28" (1/1) ... [2019-09-16 17:03:28,347 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:03:28" (1/1) ... [2019-09-16 17:03:28,356 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:03:28" (1/1) ... [2019-09-16 17:03:28,362 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:03:28" (1/1) ... [2019-09-16 17:03:28,365 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-16 17:03:28,365 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-16 17:03:28,365 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-16 17:03:28,366 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-16 17:03:28,367 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:03:28" (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-16 17:03:28,434 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-16 17:03:28,434 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-16 17:03:28,435 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-16 17:03:28,435 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-16 17:03:28,435 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-16 17:03:28,435 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-16 17:03:28,435 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-16 17:03:28,435 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-16 17:03:28,435 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-16 17:03:28,436 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-16 17:03:28,436 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-16 17:03:28,682 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-16 17:03:28,682 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-09-16 17:03:28,683 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 05:03:28 BoogieIcfgContainer [2019-09-16 17:03:28,684 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-16 17:03:28,685 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-16 17:03:28,685 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-16 17:03:28,687 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-16 17:03:28,688 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.09 05:03:27" (1/3) ... [2019-09-16 17:03:28,688 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16571e78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 05:03:28, skipping insertion in model container [2019-09-16 17:03:28,688 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:03:28" (2/3) ... [2019-09-16 17:03:28,689 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16571e78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 05:03:28, skipping insertion in model container [2019-09-16 17:03:28,689 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 05:03:28" (3/3) ... [2019-09-16 17:03:28,694 INFO L109 eAbstractionObserver]: Analyzing ICFG nested6.i [2019-09-16 17:03:28,704 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-16 17:03:28,714 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-16 17:03:28,730 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-16 17:03:28,754 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-16 17:03:28,754 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-16 17:03:28,754 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-16 17:03:28,755 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-16 17:03:28,755 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-16 17:03:28,755 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-16 17:03:28,755 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-16 17:03:28,755 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-16 17:03:28,768 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2019-09-16 17:03:28,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-16 17:03:28,777 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:03:28,778 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:03:28,780 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:03:28,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:03:28,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1213508388, now seen corresponding path program 1 times [2019-09-16 17:03:28,787 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:03:28,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:28,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:03:28,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:28,841 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:03:28,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:03:28,985 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-16 17:03:28,989 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:03:28,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 17:03:29,000 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:03:29,013 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 17:03:29,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 17:03:29,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:03:29,037 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 5 states. [2019-09-16 17:03:29,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:03:29,170 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2019-09-16 17:03:29,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-16 17:03:29,172 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-09-16 17:03:29,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:03:29,180 INFO L225 Difference]: With dead ends: 36 [2019-09-16 17:03:29,180 INFO L226 Difference]: Without dead ends: 28 [2019-09-16 17:03:29,182 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-16 17:03:29,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-09-16 17:03:29,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-09-16 17:03:29,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-09-16 17:03:29,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2019-09-16 17:03:29,220 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 15 [2019-09-16 17:03:29,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:03:29,220 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2019-09-16 17:03:29,220 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 17:03:29,220 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2019-09-16 17:03:29,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-16 17:03:29,221 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:03:29,221 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:03:29,222 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:03:29,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:03:29,223 INFO L82 PathProgramCache]: Analyzing trace with hash 542305890, now seen corresponding path program 1 times [2019-09-16 17:03:29,223 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:03:29,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:29,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:03:29,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:29,225 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:03:29,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:03:29,319 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-16 17:03:29,321 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:03:29,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-16 17:03:29,322 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:03:29,324 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-16 17:03:29,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-16 17:03:29,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-16 17:03:29,325 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 6 states. [2019-09-16 17:03:29,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:03:29,503 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2019-09-16 17:03:29,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-16 17:03:29,504 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-09-16 17:03:29,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:03:29,505 INFO L225 Difference]: With dead ends: 38 [2019-09-16 17:03:29,505 INFO L226 Difference]: Without dead ends: 38 [2019-09-16 17:03:29,506 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-16 17:03:29,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-09-16 17:03:29,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2019-09-16 17:03:29,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-09-16 17:03:29,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2019-09-16 17:03:29,513 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 16 [2019-09-16 17:03:29,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:03:29,514 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2019-09-16 17:03:29,514 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-16 17:03:29,514 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2019-09-16 17:03:29,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-16 17:03:29,515 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:03:29,515 INFO L407 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:03:29,516 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:03:29,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:03:29,516 INFO L82 PathProgramCache]: Analyzing trace with hash 1063580357, now seen corresponding path program 1 times [2019-09-16 17:03:29,516 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:03:29,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:29,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:03:29,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:29,518 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:03:29,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:03:29,576 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:03:29,576 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:03:29,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 17:03:29,576 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:03:29,577 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 17:03:29,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 17:03:29,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:03:29,578 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand 5 states. [2019-09-16 17:03:29,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:03:29,645 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2019-09-16 17:03:29,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-16 17:03:29,646 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-09-16 17:03:29,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:03:29,647 INFO L225 Difference]: With dead ends: 43 [2019-09-16 17:03:29,647 INFO L226 Difference]: Without dead ends: 43 [2019-09-16 17:03:29,648 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-16 17:03:29,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-09-16 17:03:29,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-09-16 17:03:29,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-09-16 17:03:29,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2019-09-16 17:03:29,656 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 20 [2019-09-16 17:03:29,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:03:29,656 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2019-09-16 17:03:29,656 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 17:03:29,657 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2019-09-16 17:03:29,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-16 17:03:29,658 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:03:29,658 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:03:29,658 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:03:29,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:03:29,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1462671860, now seen corresponding path program 1 times [2019-09-16 17:03:29,659 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:03:29,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:29,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:03:29,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:29,661 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:03:29,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:03:29,746 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:03:29,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:03:29,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-16 17:03:29,747 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:03:29,747 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-16 17:03:29,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-16 17:03:29,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-16 17:03:29,748 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand 7 states. [2019-09-16 17:03:29,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:03:29,886 INFO L93 Difference]: Finished difference Result 66 states and 82 transitions. [2019-09-16 17:03:29,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-16 17:03:29,886 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2019-09-16 17:03:29,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:03:29,889 INFO L225 Difference]: With dead ends: 66 [2019-09-16 17:03:29,889 INFO L226 Difference]: Without dead ends: 66 [2019-09-16 17:03:29,890 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-16 17:03:29,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-09-16 17:03:29,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 46. [2019-09-16 17:03:29,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-09-16 17:03:29,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2019-09-16 17:03:29,899 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 24 [2019-09-16 17:03:29,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:03:29,900 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2019-09-16 17:03:29,900 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-16 17:03:29,900 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2019-09-16 17:03:29,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-16 17:03:29,901 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:03:29,901 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:03:29,902 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:03:29,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:03:29,902 INFO L82 PathProgramCache]: Analyzing trace with hash -965699220, now seen corresponding path program 1 times [2019-09-16 17:03:29,902 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:03:29,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:29,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:03:29,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:29,905 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:03:29,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:03:30,043 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:03:30,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:03:30,043 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-16 17:03:30,044 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 28 with the following transitions: [2019-09-16 17:03:30,046 INFO L207 CegarAbsIntRunner]: [0], [4], [8], [11], [15], [23], [29], [31], [34], [40], [50], [54], [58], [64], [67], [69], [72], [74], [75], [76], [77], [81], [82], [83] [2019-09-16 17:03:30,093 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-16 17:03:30,094 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-16 17:03:30,256 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-16 17:03:30,258 INFO L272 AbstractInterpreter]: Visited 22 different actions 27 times. Never merged. Never widened. Performed 28 root evaluator evaluations with a maximum evaluation depth of 5. Performed 28 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Never found a fixpoint. Largest state had 9 variables. [2019-09-16 17:03:30,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:03:30,265 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-16 17:03:30,265 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:03:30,267 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-16 17:03:30,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:03:30,303 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-16 17:03:30,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:03:30,327 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-16 17:03:30,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 17:03:30,432 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-16 17:03:30,433 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-16 17:03:30,489 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-16 17:03:30,493 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-16 17:03:30,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [9] total 13 [2019-09-16 17:03:30,494 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:03:30,494 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 17:03:30,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 17:03:30,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-16 17:03:30,495 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand 5 states. [2019-09-16 17:03:30,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:03:30,656 INFO L93 Difference]: Finished difference Result 77 states and 103 transitions. [2019-09-16 17:03:30,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-16 17:03:30,657 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-09-16 17:03:30,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:03:30,658 INFO L225 Difference]: With dead ends: 77 [2019-09-16 17:03:30,658 INFO L226 Difference]: Without dead ends: 77 [2019-09-16 17:03:30,659 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2019-09-16 17:03:30,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-09-16 17:03:30,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 50. [2019-09-16 17:03:30,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-09-16 17:03:30,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 59 transitions. [2019-09-16 17:03:30,668 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 59 transitions. Word has length 27 [2019-09-16 17:03:30,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:03:30,668 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 59 transitions. [2019-09-16 17:03:30,668 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 17:03:30,668 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 59 transitions. [2019-09-16 17:03:30,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-16 17:03:30,669 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:03:30,670 INFO L407 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:03:30,670 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:03:30,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:03:30,670 INFO L82 PathProgramCache]: Analyzing trace with hash -1830678608, now seen corresponding path program 1 times [2019-09-16 17:03:30,671 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:03:30,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:30,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:03:30,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:30,672 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:03:30,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:03:30,763 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-16 17:03:30,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:03:30,764 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-16 17:03:30,764 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 32 with the following transitions: [2019-09-16 17:03:30,764 INFO L207 CegarAbsIntRunner]: [0], [4], [8], [11], [15], [23], [31], [34], [40], [42], [45], [50], [54], [64], [67], [69], [72], [74], [75], [76], [77], [79], [80], [81], [82], [83] [2019-09-16 17:03:30,766 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-16 17:03:30,767 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-16 17:03:30,888 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-16 17:03:30,890 INFO L272 AbstractInterpreter]: Visited 26 different actions 140 times. Merged at 9 different actions 33 times. Widened at 2 different actions 3 times. Performed 201 root evaluator evaluations with a maximum evaluation depth of 5. Performed 201 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 6 fixpoints after 3 different actions. Largest state had 9 variables. [2019-09-16 17:03:30,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:03:30,891 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-16 17:03:30,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:03:30,891 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-16 17:03:30,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:03:30,911 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-16 17:03:30,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:03:30,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-16 17:03:30,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 17:03:30,952 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-16 17:03:30,953 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-16 17:03:30,988 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-16 17:03:30,991 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-16 17:03:30,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 9 [2019-09-16 17:03:30,992 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-16 17:03:30,993 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-16 17:03:30,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-16 17:03:30,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-16 17:03:30,994 INFO L87 Difference]: Start difference. First operand 50 states and 59 transitions. Second operand 9 states. [2019-09-16 17:03:31,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:03:31,125 INFO L93 Difference]: Finished difference Result 59 states and 70 transitions. [2019-09-16 17:03:31,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-16 17:03:31,125 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2019-09-16 17:03:31,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:03:31,126 INFO L225 Difference]: With dead ends: 59 [2019-09-16 17:03:31,127 INFO L226 Difference]: Without dead ends: 59 [2019-09-16 17:03:31,127 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 59 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2019-09-16 17:03:31,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-09-16 17:03:31,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 53. [2019-09-16 17:03:31,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-09-16 17:03:31,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2019-09-16 17:03:31,137 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 31 [2019-09-16 17:03:31,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:03:31,137 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2019-09-16 17:03:31,138 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-16 17:03:31,138 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2019-09-16 17:03:31,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-16 17:03:31,139 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:03:31,139 INFO L407 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:03:31,139 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:03:31,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:03:31,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1063418416, now seen corresponding path program 1 times [2019-09-16 17:03:31,140 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:03:31,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:31,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:03:31,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:31,142 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:03:31,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:03:31,261 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-16 17:03:31,261 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:03:31,261 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-16 17:03:31,261 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 35 with the following transitions: [2019-09-16 17:03:31,262 INFO L207 CegarAbsIntRunner]: [0], [4], [8], [11], [15], [23], [29], [31], [34], [40], [42], [45], [50], [54], [58], [64], [67], [69], [72], [74], [75], [76], [77], [79], [80], [81], [82], [83] [2019-09-16 17:03:31,264 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-16 17:03:31,265 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-16 17:03:31,480 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-16 17:03:31,482 INFO L272 AbstractInterpreter]: Visited 28 different actions 269 times. Merged at 12 different actions 77 times. Widened at 4 different actions 11 times. Performed 418 root evaluator evaluations with a maximum evaluation depth of 5. Performed 418 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 17 fixpoints after 5 different actions. Largest state had 10 variables. [2019-09-16 17:03:31,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:03:31,482 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-16 17:03:31,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:03:31,482 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-16 17:03:31,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:03:31,513 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-16 17:03:31,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:03:31,537 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-16 17:03:31,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 17:03:31,651 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-16 17:03:31,651 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-16 17:03:31,707 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-16 17:03:31,711 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-16 17:03:31,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 16 [2019-09-16 17:03:31,711 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-16 17:03:31,712 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-16 17:03:31,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-16 17:03:31,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2019-09-16 17:03:31,713 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand 14 states. [2019-09-16 17:03:32,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:03:32,186 INFO L93 Difference]: Finished difference Result 90 states and 119 transitions. [2019-09-16 17:03:32,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-16 17:03:32,187 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 34 [2019-09-16 17:03:32,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:03:32,188 INFO L225 Difference]: With dead ends: 90 [2019-09-16 17:03:32,188 INFO L226 Difference]: Without dead ends: 86 [2019-09-16 17:03:32,189 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 59 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=122, Invalid=478, Unknown=0, NotChecked=0, Total=600 [2019-09-16 17:03:32,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-09-16 17:03:32,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 56. [2019-09-16 17:03:32,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-09-16 17:03:32,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 67 transitions. [2019-09-16 17:03:32,198 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 67 transitions. Word has length 34 [2019-09-16 17:03:32,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:03:32,199 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 67 transitions. [2019-09-16 17:03:32,199 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-16 17:03:32,199 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2019-09-16 17:03:32,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-16 17:03:32,200 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:03:32,201 INFO L407 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:03:32,201 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:03:32,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:03:32,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1968312716, now seen corresponding path program 2 times [2019-09-16 17:03:32,201 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:03:32,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:32,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:03:32,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:32,203 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:03:32,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:03:32,314 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-16 17:03:32,314 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:03:32,314 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-16 17:03:32,314 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-16 17:03:32,314 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-16 17:03:32,314 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:03:32,315 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 17:03:32,330 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-16 17:03:32,331 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-16 17:03:32,349 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-16 17:03:32,349 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-16 17:03:32,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-16 17:03:32,353 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 17:03:32,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 17:03:32,403 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-16 17:03:32,404 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-16 17:03:32,457 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-16 17:03:32,460 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-16 17:03:32,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 13 [2019-09-16 17:03:32,461 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-16 17:03:32,461 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-16 17:03:32,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-16 17:03:32,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-09-16 17:03:32,462 INFO L87 Difference]: Start difference. First operand 56 states and 67 transitions. Second operand 13 states. [2019-09-16 17:03:32,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:03:32,825 INFO L93 Difference]: Finished difference Result 89 states and 114 transitions. [2019-09-16 17:03:32,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-16 17:03:32,826 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 38 [2019-09-16 17:03:32,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:03:32,827 INFO L225 Difference]: With dead ends: 89 [2019-09-16 17:03:32,827 INFO L226 Difference]: Without dead ends: 89 [2019-09-16 17:03:32,828 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 72 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2019-09-16 17:03:32,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-09-16 17:03:32,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 61. [2019-09-16 17:03:32,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-09-16 17:03:32,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 75 transitions. [2019-09-16 17:03:32,836 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 75 transitions. Word has length 38 [2019-09-16 17:03:32,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:03:32,836 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 75 transitions. [2019-09-16 17:03:32,836 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-16 17:03:32,836 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 75 transitions. [2019-09-16 17:03:32,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-16 17:03:32,838 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:03:32,838 INFO L407 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:03:32,838 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:03:32,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:03:32,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1032911483, now seen corresponding path program 1 times [2019-09-16 17:03:32,838 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:03:32,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:32,840 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-16 17:03:32,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:32,840 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:03:32,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:03:32,919 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-16 17:03:32,919 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:03:32,919 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-16 17:03:32,920 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 41 with the following transitions: [2019-09-16 17:03:32,920 INFO L207 CegarAbsIntRunner]: [0], [4], [8], [11], [15], [23], [29], [31], [34], [40], [50], [54], [58], [64], [67], [69], [72], [74], [75], [76], [77], [81], [82], [83], [84] [2019-09-16 17:03:32,922 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-16 17:03:32,922 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-16 17:03:32,958 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-16 17:03:32,958 INFO L272 AbstractInterpreter]: Visited 25 different actions 122 times. Merged at 10 different actions 35 times. Widened at 1 different actions 3 times. Performed 204 root evaluator evaluations with a maximum evaluation depth of 5. Performed 204 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 9 fixpoints after 4 different actions. Largest state had 9 variables. [2019-09-16 17:03:32,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:03:32,959 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-16 17:03:32,959 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:03:32,959 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 17:03:32,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:03:32,980 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-16 17:03:32,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:03:32,997 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-16 17:03:32,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 17:03:33,028 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-16 17:03:33,029 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-16 17:03:33,058 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-16 17:03:33,061 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-16 17:03:33,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [11] total 13 [2019-09-16 17:03:33,062 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:03:33,062 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:03:33,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:03:33,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2019-09-16 17:03:33,063 INFO L87 Difference]: Start difference. First operand 61 states and 75 transitions. Second operand 4 states. [2019-09-16 17:03:33,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:03:33,099 INFO L93 Difference]: Finished difference Result 61 states and 74 transitions. [2019-09-16 17:03:33,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:03:33,100 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-09-16 17:03:33,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:03:33,100 INFO L225 Difference]: With dead ends: 61 [2019-09-16 17:03:33,100 INFO L226 Difference]: Without dead ends: 61 [2019-09-16 17:03:33,101 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-09-16 17:03:33,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-09-16 17:03:33,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-09-16 17:03:33,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-09-16 17:03:33,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 74 transitions. [2019-09-16 17:03:33,107 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 74 transitions. Word has length 40 [2019-09-16 17:03:33,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:03:33,107 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 74 transitions. [2019-09-16 17:03:33,107 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:03:33,108 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 74 transitions. [2019-09-16 17:03:33,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-16 17:03:33,111 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:03:33,111 INFO L407 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:03:33,111 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:03:33,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:03:33,111 INFO L82 PathProgramCache]: Analyzing trace with hash -1795492628, now seen corresponding path program 2 times [2019-09-16 17:03:33,111 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:03:33,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:33,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:03:33,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:33,113 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:03:33,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:03:33,231 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-16 17:03:33,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:03:33,231 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-16 17:03:33,231 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-16 17:03:33,231 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-16 17:03:33,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:03:33,231 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 17:03:33,261 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-16 17:03:33,261 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-16 17:03:33,282 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-16 17:03:33,282 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-16 17:03:33,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-16 17:03:33,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 17:03:33,373 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:03:33,374 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-16 17:03:33,530 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-16 17:03:33,533 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-16 17:03:33,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 7] total 21 [2019-09-16 17:03:33,533 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-16 17:03:33,534 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-16 17:03:33,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-16 17:03:33,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2019-09-16 17:03:33,535 INFO L87 Difference]: Start difference. First operand 61 states and 74 transitions. Second operand 17 states. [2019-09-16 17:03:35,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:03:35,380 INFO L93 Difference]: Finished difference Result 326 states and 474 transitions. [2019-09-16 17:03:35,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-09-16 17:03:35,390 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 41 [2019-09-16 17:03:35,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:03:35,393 INFO L225 Difference]: With dead ends: 326 [2019-09-16 17:03:35,393 INFO L226 Difference]: Without dead ends: 278 [2019-09-16 17:03:35,395 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1179 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=753, Invalid=3669, Unknown=0, NotChecked=0, Total=4422 [2019-09-16 17:03:35,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-09-16 17:03:35,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 145. [2019-09-16 17:03:35,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-09-16 17:03:35,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 196 transitions. [2019-09-16 17:03:35,420 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 196 transitions. Word has length 41 [2019-09-16 17:03:35,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:03:35,420 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 196 transitions. [2019-09-16 17:03:35,420 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-16 17:03:35,420 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 196 transitions. [2019-09-16 17:03:35,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-16 17:03:35,422 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:03:35,422 INFO L407 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:03:35,422 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:03:35,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:03:35,423 INFO L82 PathProgramCache]: Analyzing trace with hash 366127920, now seen corresponding path program 3 times [2019-09-16 17:03:35,423 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:03:35,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:35,424 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-16 17:03:35,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:35,425 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:03:35,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:03:35,468 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-09-16 17:03:35,468 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:03:35,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-16 17:03:35,468 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:03:35,469 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-16 17:03:35,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-16 17:03:35,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-16 17:03:35,470 INFO L87 Difference]: Start difference. First operand 145 states and 196 transitions. Second operand 6 states. [2019-09-16 17:03:35,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:03:35,512 INFO L93 Difference]: Finished difference Result 143 states and 194 transitions. [2019-09-16 17:03:35,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-16 17:03:35,513 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 45 [2019-09-16 17:03:35,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:03:35,514 INFO L225 Difference]: With dead ends: 143 [2019-09-16 17:03:35,514 INFO L226 Difference]: Without dead ends: 0 [2019-09-16 17:03:35,514 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-16 17:03:35,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-16 17:03:35,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-16 17:03:35,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-16 17:03:35,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-16 17:03:35,515 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 45 [2019-09-16 17:03:35,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:03:35,515 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-16 17:03:35,515 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-16 17:03:35,516 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-16 17:03:35,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-16 17:03:35,520 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.09 05:03:35 BoogieIcfgContainer [2019-09-16 17:03:35,521 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-16 17:03:35,523 INFO L168 Benchmark]: Toolchain (without parser) took 7558.55 ms. Allocated memory was 132.6 MB in the beginning and 320.3 MB in the end (delta: 187.7 MB). Free memory was 88.6 MB in the beginning and 270.4 MB in the end (delta: -181.8 MB). Peak memory consumption was 5.9 MB. Max. memory is 7.1 GB. [2019-09-16 17:03:35,524 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 132.6 MB. Free memory was 106.7 MB in the beginning and 106.5 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-16 17:03:35,525 INFO L168 Benchmark]: CACSL2BoogieTranslator took 270.63 ms. Allocated memory is still 132.6 MB. Free memory was 88.2 MB in the beginning and 78.4 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. [2019-09-16 17:03:35,526 INFO L168 Benchmark]: Boogie Preprocessor took 129.62 ms. Allocated memory was 132.6 MB in the beginning and 199.2 MB in the end (delta: 66.6 MB). Free memory was 78.4 MB in the beginning and 175.7 MB in the end (delta: -97.3 MB). Peak memory consumption was 16.0 MB. Max. memory is 7.1 GB. [2019-09-16 17:03:35,526 INFO L168 Benchmark]: RCFGBuilder took 318.55 ms. Allocated memory is still 199.2 MB. Free memory was 175.7 MB in the beginning and 162.3 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. [2019-09-16 17:03:35,527 INFO L168 Benchmark]: TraceAbstraction took 6835.94 ms. Allocated memory was 199.2 MB in the beginning and 320.3 MB in the end (delta: 121.1 MB). Free memory was 161.7 MB in the beginning and 270.4 MB in the end (delta: -108.8 MB). Peak memory consumption was 12.3 MB. Max. memory is 7.1 GB. [2019-09-16 17:03:35,531 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.19 ms. Allocated memory is still 132.6 MB. Free memory was 106.7 MB in the beginning and 106.5 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 270.63 ms. Allocated memory is still 132.6 MB. Free memory was 88.2 MB in the beginning and 78.4 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 129.62 ms. Allocated memory was 132.6 MB in the beginning and 199.2 MB in the end (delta: 66.6 MB). Free memory was 78.4 MB in the beginning and 175.7 MB in the end (delta: -97.3 MB). Peak memory consumption was 16.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 318.55 ms. Allocated memory is still 199.2 MB. Free memory was 175.7 MB in the beginning and 162.3 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6835.94 ms. Allocated memory was 199.2 MB in the beginning and 320.3 MB in the end (delta: 121.1 MB). Free memory was 161.7 MB in the beginning and 270.4 MB in the end (delta: -108.8 MB). Peak memory consumption was 12.3 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, 29 locations, 1 error locations. SAFE Result, 6.7s OverallTime, 11 OverallIterations, 5 TraceHistogramMax, 3.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 349 SDtfs, 314 SDslu, 1443 SDs, 0 SdLazy, 1663 SolverSat, 396 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 587 GetRequests, 403 SyntacticMatches, 14 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1415 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=145occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.6s AbstIntTime, 4 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 250 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 542 NumberOfCodeBlocks, 528 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 730 ConstructedInterpolants, 2 QuantifiedInterpolants, 57107 SizeOfPredicates, 27 NumberOfNonLiveVariables, 445 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 23 InterpolantComputations, 9 PerfectInterpolantSequences, 337/400 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...