java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/recursive-simple/id2_i5_o5-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 03:06:14,004 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 03:06:14,007 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 03:06:14,023 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 03:06:14,023 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 03:06:14,024 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 03:06:14,025 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 03:06:14,027 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 03:06:14,029 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 03:06:14,029 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 03:06:14,030 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 03:06:14,031 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 03:06:14,032 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 03:06:14,033 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 03:06:14,033 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 03:06:14,035 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 03:06:14,035 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 03:06:14,036 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 03:06:14,038 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 03:06:14,040 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 03:06:14,042 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 03:06:14,043 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 03:06:14,046 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 03:06:14,047 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 03:06:14,049 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 03:06:14,050 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 03:06:14,050 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 03:06:14,052 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 03:06:14,052 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 03:06:14,053 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 03:06:14,053 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 03:06:14,054 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 03:06:14,057 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 03:06:14,057 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 03:06:14,058 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 03:06:14,059 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 03:06:14,059 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 03:06:14,059 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 03:06:14,060 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 03:06:14,063 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 03:06:14,063 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 03:06:14,064 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 03:06:14,089 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 03:06:14,090 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 03:06:14,090 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 03:06:14,090 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 03:06:14,091 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 03:06:14,091 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 03:06:14,091 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 03:06:14,092 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 03:06:14,092 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 03:06:14,092 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 03:06:14,093 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 03:06:14,093 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 03:06:14,093 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 03:06:14,093 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 03:06:14,093 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 03:06:14,094 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 03:06:14,094 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 03:06:14,094 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 03:06:14,094 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 03:06:14,094 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 03:06:14,095 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 03:06:14,095 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 03:06:14,095 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 03:06:14,095 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 03:06:14,096 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 03:06:14,096 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 03:06:14,096 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 03:06:14,096 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 03:06:14,096 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 03:06:14,097 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 03:06:14,131 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 03:06:14,144 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 03:06:14,149 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 03:06:14,150 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 03:06:14,151 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 03:06:14,152 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/id2_i5_o5-2.c [2019-09-10 03:06:14,223 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d38d7ca7/c914408bc8ce4b63bb5fc68871b8b1e2/FLAGeafcf305b [2019-09-10 03:06:14,671 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 03:06:14,671 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/id2_i5_o5-2.c [2019-09-10 03:06:14,677 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d38d7ca7/c914408bc8ce4b63bb5fc68871b8b1e2/FLAGeafcf305b [2019-09-10 03:06:15,058 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d38d7ca7/c914408bc8ce4b63bb5fc68871b8b1e2 [2019-09-10 03:06:15,068 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 03:06:15,069 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 03:06:15,070 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 03:06:15,070 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 03:06:15,074 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 03:06:15,075 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 03:06:15" (1/1) ... [2019-09-10 03:06:15,077 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78fc3b2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:06:15, skipping insertion in model container [2019-09-10 03:06:15,077 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 03:06:15" (1/1) ... [2019-09-10 03:06:15,085 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 03:06:15,097 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 03:06:15,238 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 03:06:15,244 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 03:06:15,266 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 03:06:15,282 INFO L192 MainTranslator]: Completed translation [2019-09-10 03:06:15,283 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:06:15 WrapperNode [2019-09-10 03:06:15,283 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 03:06:15,283 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 03:06:15,284 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 03:06:15,284 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 03:06:15,376 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:06:15" (1/1) ... [2019-09-10 03:06:15,377 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:06:15" (1/1) ... [2019-09-10 03:06:15,386 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:06:15" (1/1) ... [2019-09-10 03:06:15,387 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:06:15" (1/1) ... [2019-09-10 03:06:15,390 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:06:15" (1/1) ... [2019-09-10 03:06:15,392 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:06:15" (1/1) ... [2019-09-10 03:06:15,393 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:06:15" (1/1) ... [2019-09-10 03:06:15,394 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 03:06:15,394 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 03:06:15,395 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 03:06:15,395 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 03:06:15,396 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:06:15" (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 03:06:15,447 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 03:06:15,447 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 03:06:15,448 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2019-09-10 03:06:15,448 INFO L138 BoogieDeclarations]: Found implementation of procedure id2 [2019-09-10 03:06:15,448 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 03:06:15,448 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-10 03:06:15,448 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 03:06:15,448 INFO L130 BoogieDeclarations]: Found specification of procedure id [2019-09-10 03:06:15,448 INFO L130 BoogieDeclarations]: Found specification of procedure id2 [2019-09-10 03:06:15,448 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 03:06:15,449 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 03:06:15,449 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 03:06:15,616 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 03:06:15,617 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 03:06:15,618 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 03:06:15 BoogieIcfgContainer [2019-09-10 03:06:15,618 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 03:06:15,619 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 03:06:15,619 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 03:06:15,622 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 03:06:15,622 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 03:06:15" (1/3) ... [2019-09-10 03:06:15,623 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52968732 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 03:06:15, skipping insertion in model container [2019-09-10 03:06:15,623 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:06:15" (2/3) ... [2019-09-10 03:06:15,624 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52968732 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 03:06:15, skipping insertion in model container [2019-09-10 03:06:15,624 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 03:06:15" (3/3) ... [2019-09-10 03:06:15,625 INFO L109 eAbstractionObserver]: Analyzing ICFG id2_i5_o5-2.c [2019-09-10 03:06:15,635 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 03:06:15,642 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 03:06:15,672 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 03:06:15,728 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 03:06:15,731 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 03:06:15,732 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 03:06:15,732 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 03:06:15,732 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 03:06:15,732 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 03:06:15,732 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 03:06:15,733 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 03:06:15,767 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2019-09-10 03:06:15,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-10 03:06:15,788 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:06:15,789 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:06:15,791 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:06:15,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:06:15,798 INFO L82 PathProgramCache]: Analyzing trace with hash -550894517, now seen corresponding path program 1 times [2019-09-10 03:06:15,800 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:06:15,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:06:15,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:06:15,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:06:15,837 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:06:15,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:06:15,950 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 03:06:15,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:06:15,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:06:15,953 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:06:15,957 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:06:15,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:06:15,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:06:15,970 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 5 states. [2019-09-10 03:06:16,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:06:16,065 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2019-09-10 03:06:16,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:06:16,067 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-09-10 03:06:16,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:06:16,077 INFO L225 Difference]: With dead ends: 28 [2019-09-10 03:06:16,078 INFO L226 Difference]: Without dead ends: 24 [2019-09-10 03:06:16,079 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:06:16,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-09-10 03:06:16,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-09-10 03:06:16,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-09-10 03:06:16,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-09-10 03:06:16,122 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 13 [2019-09-10 03:06:16,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:06:16,122 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-09-10 03:06:16,123 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:06:16,123 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-09-10 03:06:16,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-10 03:06:16,125 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:06:16,125 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:06:16,125 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:06:16,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:06:16,126 INFO L82 PathProgramCache]: Analyzing trace with hash 40504409, now seen corresponding path program 1 times [2019-09-10 03:06:16,126 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:06:16,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:06:16,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:06:16,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:06:16,127 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:06:16,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:06:16,206 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 03:06:16,206 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:06:16,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 03:06:16,207 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:06:16,209 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 03:06:16,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 03:06:16,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:06:16,210 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 7 states. [2019-09-10 03:06:16,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:06:16,313 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2019-09-10 03:06:16,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 03:06:16,315 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-09-10 03:06:16,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:06:16,316 INFO L225 Difference]: With dead ends: 29 [2019-09-10 03:06:16,317 INFO L226 Difference]: Without dead ends: 29 [2019-09-10 03:06:16,318 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-09-10 03:06:16,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-09-10 03:06:16,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2019-09-10 03:06:16,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-10 03:06:16,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2019-09-10 03:06:16,330 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 19 [2019-09-10 03:06:16,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:06:16,331 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2019-09-10 03:06:16,331 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 03:06:16,331 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2019-09-10 03:06:16,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-10 03:06:16,334 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:06:16,334 INFO L399 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, 1] [2019-09-10 03:06:16,334 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:06:16,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:06:16,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1029702107, now seen corresponding path program 1 times [2019-09-10 03:06:16,335 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:06:16,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:06:16,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:06:16,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:06:16,338 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:06:16,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:06:16,457 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 03:06:16,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:06:16,458 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:06:16,459 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 26 with the following transitions: [2019-09-10 03:06:16,462 INFO L207 CegarAbsIntRunner]: [0], [1], [5], [7], [8], [12], [14], [17], [19], [25], [28], [29], [31], [32], [33], [34], [35], [36], [37], [39], [40], [41], [42] [2019-09-10 03:06:16,511 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:06:16,512 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:06:16,717 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 03:06:16,720 INFO L272 AbstractInterpreter]: Visited 23 different actions 90 times. Merged at 10 different actions 24 times. Widened at 2 different actions 4 times. Performed 123 root evaluator evaluations with a maximum evaluation depth of 3. Performed 123 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 4 variables. [2019-09-10 03:06:16,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:06:16,726 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 03:06:16,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:06:16,726 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:06:16,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:06:16,741 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 03:06:16,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:06:16,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-10 03:06:16,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:06:16,811 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 03:06:16,811 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:06:17,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:17,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:17,231 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-10 03:06:17,236 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:06:17,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 12 [2019-09-10 03:06:17,236 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:06:17,237 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 03:06:17,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 03:06:17,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-09-10 03:06:17,240 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 8 states. [2019-09-10 03:06:17,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:06:17,343 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2019-09-10 03:06:17,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 03:06:17,343 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2019-09-10 03:06:17,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:06:17,345 INFO L225 Difference]: With dead ends: 35 [2019-09-10 03:06:17,345 INFO L226 Difference]: Without dead ends: 35 [2019-09-10 03:06:17,346 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 42 SyntacticMatches, 6 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2019-09-10 03:06:17,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-09-10 03:06:17,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 30. [2019-09-10 03:06:17,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-10 03:06:17,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2019-09-10 03:06:17,352 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 25 [2019-09-10 03:06:17,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:06:17,352 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2019-09-10 03:06:17,352 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 03:06:17,353 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2019-09-10 03:06:17,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-10 03:06:17,354 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:06:17,354 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:06:17,354 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:06:17,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:06:17,355 INFO L82 PathProgramCache]: Analyzing trace with hash -559715991, now seen corresponding path program 1 times [2019-09-10 03:06:17,355 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:06:17,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:06:17,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:06:17,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:06:17,356 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:06:17,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:06:17,470 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-10 03:06:17,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:06:17,471 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:06:17,471 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 32 with the following transitions: [2019-09-10 03:06:17,471 INFO L207 CegarAbsIntRunner]: [0], [1], [4], [5], [7], [8], [12], [14], [17], [19], [25], [29], [31], [32], [33], [34], [35], [36], [37], [39], [40], [41], [42] [2019-09-10 03:06:17,473 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:06:17,474 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:06:17,533 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 03:06:17,533 INFO L272 AbstractInterpreter]: Visited 23 different actions 82 times. Merged at 8 different actions 19 times. Widened at 2 different actions 4 times. Performed 110 root evaluator evaluations with a maximum evaluation depth of 3. Performed 110 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 4 variables. [2019-09-10 03:06:17,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:06:17,534 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 03:06:17,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:06:17,534 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 03:06:17,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:06:17,549 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 03:06:17,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:06:17,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-10 03:06:17,572 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:06:17,593 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-10 03:06:17,593 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:06:17,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:18,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:18,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:18,172 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 03:06:18,176 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:06:18,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 11] total 14 [2019-09-10 03:06:18,177 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:06:18,177 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 03:06:18,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 03:06:18,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2019-09-10 03:06:18,178 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 9 states. [2019-09-10 03:06:18,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:06:18,272 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2019-09-10 03:06:18,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 03:06:18,273 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2019-09-10 03:06:18,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:06:18,274 INFO L225 Difference]: With dead ends: 41 [2019-09-10 03:06:18,274 INFO L226 Difference]: Without dead ends: 41 [2019-09-10 03:06:18,275 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 52 SyntacticMatches, 8 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2019-09-10 03:06:18,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-09-10 03:06:18,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 33. [2019-09-10 03:06:18,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-10 03:06:18,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2019-09-10 03:06:18,281 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 31 [2019-09-10 03:06:18,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:06:18,282 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2019-09-10 03:06:18,282 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 03:06:18,282 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2019-09-10 03:06:18,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-09-10 03:06:18,283 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:06:18,283 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:06:18,283 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:06:18,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:06:18,284 INFO L82 PathProgramCache]: Analyzing trace with hash 2003326827, now seen corresponding path program 2 times [2019-09-10 03:06:18,284 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:06:18,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:06:18,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:06:18,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:06:18,285 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:06:18,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:06:18,411 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-10 03:06:18,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:06:18,411 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:06:18,412 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:06:18,412 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:06:18,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:06:18,412 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 03:06:18,425 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 03:06:18,426 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:06:18,442 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-10 03:06:18,442 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 03:06:18,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-10 03:06:18,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:06:18,458 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-10 03:06:18,458 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:06:18,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:19,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:19,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:19,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:19,212 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 03:06:19,216 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:06:19,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 13] total 15 [2019-09-10 03:06:19,217 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:06:19,217 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 03:06:19,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 03:06:19,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2019-09-10 03:06:19,218 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand 10 states. [2019-09-10 03:06:19,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:06:19,318 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2019-09-10 03:06:19,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 03:06:19,319 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 37 [2019-09-10 03:06:19,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:06:19,320 INFO L225 Difference]: With dead ends: 47 [2019-09-10 03:06:19,320 INFO L226 Difference]: Without dead ends: 47 [2019-09-10 03:06:19,321 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 62 SyntacticMatches, 11 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2019-09-10 03:06:19,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-09-10 03:06:19,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 36. [2019-09-10 03:06:19,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-09-10 03:06:19,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2019-09-10 03:06:19,327 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 37 [2019-09-10 03:06:19,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:06:19,327 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2019-09-10 03:06:19,327 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 03:06:19,327 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2019-09-10 03:06:19,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-09-10 03:06:19,328 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:06:19,329 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:06:19,329 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:06:19,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:06:19,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1197899385, now seen corresponding path program 2 times [2019-09-10 03:06:19,329 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:06:19,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:06:19,331 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 03:06:19,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:06:19,331 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:06:19,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:06:19,556 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-10 03:06:19,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:06:19,556 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:06:19,557 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:06:19,557 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:06:19,557 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:06:19,557 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:06:19,570 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 03:06:19,570 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 03:06:19,594 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-10 03:06:19,595 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 03:06:19,595 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-10 03:06:19,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:06:19,632 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-10 03:06:19,633 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:06:19,945 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-10 03:06:19,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:06:19,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 15 [2019-09-10 03:06:19,948 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:06:19,949 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 03:06:19,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 03:06:19,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-09-10 03:06:19,950 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 15 states. [2019-09-10 03:06:20,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:06:20,064 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2019-09-10 03:06:20,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 03:06:20,067 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 43 [2019-09-10 03:06:20,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:06:20,068 INFO L225 Difference]: With dead ends: 55 [2019-09-10 03:06:20,068 INFO L226 Difference]: Without dead ends: 53 [2019-09-10 03:06:20,069 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 83 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-09-10 03:06:20,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-09-10 03:06:20,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 39. [2019-09-10 03:06:20,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-10 03:06:20,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2019-09-10 03:06:20,076 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 43 [2019-09-10 03:06:20,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:06:20,076 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2019-09-10 03:06:20,076 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 03:06:20,076 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2019-09-10 03:06:20,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-10 03:06:20,077 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:06:20,078 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:06:20,078 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:06:20,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:06:20,078 INFO L82 PathProgramCache]: Analyzing trace with hash 706413819, now seen corresponding path program 3 times [2019-09-10 03:06:20,078 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:06:20,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:06:20,079 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 03:06:20,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:06:20,080 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:06:20,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:06:20,328 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-10 03:06:20,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:06:20,328 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:06:20,328 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:06:20,328 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:06:20,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:06:20,328 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 03:06:20,348 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 03:06:20,348 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:06:20,369 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 03:06:20,369 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 03:06:20,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-10 03:06:20,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:06:20,540 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-10 03:06:20,540 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:06:21,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:22,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:22,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:22,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:22,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:22,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:22,637 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 24 proven. 15 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-10 03:06:22,641 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 03:06:22,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [13, 17] total 30 [2019-09-10 03:06:22,641 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:06:22,643 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 03:06:22,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 03:06:22,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=750, Unknown=0, NotChecked=0, Total=870 [2019-09-10 03:06:22,645 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand 12 states. [2019-09-10 03:06:22,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:06:22,823 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2019-09-10 03:06:22,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 03:06:22,828 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 49 [2019-09-10 03:06:22,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:06:22,829 INFO L225 Difference]: With dead ends: 59 [2019-09-10 03:06:22,829 INFO L226 Difference]: Without dead ends: 39 [2019-09-10 03:06:22,830 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 70 SyntacticMatches, 15 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=203, Invalid=1129, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 03:06:22,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-09-10 03:06:22,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-09-10 03:06:22,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-10 03:06:22,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2019-09-10 03:06:22,835 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 49 [2019-09-10 03:06:22,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:06:22,835 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2019-09-10 03:06:22,835 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 03:06:22,836 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2019-09-10 03:06:22,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-10 03:06:22,837 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:06:22,837 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:06:22,837 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:06:22,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:06:22,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1492956279, now seen corresponding path program 3 times [2019-09-10 03:06:22,838 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:06:22,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:06:22,839 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 03:06:22,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:06:22,839 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:06:22,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:06:23,010 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 15 proven. 31 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-10 03:06:23,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:06:23,010 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:06:23,010 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:06:23,011 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:06:23,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:06:23,011 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:06:23,022 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 03:06:23,023 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 03:06:23,042 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 03:06:23,043 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 03:06:23,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-10 03:06:23,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:06:23,213 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-09-10 03:06:23,213 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:06:24,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:25,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:25,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:25,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:25,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:25,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:26,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:06:26,096 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 33 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-10 03:06:26,109 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 03:06:26,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [13, 19] total 33 [2019-09-10 03:06:26,110 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:06:26,110 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 03:06:26,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 03:06:26,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=918, Unknown=0, NotChecked=0, Total=1056 [2019-09-10 03:06:26,112 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 13 states. [2019-09-10 03:06:26,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:06:26,312 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2019-09-10 03:06:26,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 03:06:26,313 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 55 [2019-09-10 03:06:26,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:06:26,314 INFO L225 Difference]: With dead ends: 35 [2019-09-10 03:06:26,314 INFO L226 Difference]: Without dead ends: 0 [2019-09-10 03:06:26,315 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 78 SyntacticMatches, 16 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 411 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=238, Invalid=1402, Unknown=0, NotChecked=0, Total=1640 [2019-09-10 03:06:26,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-10 03:06:26,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-10 03:06:26,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-10 03:06:26,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-10 03:06:26,316 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 55 [2019-09-10 03:06:26,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:06:26,317 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-10 03:06:26,317 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 03:06:26,317 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-10 03:06:26,317 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-10 03:06:26,321 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 03:06:26 BoogieIcfgContainer [2019-09-10 03:06:26,322 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-10 03:06:26,324 INFO L168 Benchmark]: Toolchain (without parser) took 11254.25 ms. Allocated memory was 135.3 MB in the beginning and 349.2 MB in the end (delta: 213.9 MB). Free memory was 91.7 MB in the beginning and 287.0 MB in the end (delta: -195.3 MB). Peak memory consumption was 18.6 MB. Max. memory is 7.1 GB. [2019-09-10 03:06:26,325 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 135.3 MB. Free memory was 109.9 MB in the beginning and 109.6 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-10 03:06:26,326 INFO L168 Benchmark]: CACSL2BoogieTranslator took 212.92 ms. Allocated memory is still 135.3 MB. Free memory was 91.5 MB in the beginning and 82.3 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. [2019-09-10 03:06:26,327 INFO L168 Benchmark]: Boogie Preprocessor took 110.75 ms. Allocated memory was 135.3 MB in the beginning and 200.8 MB in the end (delta: 65.5 MB). Free memory was 82.3 MB in the beginning and 177.9 MB in the end (delta: -95.6 MB). Peak memory consumption was 16.2 MB. Max. memory is 7.1 GB. [2019-09-10 03:06:26,328 INFO L168 Benchmark]: RCFGBuilder took 223.68 ms. Allocated memory is still 200.8 MB. Free memory was 177.9 MB in the beginning and 166.7 MB in the end (delta: 11.2 MB). Peak memory consumption was 11.2 MB. Max. memory is 7.1 GB. [2019-09-10 03:06:26,328 INFO L168 Benchmark]: TraceAbstraction took 10702.73 ms. Allocated memory was 200.8 MB in the beginning and 349.2 MB in the end (delta: 148.4 MB). Free memory was 166.1 MB in the beginning and 287.0 MB in the end (delta: -120.9 MB). Peak memory consumption was 27.5 MB. Max. memory is 7.1 GB. [2019-09-10 03:06:26,332 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.21 ms. Allocated memory is still 135.3 MB. Free memory was 109.9 MB in the beginning and 109.6 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 212.92 ms. Allocated memory is still 135.3 MB. Free memory was 91.5 MB in the beginning and 82.3 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 110.75 ms. Allocated memory was 135.3 MB in the beginning and 200.8 MB in the end (delta: 65.5 MB). Free memory was 82.3 MB in the beginning and 177.9 MB in the end (delta: -95.6 MB). Peak memory consumption was 16.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 223.68 ms. Allocated memory is still 200.8 MB. Free memory was 177.9 MB in the beginning and 166.7 MB in the end (delta: 11.2 MB). Peak memory consumption was 11.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10702.73 ms. Allocated memory was 200.8 MB in the beginning and 349.2 MB in the end (delta: 148.4 MB). Free memory was 166.1 MB in the beginning and 287.0 MB in the end (delta: -120.9 MB). Peak memory consumption was 27.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 21]: 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 5 procedures, 26 locations, 1 error locations. SAFE Result, 10.6s OverallTime, 8 OverallIterations, 4 TraceHistogramMax, 1.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 179 SDtfs, 89 SDslu, 1022 SDs, 0 SdLazy, 469 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 596 GetRequests, 391 SyntacticMatches, 60 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 863 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.3s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 40 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 8.5s InterpolantComputationTime, 512 NumberOfCodeBlocks, 497 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 732 ConstructedInterpolants, 0 QuantifiedInterpolants, 100476 SizeOfPredicates, 33 NumberOfNonLiveVariables, 504 ConjunctsInSsa, 91 ConjunctsInUnsatCore, 20 InterpolantComputations, 4 PerfectInterpolantSequences, 339/540 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...