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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/loops/linear_search.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:07:02,949 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:07:02,951 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:07:02,966 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:07:02,967 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:07:02,969 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:07:02,971 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:07:02,976 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:07:02,977 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:07:02,981 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:07:02,983 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:07:02,984 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:07:02,985 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:07:02,988 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:07:02,991 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:07:02,993 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:07:02,994 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:07:02,997 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:07:02,998 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:07:03,001 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:07:03,006 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:07:03,009 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:07:03,012 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:07:03,013 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:07:03,016 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:07:03,017 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:07:03,017 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:07:03,019 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:07:03,020 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:07:03,021 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:07:03,022 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:07:03,022 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:07:03,023 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:07:03,024 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:07:03,025 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:07:03,025 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:07:03,026 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:07:03,026 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:07:03,026 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:07:03,027 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:07:03,029 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:07:03,029 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 21:07:03,049 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:07:03,049 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:07:03,054 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:07:03,054 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:07:03,054 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:07:03,054 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:07:03,055 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:07:03,055 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:07:03,055 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:07:03,055 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:07:03,055 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:07:03,056 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:07:03,056 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:07:03,056 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:07:03,056 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:07:03,056 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:07:03,057 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:07:03,057 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:07:03,057 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:07:03,057 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:07:03,057 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:07:03,058 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:07:03,058 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:07:03,058 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:07:03,058 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:07:03,059 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:07:03,059 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:07:03,059 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:07:03,059 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-13 21:07:03,323 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:07:03,340 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:07:03,346 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:07:03,348 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:07:03,349 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:07:03,349 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/linear_search.c [2019-10-13 21:07:03,427 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cbb860f7/6f3654a47c9044fdb99f1642b8f910b5/FLAG50f44d806 [2019-10-13 21:07:03,902 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:07:03,903 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/linear_search.c [2019-10-13 21:07:03,911 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cbb860f7/6f3654a47c9044fdb99f1642b8f910b5/FLAG50f44d806 [2019-10-13 21:07:04,231 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cbb860f7/6f3654a47c9044fdb99f1642b8f910b5 [2019-10-13 21:07:04,241 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:07:04,243 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:07:04,244 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:07:04,244 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:07:04,248 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:07:04,249 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:07:04" (1/1) ... [2019-10-13 21:07:04,252 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13879ae4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:07:04, skipping insertion in model container [2019-10-13 21:07:04,252 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:07:04" (1/1) ... [2019-10-13 21:07:04,260 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:07:04,277 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:07:04,437 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:07:04,448 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:07:04,466 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:07:04,481 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:07:04,482 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:07:04 WrapperNode [2019-10-13 21:07:04,482 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:07:04,483 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:07:04,483 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:07:04,483 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:07:04,590 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:07:04" (1/1) ... [2019-10-13 21:07:04,590 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:07:04" (1/1) ... [2019-10-13 21:07:04,600 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:07:04" (1/1) ... [2019-10-13 21:07:04,602 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:07:04" (1/1) ... [2019-10-13 21:07:04,623 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:07:04" (1/1) ... [2019-10-13 21:07:04,630 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:07:04" (1/1) ... [2019-10-13 21:07:04,632 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:07:04" (1/1) ... [2019-10-13 21:07:04,636 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:07:04,637 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:07:04,637 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:07:04,637 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:07:04,638 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:07:04" (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-10-13 21:07:04,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:07:04,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:07:04,699 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-13 21:07:04,699 INFO L138 BoogieDeclarations]: Found implementation of procedure linear_search [2019-10-13 21:07:04,700 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:07:04,700 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:07:04,700 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-13 21:07:04,700 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-13 21:07:04,700 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2019-10-13 21:07:04,700 INFO L130 BoogieDeclarations]: Found specification of procedure linear_search [2019-10-13 21:07:04,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 21:07:04,701 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:07:04,701 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-13 21:07:04,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 21:07:04,701 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:07:04,701 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:07:04,701 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 21:07:04,966 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:07:04,966 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-13 21:07:04,968 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:07:04 BoogieIcfgContainer [2019-10-13 21:07:04,968 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:07:04,970 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:07:04,970 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:07:04,974 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:07:04,974 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:07:04" (1/3) ... [2019-10-13 21:07:04,975 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77ec4841 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:07:04, skipping insertion in model container [2019-10-13 21:07:04,976 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:07:04" (2/3) ... [2019-10-13 21:07:04,976 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77ec4841 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:07:04, skipping insertion in model container [2019-10-13 21:07:04,977 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:07:04" (3/3) ... [2019-10-13 21:07:04,979 INFO L109 eAbstractionObserver]: Analyzing ICFG linear_search.c [2019-10-13 21:07:04,991 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:07:05,000 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:07:05,031 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:07:05,062 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:07:05,062 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:07:05,062 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:07:05,062 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:07:05,063 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:07:05,063 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:07:05,063 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:07:05,063 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:07:05,083 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2019-10-13 21:07:05,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-13 21:07:05,089 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:07:05,090 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:07:05,092 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:07:05,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:07:05,097 INFO L82 PathProgramCache]: Analyzing trace with hash 868129876, now seen corresponding path program 1 times [2019-10-13 21:07:05,104 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:07:05,104 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497438701] [2019-10-13 21:07:05,105 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:07:05,105 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:07:05,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:07:05,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:07:05,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:07:05,270 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497438701] [2019-10-13 21:07:05,270 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:07:05,271 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-13 21:07:05,271 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914234901] [2019-10-13 21:07:05,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-13 21:07:05,277 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:07:05,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-13 21:07:05,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-13 21:07:05,295 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 2 states. [2019-10-13 21:07:05,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:07:05,320 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2019-10-13 21:07:05,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-13 21:07:05,322 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2019-10-13 21:07:05,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:07:05,331 INFO L225 Difference]: With dead ends: 45 [2019-10-13 21:07:05,332 INFO L226 Difference]: Without dead ends: 22 [2019-10-13 21:07:05,335 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-13 21:07:05,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-10-13 21:07:05,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-10-13 21:07:05,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-10-13 21:07:05,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2019-10-13 21:07:05,380 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 18 [2019-10-13 21:07:05,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:07:05,381 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2019-10-13 21:07:05,381 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-13 21:07:05,382 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2019-10-13 21:07:05,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-13 21:07:05,383 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:07:05,383 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:07:05,383 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:07:05,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:07:05,384 INFO L82 PathProgramCache]: Analyzing trace with hash -202652409, now seen corresponding path program 1 times [2019-10-13 21:07:05,384 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:07:05,385 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544063534] [2019-10-13 21:07:05,385 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:07:05,386 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:07:05,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:07:05,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:07:05,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:07:05,529 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544063534] [2019-10-13 21:07:05,529 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:07:05,532 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:07:05,533 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987082726] [2019-10-13 21:07:05,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:07:05,537 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:07:05,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:07:05,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:07:05,538 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand 6 states. [2019-10-13 21:07:05,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:07:05,604 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2019-10-13 21:07:05,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:07:05,606 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-10-13 21:07:05,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:07:05,607 INFO L225 Difference]: With dead ends: 30 [2019-10-13 21:07:05,608 INFO L226 Difference]: Without dead ends: 22 [2019-10-13 21:07:05,610 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:07:05,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-10-13 21:07:05,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-10-13 21:07:05,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-10-13 21:07:05,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2019-10-13 21:07:05,615 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 20 [2019-10-13 21:07:05,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:07:05,616 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-10-13 21:07:05,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:07:05,616 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2019-10-13 21:07:05,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-13 21:07:05,620 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:07:05,620 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:07:05,620 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:07:05,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:07:05,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1540157926, now seen corresponding path program 1 times [2019-10-13 21:07:05,621 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:07:05,622 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221827899] [2019-10-13 21:07:05,622 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:07:05,622 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:07:05,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:07:05,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:07:05,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:07:05,791 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221827899] [2019-10-13 21:07:05,791 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:07:05,792 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:07:05,792 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286132177] [2019-10-13 21:07:05,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:07:05,793 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:07:05,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:07:05,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:07:05,794 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 5 states. [2019-10-13 21:07:05,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:07:05,865 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2019-10-13 21:07:05,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:07:05,866 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-10-13 21:07:05,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:07:05,867 INFO L225 Difference]: With dead ends: 34 [2019-10-13 21:07:05,867 INFO L226 Difference]: Without dead ends: 25 [2019-10-13 21:07:05,868 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:07:05,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-10-13 21:07:05,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-10-13 21:07:05,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-10-13 21:07:05,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2019-10-13 21:07:05,875 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 20 [2019-10-13 21:07:05,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:07:05,875 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2019-10-13 21:07:05,875 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:07:05,876 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2019-10-13 21:07:05,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-13 21:07:05,876 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:07:05,877 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:07:05,877 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:07:05,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:07:05,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1697189824, now seen corresponding path program 1 times [2019-10-13 21:07:05,878 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:07:05,878 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822316117] [2019-10-13 21:07:05,878 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:07:05,878 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:07:05,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:07:05,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:07:06,055 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:07:06,055 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822316117] [2019-10-13 21:07:06,056 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:07:06,056 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:07:06,056 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522039822] [2019-10-13 21:07:06,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:07:06,057 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:07:06,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:07:06,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:07:06,058 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 5 states. [2019-10-13 21:07:06,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:07:06,143 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2019-10-13 21:07:06,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:07:06,144 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-10-13 21:07:06,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:07:06,147 INFO L225 Difference]: With dead ends: 46 [2019-10-13 21:07:06,147 INFO L226 Difference]: Without dead ends: 32 [2019-10-13 21:07:06,148 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:07:06,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-10-13 21:07:06,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2019-10-13 21:07:06,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-10-13 21:07:06,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2019-10-13 21:07:06,156 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 24 [2019-10-13 21:07:06,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:07:06,156 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2019-10-13 21:07:06,156 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:07:06,157 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2019-10-13 21:07:06,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-13 21:07:06,158 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:07:06,158 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:07:06,158 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:07:06,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:07:06,159 INFO L82 PathProgramCache]: Analyzing trace with hash -2090216834, now seen corresponding path program 1 times [2019-10-13 21:07:06,159 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:07:06,159 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414613845] [2019-10-13 21:07:06,159 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:07:06,160 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:07:06,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:07:06,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:07:06,292 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:07:06,293 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414613845] [2019-10-13 21:07:06,296 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:07:06,296 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:07:06,296 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62136405] [2019-10-13 21:07:06,297 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:07:06,297 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:07:06,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:07:06,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:07:06,298 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 4 states. [2019-10-13 21:07:06,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:07:06,342 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2019-10-13 21:07:06,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:07:06,343 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-10-13 21:07:06,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:07:06,344 INFO L225 Difference]: With dead ends: 48 [2019-10-13 21:07:06,344 INFO L226 Difference]: Without dead ends: 36 [2019-10-13 21:07:06,345 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:07:06,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-10-13 21:07:06,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 29. [2019-10-13 21:07:06,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-13 21:07:06,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2019-10-13 21:07:06,351 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 24 [2019-10-13 21:07:06,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:07:06,352 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2019-10-13 21:07:06,352 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:07:06,352 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2019-10-13 21:07:06,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-13 21:07:06,353 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:07:06,353 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:07:06,354 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:07:06,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:07:06,354 INFO L82 PathProgramCache]: Analyzing trace with hash -1439024386, now seen corresponding path program 1 times [2019-10-13 21:07:06,354 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:07:06,354 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123542470] [2019-10-13 21:07:06,355 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:07:06,355 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:07:06,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:07:06,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:07:06,446 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:07:06,446 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123542470] [2019-10-13 21:07:06,447 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [619863933] [2019-10-13 21:07:06,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:07:06,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:07:06,514 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-13 21:07:06,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:07:06,646 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:07:06,646 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:07:06,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:07:06,970 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:07:06,970 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [1364378705] [2019-10-13 21:07:06,989 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 25 [2019-10-13 21:07:07,034 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-13 21:07:07,035 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-13 21:07:07,108 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-13 21:07:07,119 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-13 21:07:07,120 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 23 root evaluator evaluations with a maximum evaluation depth of 9. Performed 23 inverse root evaluator evaluations with a maximum inverse evaluation depth of 9. Never found a fixpoint. Largest state had 22 variables. [2019-10-13 21:07:07,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:07:07,125 INFO L536 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-13 21:07:07,168 INFO L227 lantSequenceWeakener]: Weakened 5 states. On average, predicates are now at 77.5% of their original sizes. [2019-10-13 21:07:07,168 INFO L551 sIntCurrentIteration]: Unifying AI predicates [2019-10-13 21:07:07,199 INFO L553 sIntCurrentIteration]: We unified 23 AI predicates to 23 [2019-10-13 21:07:07,200 INFO L562 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-13 21:07:07,202 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-10-13 21:07:07,202 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 7, 7] total 17 [2019-10-13 21:07:07,202 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012693847] [2019-10-13 21:07:07,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:07:07,204 INFO L137 tionRefinementEngine]: Using predicate unifier AbsIntPredicateUnifier provided by strategy TAIPAN [2019-10-13 21:07:07,204 INFO L124 tionRefinementEngine]: Using hoare triple checker CachingHoareTripleCheckerMap provided by strategy [2019-10-13 21:07:07,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:07:07,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:07:07,205 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 4 states. [2019-10-13 21:07:07,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:07:07,218 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2019-10-13 21:07:07,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:07:07,218 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-10-13 21:07:07,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:07:07,219 INFO L225 Difference]: With dead ends: 29 [2019-10-13 21:07:07,219 INFO L226 Difference]: Without dead ends: 0 [2019-10-13 21:07:07,220 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:07:07,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-13 21:07:07,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-13 21:07:07,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-13 21:07:07,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-13 21:07:07,221 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2019-10-13 21:07:07,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:07:07,222 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-13 21:07:07,222 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:07:07,222 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-13 21:07:07,222 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-13 21:07:07,427 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:07:07,433 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-13 21:07:07,502 INFO L443 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. [2019-10-13 21:07:07,503 INFO L446 ceAbstractionStarter]: At program point L17-2(lines 15 18) the Hoare annotation is: true [2019-10-13 21:07:07,503 INFO L443 ceAbstractionStarter]: For program point L15-1(line 15) no Hoare annotation was computed. [2019-10-13 21:07:07,503 INFO L443 ceAbstractionStarter]: For program point L15-3(lines 15 18) no Hoare annotation was computed. [2019-10-13 21:07:07,503 INFO L443 ceAbstractionStarter]: For program point L15-5(lines 13 21) no Hoare annotation was computed. [2019-10-13 21:07:07,503 INFO L443 ceAbstractionStarter]: For program point linear_searchFINAL(lines 13 21) no Hoare annotation was computed. [2019-10-13 21:07:07,504 INFO L446 ceAbstractionStarter]: At program point linear_searchENTRY(lines 13 21) the Hoare annotation is: true [2019-10-13 21:07:07,504 INFO L443 ceAbstractionStarter]: For program point linear_searchEXIT(lines 13 21) no Hoare annotation was computed. [2019-10-13 21:07:07,504 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-10-13 21:07:07,504 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2019-10-13 21:07:07,504 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-13 21:07:07,505 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-13 21:07:07,505 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~MAX~0 100000) (<= ~SIZE~0 (* 4294967296 (div ~SIZE~0 4294967296)))) [2019-10-13 21:07:07,505 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-13 21:07:07,505 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-13 21:07:07,505 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 22 30) the Hoare annotation is: (or (not (<= |old(~SIZE~0)| (* 4294967296 (div |old(~SIZE~0)| 4294967296)))) (<= ~SIZE~0 (* 4294967296 (div ~SIZE~0 4294967296))) (not (= 100000 ~MAX~0))) [2019-10-13 21:07:07,506 INFO L439 ceAbstractionStarter]: At program point L28(line 28) the Hoare annotation is: (or (not (<= |old(~SIZE~0)| (* 4294967296 (div |old(~SIZE~0)| 4294967296)))) (not (= 100000 ~MAX~0))) [2019-10-13 21:07:07,506 INFO L443 ceAbstractionStarter]: For program point L28-1(line 28) no Hoare annotation was computed. [2019-10-13 21:07:07,506 INFO L439 ceAbstractionStarter]: At program point L28-2(line 28) the Hoare annotation is: (or (not (<= |old(~SIZE~0)| (* 4294967296 (div |old(~SIZE~0)| 4294967296)))) (not (= 100000 ~MAX~0)) (= 1 |main_#t~ret5|)) [2019-10-13 21:07:07,506 INFO L443 ceAbstractionStarter]: For program point L25(lines 25 29) no Hoare annotation was computed. [2019-10-13 21:07:07,506 INFO L443 ceAbstractionStarter]: For program point L28-3(line 28) no Hoare annotation was computed. [2019-10-13 21:07:07,507 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 22 30) no Hoare annotation was computed. [2019-10-13 21:07:07,507 INFO L443 ceAbstractionStarter]: For program point L25-2(lines 22 30) no Hoare annotation was computed. [2019-10-13 21:07:07,507 INFO L446 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 4 9) the Hoare annotation is: true [2019-10-13 21:07:07,507 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 4 9) no Hoare annotation was computed. [2019-10-13 21:07:07,507 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2019-10-13 21:07:07,507 INFO L443 ceAbstractionStarter]: For program point L6(line 6) no Hoare annotation was computed. [2019-10-13 21:07:07,508 INFO L443 ceAbstractionStarter]: For program point L5(lines 5 7) no Hoare annotation was computed. [2019-10-13 21:07:07,508 INFO L443 ceAbstractionStarter]: For program point L5-2(lines 4 9) no Hoare annotation was computed. [2019-10-13 21:07:07,516 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 09:07:07 BoogieIcfgContainer [2019-10-13 21:07:07,516 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-13 21:07:07,519 INFO L168 Benchmark]: Toolchain (without parser) took 3275.35 ms. Allocated memory was 144.7 MB in the beginning and 235.4 MB in the end (delta: 90.7 MB). Free memory was 101.4 MB in the beginning and 104.1 MB in the end (delta: -2.7 MB). Peak memory consumption was 88.0 MB. Max. memory is 7.1 GB. [2019-10-13 21:07:07,520 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 144.7 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-13 21:07:07,521 INFO L168 Benchmark]: CACSL2BoogieTranslator took 238.41 ms. Allocated memory is still 144.7 MB. Free memory was 101.2 MB in the beginning and 91.1 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2019-10-13 21:07:07,522 INFO L168 Benchmark]: Boogie Preprocessor took 153.04 ms. Allocated memory was 144.7 MB in the beginning and 203.4 MB in the end (delta: 58.7 MB). Free memory was 91.1 MB in the beginning and 181.6 MB in the end (delta: -90.5 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. [2019-10-13 21:07:07,523 INFO L168 Benchmark]: RCFGBuilder took 331.88 ms. Allocated memory is still 203.4 MB. Free memory was 181.6 MB in the beginning and 165.5 MB in the end (delta: 16.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 7.1 GB. [2019-10-13 21:07:07,524 INFO L168 Benchmark]: TraceAbstraction took 2546.62 ms. Allocated memory was 203.4 MB in the beginning and 235.4 MB in the end (delta: 32.0 MB). Free memory was 165.5 MB in the beginning and 104.1 MB in the end (delta: 61.4 MB). Peak memory consumption was 93.4 MB. Max. memory is 7.1 GB. [2019-10-13 21:07:07,528 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.22 ms. Allocated memory is still 144.7 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 238.41 ms. Allocated memory is still 144.7 MB. Free memory was 101.2 MB in the beginning and 91.1 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 153.04 ms. Allocated memory was 144.7 MB in the beginning and 203.4 MB in the end (delta: 58.7 MB). Free memory was 91.1 MB in the beginning and 181.6 MB in the end (delta: -90.5 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 331.88 ms. Allocated memory is still 203.4 MB. Free memory was 181.6 MB in the beginning and 165.5 MB in the end (delta: 16.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2546.62 ms. Allocated memory was 203.4 MB in the beginning and 235.4 MB in the end (delta: 32.0 MB). Free memory was 165.5 MB in the beginning and 104.1 MB in the end (delta: 61.4 MB). Peak memory consumption was 93.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 6]: 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 - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 29 locations, 1 error locations. Result: SAFE, OverallTime: 2.4s, OverallIterations: 6, TraceHistogramMax: 2, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 123 SDtfs, 59 SDslu, 193 SDs, 0 SdLazy, 72 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 32 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 11 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 14 PreInvPairs, 15 NumberOfFragments, 65 HoareAnnotationTreeSize, 14 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 4 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 154 NumberOfCodeBlocks, 154 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 170 ConstructedInterpolants, 0 QuantifiedInterpolants, 19504 SizeOfPredicates, 2 NumberOfNonLiveVariables, 112 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 8 InterpolantComputations, 5 PerfectInterpolantSequences, 6/15 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: TIME[ms]: 136, ITERATIONS: 1, WAS_STRONG: 1, WEAKENING_RATIO: 0.9728260869565217, AVG_VARS_REMOVED_DURING_WEAKENING: 1.2608695652173914, AVG_WEAKENED_CONJUNCTS: 0.9565217391304348, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...