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/heapsort.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 02:04:35,157 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 02:04:35,159 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 02:04:35,170 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 02:04:35,170 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 02:04:35,171 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 02:04:35,173 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 02:04:35,174 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 02:04:35,176 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 02:04:35,177 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 02:04:35,178 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 02:04:35,179 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 02:04:35,179 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 02:04:35,180 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 02:04:35,181 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 02:04:35,182 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 02:04:35,182 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 02:04:35,183 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 02:04:35,185 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 02:04:35,186 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 02:04:35,188 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 02:04:35,189 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 02:04:35,190 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 02:04:35,190 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 02:04:35,192 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 02:04:35,193 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 02:04:35,193 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 02:04:35,194 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 02:04:35,194 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 02:04:35,195 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 02:04:35,195 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 02:04:35,196 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 02:04:35,197 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 02:04:35,197 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 02:04:35,198 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 02:04:35,198 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 02:04:35,199 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 02:04:35,199 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 02:04:35,200 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 02:04:35,200 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 02:04:35,201 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 02:04:35,202 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 02:04:35,219 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 02:04:35,219 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 02:04:35,220 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 02:04:35,221 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 02:04:35,222 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 02:04:35,222 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 02:04:35,222 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 02:04:35,222 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 02:04:35,222 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 02:04:35,223 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 02:04:35,224 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 02:04:35,225 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 02:04:35,225 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 02:04:35,225 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 02:04:35,225 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 02:04:35,226 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 02:04:35,226 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 02:04:35,226 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 02:04:35,226 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 02:04:35,227 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 02:04:35,227 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 02:04:35,227 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 02:04:35,227 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 02:04:35,227 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 02:04:35,228 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 02:04:35,228 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 02:04:35,228 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 02:04:35,228 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 02:04:35,228 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 02:04:35,229 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 02:04:35,278 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 02:04:35,289 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 02:04:35,292 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 02:04:35,294 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 02:04:35,294 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 02:04:35,295 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/heapsort.i [2019-09-10 02:04:35,355 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27f5889e7/4bc57bf512ed49e698fc823b0d8feeed/FLAG2fa3546c3 [2019-09-10 02:04:35,833 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 02:04:35,834 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/heapsort.i [2019-09-10 02:04:35,842 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27f5889e7/4bc57bf512ed49e698fc823b0d8feeed/FLAG2fa3546c3 [2019-09-10 02:04:36,208 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27f5889e7/4bc57bf512ed49e698fc823b0d8feeed [2019-09-10 02:04:36,217 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 02:04:36,219 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 02:04:36,220 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 02:04:36,220 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 02:04:36,224 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 02:04:36,225 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:04:36" (1/1) ... [2019-09-10 02:04:36,227 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79ded780 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:04:36, skipping insertion in model container [2019-09-10 02:04:36,228 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:04:36" (1/1) ... [2019-09-10 02:04:36,235 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 02:04:36,252 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 02:04:36,456 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:04:36,461 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 02:04:36,481 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:04:36,496 INFO L192 MainTranslator]: Completed translation [2019-09-10 02:04:36,496 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:04:36 WrapperNode [2019-09-10 02:04:36,496 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 02:04:36,497 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 02:04:36,497 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 02:04:36,497 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 02:04:36,595 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:04:36" (1/1) ... [2019-09-10 02:04:36,597 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:04:36" (1/1) ... [2019-09-10 02:04:36,609 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:04:36" (1/1) ... [2019-09-10 02:04:36,609 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:04:36" (1/1) ... [2019-09-10 02:04:36,618 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:04:36" (1/1) ... [2019-09-10 02:04:36,623 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:04:36" (1/1) ... [2019-09-10 02:04:36,625 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:04:36" (1/1) ... [2019-09-10 02:04:36,627 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 02:04:36,628 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 02:04:36,628 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 02:04:36,628 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 02:04:36,633 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:04:36" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 02:04:36,684 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 02:04:36,685 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 02:04:36,685 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-10 02:04:36,685 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 02:04:36,685 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 02:04:36,685 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 02:04:36,685 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-10 02:04:36,685 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-10 02:04:36,686 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 02:04:36,686 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 02:04:36,686 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 02:04:36,976 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 02:04:36,977 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-09-10 02:04:36,978 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:04:36 BoogieIcfgContainer [2019-09-10 02:04:36,984 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 02:04:36,985 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 02:04:36,985 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 02:04:36,989 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 02:04:36,989 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 02:04:36" (1/3) ... [2019-09-10 02:04:36,990 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@229e9af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:04:36, skipping insertion in model container [2019-09-10 02:04:36,990 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:04:36" (2/3) ... [2019-09-10 02:04:36,991 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@229e9af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:04:36, skipping insertion in model container [2019-09-10 02:04:36,991 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:04:36" (3/3) ... [2019-09-10 02:04:36,992 INFO L109 eAbstractionObserver]: Analyzing ICFG heapsort.i [2019-09-10 02:04:37,001 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 02:04:37,007 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 02:04:37,022 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 02:04:37,048 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 02:04:37,048 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 02:04:37,048 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 02:04:37,049 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 02:04:37,049 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 02:04:37,049 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 02:04:37,049 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 02:04:37,049 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 02:04:37,064 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states. [2019-09-10 02:04:37,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-10 02:04:37,073 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:37,073 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:04:37,076 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:37,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:37,082 INFO L82 PathProgramCache]: Analyzing trace with hash 648615897, now seen corresponding path program 1 times [2019-09-10 02:04:37,084 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:37,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:37,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:37,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:37,125 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:37,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:37,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:04:37,279 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:04:37,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 02:04:37,280 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:04:37,285 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 02:04:37,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 02:04:37,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:04:37,305 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 5 states. [2019-09-10 02:04:37,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:37,457 INFO L93 Difference]: Finished difference Result 47 states and 66 transitions. [2019-09-10 02:04:37,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:04:37,461 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-09-10 02:04:37,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:37,478 INFO L225 Difference]: With dead ends: 47 [2019-09-10 02:04:37,479 INFO L226 Difference]: Without dead ends: 42 [2019-09-10 02:04:37,483 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:04:37,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-10 02:04:37,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-09-10 02:04:37,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-09-10 02:04:37,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 60 transitions. [2019-09-10 02:04:37,563 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 60 transitions. Word has length 14 [2019-09-10 02:04:37,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:37,565 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 60 transitions. [2019-09-10 02:04:37,565 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 02:04:37,566 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 60 transitions. [2019-09-10 02:04:37,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-10 02:04:37,568 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:37,569 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:04:37,570 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:37,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:37,573 INFO L82 PathProgramCache]: Analyzing trace with hash 653352666, now seen corresponding path program 1 times [2019-09-10 02:04:37,574 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:37,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:37,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:37,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:37,577 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:37,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:37,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:04:37,684 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:04:37,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 02:04:37,686 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:04:37,687 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 02:04:37,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 02:04:37,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:04:37,688 INFO L87 Difference]: Start difference. First operand 42 states and 60 transitions. Second operand 5 states. [2019-09-10 02:04:37,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:37,792 INFO L93 Difference]: Finished difference Result 47 states and 64 transitions. [2019-09-10 02:04:37,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:04:37,793 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-09-10 02:04:37,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:37,795 INFO L225 Difference]: With dead ends: 47 [2019-09-10 02:04:37,795 INFO L226 Difference]: Without dead ends: 47 [2019-09-10 02:04:37,796 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:04:37,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-09-10 02:04:37,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2019-09-10 02:04:37,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-09-10 02:04:37,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 63 transitions. [2019-09-10 02:04:37,806 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 63 transitions. Word has length 14 [2019-09-10 02:04:37,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:37,806 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 63 transitions. [2019-09-10 02:04:37,807 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 02:04:37,807 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 63 transitions. [2019-09-10 02:04:37,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-10 02:04:37,808 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:37,808 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:04:37,808 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:37,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:37,809 INFO L82 PathProgramCache]: Analyzing trace with hash 674802186, now seen corresponding path program 1 times [2019-09-10 02:04:37,809 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:37,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:37,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:37,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:37,811 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:37,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:37,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:04:37,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:04:37,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:04:37,869 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:04:37,870 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:04:37,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:04:37,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:04:37,871 INFO L87 Difference]: Start difference. First operand 46 states and 63 transitions. Second operand 6 states. [2019-09-10 02:04:38,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:38,125 INFO L93 Difference]: Finished difference Result 77 states and 112 transitions. [2019-09-10 02:04:38,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 02:04:38,125 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-09-10 02:04:38,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:38,127 INFO L225 Difference]: With dead ends: 77 [2019-09-10 02:04:38,128 INFO L226 Difference]: Without dead ends: 77 [2019-09-10 02:04:38,128 INFO L628 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-10 02:04:38,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-09-10 02:04:38,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 72. [2019-09-10 02:04:38,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-09-10 02:04:38,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 105 transitions. [2019-09-10 02:04:38,151 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 105 transitions. Word has length 14 [2019-09-10 02:04:38,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:38,151 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 105 transitions. [2019-09-10 02:04:38,152 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:04:38,152 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 105 transitions. [2019-09-10 02:04:38,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-10 02:04:38,155 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:38,156 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:04:38,157 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:38,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:38,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1685485370, now seen corresponding path program 1 times [2019-09-10 02:04:38,157 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:38,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:38,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:38,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:38,160 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:38,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:38,294 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-10 02:04:38,295 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:04:38,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 02:04:38,295 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:04:38,296 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 02:04:38,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 02:04:38,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:04:38,296 INFO L87 Difference]: Start difference. First operand 72 states and 105 transitions. Second operand 7 states. [2019-09-10 02:04:38,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:38,572 INFO L93 Difference]: Finished difference Result 103 states and 154 transitions. [2019-09-10 02:04:38,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 02:04:38,573 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-09-10 02:04:38,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:38,575 INFO L225 Difference]: With dead ends: 103 [2019-09-10 02:04:38,575 INFO L226 Difference]: Without dead ends: 103 [2019-09-10 02:04:38,576 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 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-10 02:04:38,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-09-10 02:04:38,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 100. [2019-09-10 02:04:38,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-09-10 02:04:38,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 151 transitions. [2019-09-10 02:04:38,590 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 151 transitions. Word has length 19 [2019-09-10 02:04:38,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:38,590 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 151 transitions. [2019-09-10 02:04:38,591 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 02:04:38,591 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 151 transitions. [2019-09-10 02:04:38,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-10 02:04:38,592 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:38,592 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:04:38,593 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:38,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:38,593 INFO L82 PathProgramCache]: Analyzing trace with hash 2066847833, now seen corresponding path program 1 times [2019-09-10 02:04:38,593 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:38,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:38,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:38,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:38,595 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:38,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:38,650 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-10 02:04:38,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:04:38,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 02:04:38,651 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:04:38,651 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 02:04:38,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 02:04:38,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:04:38,652 INFO L87 Difference]: Start difference. First operand 100 states and 151 transitions. Second operand 5 states. [2019-09-10 02:04:38,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:38,716 INFO L93 Difference]: Finished difference Result 104 states and 154 transitions. [2019-09-10 02:04:38,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:04:38,716 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-09-10 02:04:38,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:38,720 INFO L225 Difference]: With dead ends: 104 [2019-09-10 02:04:38,720 INFO L226 Difference]: Without dead ends: 104 [2019-09-10 02:04:38,721 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:04:38,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-09-10 02:04:38,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-09-10 02:04:38,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-09-10 02:04:38,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 154 transitions. [2019-09-10 02:04:38,735 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 154 transitions. Word has length 19 [2019-09-10 02:04:38,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:38,735 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 154 transitions. [2019-09-10 02:04:38,735 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 02:04:38,735 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 154 transitions. [2019-09-10 02:04:38,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-10 02:04:38,737 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:38,737 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:04:38,737 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:38,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:38,738 INFO L82 PathProgramCache]: Analyzing trace with hash 2051845673, now seen corresponding path program 1 times [2019-09-10 02:04:38,738 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:38,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:38,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:38,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:38,740 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:38,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:38,782 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-10 02:04:38,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:04:38,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:04:38,783 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:04:38,783 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:04:38,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:04:38,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:04:38,784 INFO L87 Difference]: Start difference. First operand 104 states and 154 transitions. Second operand 6 states. [2019-09-10 02:04:38,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:38,986 INFO L93 Difference]: Finished difference Result 155 states and 238 transitions. [2019-09-10 02:04:38,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 02:04:38,986 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-09-10 02:04:38,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:38,989 INFO L225 Difference]: With dead ends: 155 [2019-09-10 02:04:38,991 INFO L226 Difference]: Without dead ends: 155 [2019-09-10 02:04:38,992 INFO L628 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-10 02:04:38,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-09-10 02:04:39,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 132. [2019-09-10 02:04:39,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-09-10 02:04:39,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 202 transitions. [2019-09-10 02:04:39,025 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 202 transitions. Word has length 19 [2019-09-10 02:04:39,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:39,026 INFO L475 AbstractCegarLoop]: Abstraction has 132 states and 202 transitions. [2019-09-10 02:04:39,026 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:04:39,026 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 202 transitions. [2019-09-10 02:04:39,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-10 02:04:39,028 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:39,030 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:04:39,030 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:39,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:39,031 INFO L82 PathProgramCache]: Analyzing trace with hash -2069937212, now seen corresponding path program 1 times [2019-09-10 02:04:39,031 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:39,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:39,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:39,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:39,032 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:39,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:39,101 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-10 02:04:39,101 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:04:39,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:04:39,102 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:04:39,105 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:04:39,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:04:39,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:04:39,106 INFO L87 Difference]: Start difference. First operand 132 states and 202 transitions. Second operand 6 states. [2019-09-10 02:04:39,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:39,292 INFO L93 Difference]: Finished difference Result 187 states and 289 transitions. [2019-09-10 02:04:39,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 02:04:39,293 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-09-10 02:04:39,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:39,295 INFO L225 Difference]: With dead ends: 187 [2019-09-10 02:04:39,295 INFO L226 Difference]: Without dead ends: 187 [2019-09-10 02:04:39,296 INFO L628 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-10 02:04:39,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-09-10 02:04:39,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 164. [2019-09-10 02:04:39,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-09-10 02:04:39,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 253 transitions. [2019-09-10 02:04:39,314 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 253 transitions. Word has length 19 [2019-09-10 02:04:39,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:39,314 INFO L475 AbstractCegarLoop]: Abstraction has 164 states and 253 transitions. [2019-09-10 02:04:39,315 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:04:39,315 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 253 transitions. [2019-09-10 02:04:39,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-10 02:04:39,316 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:39,316 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:04:39,317 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:39,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:39,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1098679356, now seen corresponding path program 1 times [2019-09-10 02:04:39,317 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:39,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:39,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:39,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:39,319 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:39,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:39,337 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-10 02:04:39,338 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:04:39,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:04:39,338 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:04:39,339 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:04:39,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:04:39,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:04:39,340 INFO L87 Difference]: Start difference. First operand 164 states and 253 transitions. Second operand 3 states. [2019-09-10 02:04:39,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:39,367 INFO L93 Difference]: Finished difference Result 232 states and 374 transitions. [2019-09-10 02:04:39,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:04:39,368 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-09-10 02:04:39,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:39,371 INFO L225 Difference]: With dead ends: 232 [2019-09-10 02:04:39,371 INFO L226 Difference]: Without dead ends: 232 [2019-09-10 02:04:39,372 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:04:39,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2019-09-10 02:04:39,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 194. [2019-09-10 02:04:39,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-10 02:04:39,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 306 transitions. [2019-09-10 02:04:39,404 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 306 transitions. Word has length 19 [2019-09-10 02:04:39,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:39,405 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 306 transitions. [2019-09-10 02:04:39,405 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:04:39,406 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 306 transitions. [2019-09-10 02:04:39,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-10 02:04:39,409 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:39,409 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:04:39,409 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:39,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:39,410 INFO L82 PathProgramCache]: Analyzing trace with hash -372123308, now seen corresponding path program 1 times [2019-09-10 02:04:39,410 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:39,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:39,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:39,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:39,412 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:39,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:39,492 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 02:04:39,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:04:39,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:04:39,493 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:04:39,493 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:04:39,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:04:39,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:04:39,494 INFO L87 Difference]: Start difference. First operand 194 states and 306 transitions. Second operand 6 states. [2019-09-10 02:04:39,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:39,654 INFO L93 Difference]: Finished difference Result 332 states and 543 transitions. [2019-09-10 02:04:39,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 02:04:39,655 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-09-10 02:04:39,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:39,658 INFO L225 Difference]: With dead ends: 332 [2019-09-10 02:04:39,658 INFO L226 Difference]: Without dead ends: 332 [2019-09-10 02:04:39,658 INFO L628 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-10 02:04:39,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2019-09-10 02:04:39,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 226. [2019-09-10 02:04:39,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-09-10 02:04:39,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 361 transitions. [2019-09-10 02:04:39,675 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 361 transitions. Word has length 26 [2019-09-10 02:04:39,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:39,675 INFO L475 AbstractCegarLoop]: Abstraction has 226 states and 361 transitions. [2019-09-10 02:04:39,675 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:04:39,675 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 361 transitions. [2019-09-10 02:04:39,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-10 02:04:39,676 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:39,677 INFO L399 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] [2019-09-10 02:04:39,677 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:39,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:39,677 INFO L82 PathProgramCache]: Analyzing trace with hash 348902212, now seen corresponding path program 1 times [2019-09-10 02:04:39,677 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:39,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:39,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:39,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:39,679 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:39,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:39,735 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 02:04:39,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:04:39,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 02:04:39,736 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:04:39,736 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 02:04:39,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 02:04:39,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:04:39,737 INFO L87 Difference]: Start difference. First operand 226 states and 361 transitions. Second operand 5 states. [2019-09-10 02:04:39,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:39,992 INFO L93 Difference]: Finished difference Result 356 states and 581 transitions. [2019-09-10 02:04:39,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 02:04:39,993 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-09-10 02:04:39,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:39,996 INFO L225 Difference]: With dead ends: 356 [2019-09-10 02:04:39,996 INFO L226 Difference]: Without dead ends: 356 [2019-09-10 02:04:39,997 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:04:39,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2019-09-10 02:04:40,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 226. [2019-09-10 02:04:40,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-09-10 02:04:40,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 359 transitions. [2019-09-10 02:04:40,014 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 359 transitions. Word has length 28 [2019-09-10 02:04:40,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:40,014 INFO L475 AbstractCegarLoop]: Abstraction has 226 states and 359 transitions. [2019-09-10 02:04:40,014 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 02:04:40,014 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 359 transitions. [2019-09-10 02:04:40,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-10 02:04:40,015 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:40,015 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:04:40,016 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:40,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:40,016 INFO L82 PathProgramCache]: Analyzing trace with hash -2096231521, now seen corresponding path program 1 times [2019-09-10 02:04:40,016 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:40,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:40,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:40,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:40,019 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:40,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:40,100 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-10 02:04:40,100 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:04:40,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 02:04:40,101 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:04:40,101 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 02:04:40,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 02:04:40,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:04:40,102 INFO L87 Difference]: Start difference. First operand 226 states and 359 transitions. Second operand 7 states. [2019-09-10 02:04:40,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:40,333 INFO L93 Difference]: Finished difference Result 360 states and 592 transitions. [2019-09-10 02:04:40,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 02:04:40,334 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2019-09-10 02:04:40,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:40,338 INFO L225 Difference]: With dead ends: 360 [2019-09-10 02:04:40,338 INFO L226 Difference]: Without dead ends: 360 [2019-09-10 02:04:40,339 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-09-10 02:04:40,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2019-09-10 02:04:40,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 306. [2019-09-10 02:04:40,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2019-09-10 02:04:40,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 502 transitions. [2019-09-10 02:04:40,358 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 502 transitions. Word has length 31 [2019-09-10 02:04:40,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:40,358 INFO L475 AbstractCegarLoop]: Abstraction has 306 states and 502 transitions. [2019-09-10 02:04:40,358 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 02:04:40,358 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 502 transitions. [2019-09-10 02:04:40,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-10 02:04:40,360 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:40,360 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 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-10 02:04:40,360 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:40,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:40,360 INFO L82 PathProgramCache]: Analyzing trace with hash 454341926, now seen corresponding path program 1 times [2019-09-10 02:04:40,361 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:40,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:40,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:40,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:40,362 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:40,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:40,413 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-10 02:04:40,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:04:40,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 02:04:40,414 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:04:40,414 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 02:04:40,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 02:04:40,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:04:40,415 INFO L87 Difference]: Start difference. First operand 306 states and 502 transitions. Second operand 7 states. [2019-09-10 02:04:40,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:40,628 INFO L93 Difference]: Finished difference Result 346 states and 557 transitions. [2019-09-10 02:04:40,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 02:04:40,629 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2019-09-10 02:04:40,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:40,633 INFO L225 Difference]: With dead ends: 346 [2019-09-10 02:04:40,633 INFO L226 Difference]: Without dead ends: 346 [2019-09-10 02:04:40,634 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-09-10 02:04:40,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2019-09-10 02:04:40,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 310. [2019-09-10 02:04:40,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2019-09-10 02:04:40,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 505 transitions. [2019-09-10 02:04:40,651 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 505 transitions. Word has length 41 [2019-09-10 02:04:40,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:40,652 INFO L475 AbstractCegarLoop]: Abstraction has 310 states and 505 transitions. [2019-09-10 02:04:40,652 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 02:04:40,652 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 505 transitions. [2019-09-10 02:04:40,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-10 02:04:40,653 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:40,653 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 4, 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, 1] [2019-09-10 02:04:40,653 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:40,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:40,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1384233346, now seen corresponding path program 1 times [2019-09-10 02:04:40,654 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:40,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:40,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:40,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:40,655 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:40,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:40,699 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-10 02:04:40,699 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:04:40,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 02:04:40,700 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:04:40,700 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 02:04:40,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 02:04:40,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:04:40,701 INFO L87 Difference]: Start difference. First operand 310 states and 505 transitions. Second operand 7 states. [2019-09-10 02:04:40,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:40,840 INFO L93 Difference]: Finished difference Result 315 states and 509 transitions. [2019-09-10 02:04:40,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 02:04:40,840 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2019-09-10 02:04:40,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:40,844 INFO L225 Difference]: With dead ends: 315 [2019-09-10 02:04:40,844 INFO L226 Difference]: Without dead ends: 315 [2019-09-10 02:04:40,845 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-09-10 02:04:40,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-09-10 02:04:40,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 185. [2019-09-10 02:04:40,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-09-10 02:04:40,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 278 transitions. [2019-09-10 02:04:40,858 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 278 transitions. Word has length 41 [2019-09-10 02:04:40,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:40,859 INFO L475 AbstractCegarLoop]: Abstraction has 185 states and 278 transitions. [2019-09-10 02:04:40,859 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 02:04:40,859 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 278 transitions. [2019-09-10 02:04:40,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-10 02:04:40,860 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:40,860 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 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-10 02:04:40,861 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:40,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:40,861 INFO L82 PathProgramCache]: Analyzing trace with hash 1052669362, now seen corresponding path program 1 times [2019-09-10 02:04:40,861 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:40,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:40,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:40,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:40,862 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:40,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:40,901 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-10 02:04:40,901 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:04:40,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:04:40,901 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:04:40,902 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:04:40,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:04:40,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:04:40,902 INFO L87 Difference]: Start difference. First operand 185 states and 278 transitions. Second operand 6 states. [2019-09-10 02:04:41,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:41,020 INFO L93 Difference]: Finished difference Result 342 states and 552 transitions. [2019-09-10 02:04:41,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 02:04:41,021 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 48 [2019-09-10 02:04:41,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:41,024 INFO L225 Difference]: With dead ends: 342 [2019-09-10 02:04:41,024 INFO L226 Difference]: Without dead ends: 342 [2019-09-10 02:04:41,025 INFO L628 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-10 02:04:41,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2019-09-10 02:04:41,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 318. [2019-09-10 02:04:41,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2019-09-10 02:04:41,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 511 transitions. [2019-09-10 02:04:41,041 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 511 transitions. Word has length 48 [2019-09-10 02:04:41,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:41,042 INFO L475 AbstractCegarLoop]: Abstraction has 318 states and 511 transitions. [2019-09-10 02:04:41,042 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:04:41,042 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 511 transitions. [2019-09-10 02:04:41,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-10 02:04:41,044 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:41,044 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 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-10 02:04:41,045 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:41,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:41,045 INFO L82 PathProgramCache]: Analyzing trace with hash 867583944, now seen corresponding path program 1 times [2019-09-10 02:04:41,045 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:41,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:41,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:41,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:41,046 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:41,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:41,122 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 16 proven. 7 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-10 02:04:41,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:04:41,123 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:04:41,124 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 62 with the following transitions: [2019-09-10 02:04:41,126 INFO L207 CegarAbsIntRunner]: [0], [4], [8], [11], [22], [31], [47], [51], [56], [61], [82], [85], [87], [90], [92], [93], [94], [95], [105], [106], [107], [108], [109], [110], [111], [112], [113], [114], [115], [116] [2019-09-10 02:04:41,185 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 02:04:41,185 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 02:04:41,290 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 02:04:41,441 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 02:04:41,449 INFO L272 AbstractInterpreter]: Visited 30 different actions 102 times. Merged at 11 different actions 11 times. Never widened. Performed 119 root evaluator evaluations with a maximum evaluation depth of 8. Performed 119 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 1 fixpoints after 1 different actions. Largest state had 14 variables. [2019-09-10 02:04:41,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:41,454 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 02:04:41,454 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:04:41,455 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 02:04:41,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:41,477 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:04:41,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:41,533 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-10 02:04:41,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:04:41,649 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2019-09-10 02:04:41,649 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:04:41,733 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 22 proven. 1 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-10 02:04:41,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 02:04:41,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 12 [2019-09-10 02:04:41,738 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:04:41,739 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:04:41,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:04:41,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-09-10 02:04:41,740 INFO L87 Difference]: Start difference. First operand 318 states and 511 transitions. Second operand 6 states. [2019-09-10 02:04:41,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:41,978 INFO L93 Difference]: Finished difference Result 347 states and 552 transitions. [2019-09-10 02:04:41,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 02:04:41,978 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2019-09-10 02:04:41,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:41,981 INFO L225 Difference]: With dead ends: 347 [2019-09-10 02:04:41,982 INFO L226 Difference]: Without dead ends: 347 [2019-09-10 02:04:41,984 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 116 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2019-09-10 02:04:41,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2019-09-10 02:04:42,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 322. [2019-09-10 02:04:42,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2019-09-10 02:04:42,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 515 transitions. [2019-09-10 02:04:42,015 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 515 transitions. Word has length 61 [2019-09-10 02:04:42,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:42,016 INFO L475 AbstractCegarLoop]: Abstraction has 322 states and 515 transitions. [2019-09-10 02:04:42,016 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:04:42,016 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 515 transitions. [2019-09-10 02:04:42,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-10 02:04:42,018 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:42,018 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 10, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:04:42,018 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:42,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:42,018 INFO L82 PathProgramCache]: Analyzing trace with hash 2141038378, now seen corresponding path program 1 times [2019-09-10 02:04:42,019 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:42,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:42,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:42,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:42,020 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:42,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:42,082 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-10 02:04:42,082 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:04:42,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 02:04:42,082 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:04:42,083 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 02:04:42,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 02:04:42,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:04:42,083 INFO L87 Difference]: Start difference. First operand 322 states and 515 transitions. Second operand 7 states. [2019-09-10 02:04:42,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:42,240 INFO L93 Difference]: Finished difference Result 372 states and 596 transitions. [2019-09-10 02:04:42,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 02:04:42,241 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 75 [2019-09-10 02:04:42,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:42,244 INFO L225 Difference]: With dead ends: 372 [2019-09-10 02:04:42,244 INFO L226 Difference]: Without dead ends: 372 [2019-09-10 02:04:42,245 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-09-10 02:04:42,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2019-09-10 02:04:42,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 326. [2019-09-10 02:04:42,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2019-09-10 02:04:42,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 518 transitions. [2019-09-10 02:04:42,266 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 518 transitions. Word has length 75 [2019-09-10 02:04:42,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:42,267 INFO L475 AbstractCegarLoop]: Abstraction has 326 states and 518 transitions. [2019-09-10 02:04:42,267 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 02:04:42,267 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 518 transitions. [2019-09-10 02:04:42,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 02:04:42,269 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:42,270 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 12, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:04:42,270 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:42,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:42,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1931813206, now seen corresponding path program 1 times [2019-09-10 02:04:42,270 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:42,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:42,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:42,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:42,272 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:42,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:42,386 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 24 proven. 7 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-10 02:04:42,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:04:42,387 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:04:42,387 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 84 with the following transitions: [2019-09-10 02:04:42,387 INFO L207 CegarAbsIntRunner]: [0], [4], [8], [11], [22], [31], [34], [39], [42], [47], [51], [56], [61], [82], [85], [87], [90], [92], [93], [94], [95], [97], [98], [99], [100], [101], [102], [103], [104], [105], [106], [107], [108], [109], [110], [111], [112], [113], [114], [115], [116] [2019-09-10 02:04:42,393 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 02:04:42,393 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 02:04:42,403 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 02:04:42,528 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 02:04:42,528 INFO L272 AbstractInterpreter]: Visited 41 different actions 164 times. Merged at 17 different actions 17 times. Never widened. Performed 190 root evaluator evaluations with a maximum evaluation depth of 8. Performed 190 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 3 fixpoints after 2 different actions. Largest state had 15 variables. [2019-09-10 02:04:42,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:42,528 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 02:04:42,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:04:42,529 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 02:04:42,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:42,555 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:04:42,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:42,585 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-10 02:04:42,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:04:42,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:04:42,816 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 24 proven. 7 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-10 02:04:42,816 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:04:42,920 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 24 proven. 7 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-10 02:04:42,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:04:42,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 16 [2019-09-10 02:04:42,925 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:04:42,926 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 02:04:42,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 02:04:42,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-09-10 02:04:42,927 INFO L87 Difference]: Start difference. First operand 326 states and 518 transitions. Second operand 13 states. [2019-09-10 02:04:44,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:44,649 INFO L93 Difference]: Finished difference Result 640 states and 1048 transitions. [2019-09-10 02:04:44,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 02:04:44,650 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 83 [2019-09-10 02:04:44,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:44,655 INFO L225 Difference]: With dead ends: 640 [2019-09-10 02:04:44,655 INFO L226 Difference]: Without dead ends: 640 [2019-09-10 02:04:44,656 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 157 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=293, Invalid=967, Unknown=0, NotChecked=0, Total=1260 [2019-09-10 02:04:44,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2019-09-10 02:04:44,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 384. [2019-09-10 02:04:44,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2019-09-10 02:04:44,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 616 transitions. [2019-09-10 02:04:44,682 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 616 transitions. Word has length 83 [2019-09-10 02:04:44,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:44,682 INFO L475 AbstractCegarLoop]: Abstraction has 384 states and 616 transitions. [2019-09-10 02:04:44,682 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 02:04:44,682 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 616 transitions. [2019-09-10 02:04:44,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 02:04:44,684 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:44,684 INFO L399 BasicCegarLoop]: trace histogram [14, 13, 13, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:04:44,684 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:44,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:44,685 INFO L82 PathProgramCache]: Analyzing trace with hash 2023812105, now seen corresponding path program 2 times [2019-09-10 02:04:44,685 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:44,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:44,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:44,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:44,686 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:44,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:44,756 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 26 proven. 8 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-10 02:04:44,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:04:44,756 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:04:44,756 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:04:44,756 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:04:44,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:04:44,757 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 02:04:44,776 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:04:44,777 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:04:44,792 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-09-10 02:04:44,793 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:04:44,794 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-10 02:04:44,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:04:44,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:04:44,933 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 27 proven. 7 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-10 02:04:44,933 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:04:45,086 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 26 proven. 8 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-10 02:04:45,096 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:04:45,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2019-09-10 02:04:45,097 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:04:45,097 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 02:04:45,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 02:04:45,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2019-09-10 02:04:45,098 INFO L87 Difference]: Start difference. First operand 384 states and 616 transitions. Second operand 13 states. [2019-09-10 02:04:45,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:45,397 INFO L93 Difference]: Finished difference Result 405 states and 644 transitions. [2019-09-10 02:04:45,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 02:04:45,400 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 88 [2019-09-10 02:04:45,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:45,402 INFO L225 Difference]: With dead ends: 405 [2019-09-10 02:04:45,403 INFO L226 Difference]: Without dead ends: 333 [2019-09-10 02:04:45,403 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2019-09-10 02:04:45,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2019-09-10 02:04:45,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 322. [2019-09-10 02:04:45,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2019-09-10 02:04:45,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 499 transitions. [2019-09-10 02:04:45,424 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 499 transitions. Word has length 88 [2019-09-10 02:04:45,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:45,424 INFO L475 AbstractCegarLoop]: Abstraction has 322 states and 499 transitions. [2019-09-10 02:04:45,425 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 02:04:45,425 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 499 transitions. [2019-09-10 02:04:45,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-10 02:04:45,427 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:45,427 INFO L399 BasicCegarLoop]: trace histogram [21, 20, 20, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1] [2019-09-10 02:04:45,428 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:45,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:45,428 INFO L82 PathProgramCache]: Analyzing trace with hash 1044380688, now seen corresponding path program 1 times [2019-09-10 02:04:45,428 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:45,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:45,429 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:04:45,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:45,430 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:45,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:45,531 INFO L134 CoverageAnalysis]: Checked inductivity of 826 backedges. 53 proven. 13 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2019-09-10 02:04:45,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:04:45,531 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:04:45,531 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 133 with the following transitions: [2019-09-10 02:04:45,532 INFO L207 CegarAbsIntRunner]: [0], [4], [8], [11], [22], [31], [34], [39], [42], [47], [51], [54], [56], [61], [67], [70], [82], [85], [87], [90], [92], [93], [94], [95], [97], [98], [99], [100], [101], [102], [103], [104], [105], [106], [107], [108], [109], [110], [111], [112], [113], [114], [115], [116], [117], [118], [119], [120] [2019-09-10 02:04:45,534 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 02:04:45,534 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 02:04:45,538 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 02:04:45,617 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 02:04:45,617 INFO L272 AbstractInterpreter]: Visited 48 different actions 198 times. Merged at 21 different actions 21 times. Never widened. Performed 230 root evaluator evaluations with a maximum evaluation depth of 8. Performed 230 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 5 fixpoints after 3 different actions. Largest state had 16 variables. [2019-09-10 02:04:45,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:45,618 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 02:04:45,618 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:04:45,618 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 02:04:45,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:45,637 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:04:45,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:45,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-10 02:04:45,687 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:04:45,951 INFO L134 CoverageAnalysis]: Checked inductivity of 826 backedges. 382 proven. 8 refuted. 0 times theorem prover too weak. 436 trivial. 0 not checked. [2019-09-10 02:04:45,951 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:04:48,626 INFO L134 CoverageAnalysis]: Checked inductivity of 826 backedges. 56 proven. 10 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2019-09-10 02:04:48,632 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:04:48,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 23 [2019-09-10 02:04:48,633 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:04:48,634 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 02:04:48,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 02:04:48,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=430, Unknown=1, NotChecked=0, Total=506 [2019-09-10 02:04:48,635 INFO L87 Difference]: Start difference. First operand 322 states and 499 transitions. Second operand 16 states. [2019-09-10 02:04:51,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:51,420 INFO L93 Difference]: Finished difference Result 726 states and 1166 transitions. [2019-09-10 02:04:51,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-10 02:04:51,421 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 132 [2019-09-10 02:04:51,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:51,428 INFO L225 Difference]: With dead ends: 726 [2019-09-10 02:04:51,428 INFO L226 Difference]: Without dead ends: 673 [2019-09-10 02:04:51,429 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 585 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=565, Invalid=2086, Unknown=1, NotChecked=0, Total=2652 [2019-09-10 02:04:51,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2019-09-10 02:04:51,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 542. [2019-09-10 02:04:51,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542 states. [2019-09-10 02:04:51,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 873 transitions. [2019-09-10 02:04:51,477 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 873 transitions. Word has length 132 [2019-09-10 02:04:51,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:51,478 INFO L475 AbstractCegarLoop]: Abstraction has 542 states and 873 transitions. [2019-09-10 02:04:51,478 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 02:04:51,478 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 873 transitions. [2019-09-10 02:04:51,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-10 02:04:51,481 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:51,481 INFO L399 BasicCegarLoop]: trace histogram [21, 20, 20, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:04:51,481 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:51,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:51,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1931603534, now seen corresponding path program 1 times [2019-09-10 02:04:51,482 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:51,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:51,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:51,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:51,483 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:51,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:51,575 INFO L134 CoverageAnalysis]: Checked inductivity of 826 backedges. 53 proven. 13 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2019-09-10 02:04:51,576 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:04:51,576 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:04:51,577 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 133 with the following transitions: [2019-09-10 02:04:51,577 INFO L207 CegarAbsIntRunner]: [0], [4], [8], [11], [22], [31], [34], [39], [42], [44], [47], [51], [54], [56], [61], [67], [70], [82], [85], [87], [90], [92], [93], [94], [95], [97], [98], [99], [100], [101], [102], [103], [104], [105], [106], [107], [108], [109], [110], [111], [112], [113], [114], [115], [116], [117], [118], [119], [120] [2019-09-10 02:04:51,583 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 02:04:51,583 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 02:04:51,587 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 02:04:51,700 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 02:04:51,700 INFO L272 AbstractInterpreter]: Visited 49 different actions 200 times. Merged at 21 different actions 21 times. Never widened. Performed 233 root evaluator evaluations with a maximum evaluation depth of 8. Performed 233 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 7 fixpoints after 4 different actions. Largest state had 16 variables. [2019-09-10 02:04:51,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:51,701 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 02:04:51,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:04:51,701 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 02:04:51,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:51,730 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:04:51,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:51,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-10 02:04:51,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:04:51,913 INFO L134 CoverageAnalysis]: Checked inductivity of 826 backedges. 382 proven. 8 refuted. 0 times theorem prover too weak. 436 trivial. 0 not checked. [2019-09-10 02:04:51,913 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:04:52,189 INFO L134 CoverageAnalysis]: Checked inductivity of 826 backedges. 56 proven. 10 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2019-09-10 02:04:52,202 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:04:52,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2019-09-10 02:04:52,203 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:04:52,204 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 02:04:52,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 02:04:52,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2019-09-10 02:04:52,207 INFO L87 Difference]: Start difference. First operand 542 states and 873 transitions. Second operand 14 states. [2019-09-10 02:04:54,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:54,216 INFO L93 Difference]: Finished difference Result 537 states and 829 transitions. [2019-09-10 02:04:54,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-10 02:04:54,217 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 132 [2019-09-10 02:04:54,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:54,217 INFO L225 Difference]: With dead ends: 537 [2019-09-10 02:04:54,217 INFO L226 Difference]: Without dead ends: 0 [2019-09-10 02:04:54,219 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 387 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=406, Invalid=1486, Unknown=0, NotChecked=0, Total=1892 [2019-09-10 02:04:54,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-10 02:04:54,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-10 02:04:54,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-10 02:04:54,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-10 02:04:54,220 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 132 [2019-09-10 02:04:54,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:54,220 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-10 02:04:54,221 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-10 02:04:54,221 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-10 02:04:54,221 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-10 02:04:54,225 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 02:04:54 BoogieIcfgContainer [2019-09-10 02:04:54,225 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-10 02:04:54,228 INFO L168 Benchmark]: Toolchain (without parser) took 18008.32 ms. Allocated memory was 135.3 MB in the beginning and 381.2 MB in the end (delta: 245.9 MB). Free memory was 91.2 MB in the beginning and 179.9 MB in the end (delta: -88.7 MB). Peak memory consumption was 157.2 MB. Max. memory is 7.1 GB. [2019-09-10 02:04:54,229 INFO L168 Benchmark]: CDTParser took 0.20 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 02:04:54,229 INFO L168 Benchmark]: CACSL2BoogieTranslator took 276.96 ms. Allocated memory is still 135.3 MB. Free memory was 91.0 MB in the beginning and 81.1 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2019-09-10 02:04:54,230 INFO L168 Benchmark]: Boogie Preprocessor took 130.24 ms. Allocated memory was 135.3 MB in the beginning and 201.9 MB in the end (delta: 66.6 MB). Free memory was 81.1 MB in the beginning and 177.9 MB in the end (delta: -96.8 MB). Peak memory consumption was 15.7 MB. Max. memory is 7.1 GB. [2019-09-10 02:04:54,231 INFO L168 Benchmark]: RCFGBuilder took 356.85 ms. Allocated memory is still 201.9 MB. Free memory was 177.9 MB in the beginning and 162.3 MB in the end (delta: 15.6 MB). Peak memory consumption was 15.6 MB. Max. memory is 7.1 GB. [2019-09-10 02:04:54,232 INFO L168 Benchmark]: TraceAbstraction took 17240.09 ms. Allocated memory was 201.9 MB in the beginning and 381.2 MB in the end (delta: 179.3 MB). Free memory was 161.8 MB in the beginning and 179.9 MB in the end (delta: -18.1 MB). Peak memory consumption was 161.2 MB. Max. memory is 7.1 GB. [2019-09-10 02:04:54,235 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.20 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 276.96 ms. Allocated memory is still 135.3 MB. Free memory was 91.0 MB in the beginning and 81.1 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 130.24 ms. Allocated memory was 135.3 MB in the beginning and 201.9 MB in the end (delta: 66.6 MB). Free memory was 81.1 MB in the beginning and 177.9 MB in the end (delta: -96.8 MB). Peak memory consumption was 15.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 356.85 ms. Allocated memory is still 201.9 MB. Free memory was 177.9 MB in the beginning and 162.3 MB in the end (delta: 15.6 MB). Peak memory consumption was 15.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 17240.09 ms. Allocated memory was 201.9 MB in the beginning and 381.2 MB in the end (delta: 179.3 MB). Free memory was 161.8 MB in the beginning and 179.9 MB in the end (delta: -18.1 MB). Peak memory consumption was 161.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 43 locations, 1 error locations. SAFE Result, 17.1s OverallTime, 20 OverallIterations, 21 TraceHistogramMax, 9.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1558 SDtfs, 1102 SDslu, 5441 SDs, 0 SdLazy, 4518 SolverSat, 2140 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1246 GetRequests, 998 SyntacticMatches, 3 SemanticMatches, 245 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1321 ImplicationChecksByTransitivity, 5.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=542occurred in iteration=19, 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.4s AutomataMinimizationTime, 20 MinimizatonAttempts, 1042 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.2s InterpolantComputationTime, 1419 NumberOfCodeBlocks, 1358 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1885 ConstructedInterpolants, 59 QuantifiedInterpolants, 484851 SizeOfPredicates, 27 NumberOfNonLiveVariables, 920 ConjunctsInSsa, 43 ConjunctsInUnsatCore, 30 InterpolantComputations, 16 PerfectInterpolantSequences, 7580/7694 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...