./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_hash_table_clean_up_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb692b52 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_hash_table_clean_up_harness.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 3bf4efa014e51efebc29a26fae4d93bdd4ac97a340040c60e527138ec3a88197 --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 22:09:34,009 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 22:09:34,011 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 22:09:34,036 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 22:09:34,036 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 22:09:34,037 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 22:09:34,039 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 22:09:34,040 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 22:09:34,042 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 22:09:34,042 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 22:09:34,043 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 22:09:34,044 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 22:09:34,045 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 22:09:34,045 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 22:09:34,046 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 22:09:34,047 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 22:09:34,048 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 22:09:34,049 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 22:09:34,050 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 22:09:34,052 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 22:09:34,053 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 22:09:34,054 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 22:09:34,055 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 22:09:34,056 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 22:09:34,057 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 22:09:34,060 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 22:09:34,060 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 22:09:34,061 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 22:09:34,062 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 22:09:34,062 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 22:09:34,063 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 22:09:34,063 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 22:09:34,064 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 22:09:34,065 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 22:09:34,065 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 22:09:34,066 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 22:09:34,066 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 22:09:34,067 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 22:09:34,067 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 22:09:34,068 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 22:09:34,068 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 22:09:34,069 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 22:09:34,070 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-19 22:09:34,091 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 22:09:34,091 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 22:09:34,092 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 22:09:34,092 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 22:09:34,092 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 22:09:34,093 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 22:09:34,093 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 22:09:34,093 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 22:09:34,094 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 22:09:34,094 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 22:09:34,094 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 22:09:34,094 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 22:09:34,094 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 22:09:34,095 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 22:09:34,095 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 22:09:34,095 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 22:09:34,095 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 22:09:34,095 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 22:09:34,096 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 22:09:34,096 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 22:09:34,096 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 22:09:34,096 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 22:09:34,096 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 22:09:34,097 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 22:09:34,097 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 22:09:34,097 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 22:09:34,097 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 22:09:34,097 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 22:09:34,098 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 22:09:34,098 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 22:09:34,098 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3bf4efa014e51efebc29a26fae4d93bdd4ac97a340040c60e527138ec3a88197 [2022-07-19 22:09:34,311 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 22:09:34,334 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 22:09:34,338 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 22:09:34,341 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 22:09:34,342 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 22:09:34,343 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_hash_table_clean_up_harness.i [2022-07-19 22:09:34,402 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ecfc5ca42/5a4e595998dc40399b3d5faa4b6260f4/FLAGaa32f439a [2022-07-19 22:09:35,068 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 22:09:35,069 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_clean_up_harness.i [2022-07-19 22:09:35,107 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ecfc5ca42/5a4e595998dc40399b3d5faa4b6260f4/FLAGaa32f439a [2022-07-19 22:09:35,433 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ecfc5ca42/5a4e595998dc40399b3d5faa4b6260f4 [2022-07-19 22:09:35,435 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 22:09:35,437 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 22:09:35,439 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 22:09:35,440 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 22:09:35,445 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 22:09:35,446 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 10:09:35" (1/1) ... [2022-07-19 22:09:35,447 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@198ad912 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:09:35, skipping insertion in model container [2022-07-19 22:09:35,447 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 10:09:35" (1/1) ... [2022-07-19 22:09:35,454 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 22:09:35,567 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 22:09:35,836 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_clean_up_harness.i[4497,4510] [2022-07-19 22:09:35,843 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_clean_up_harness.i[4557,4570] [2022-07-19 22:09:36,635 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:36,635 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:36,636 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:36,636 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:36,637 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:36,660 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:36,661 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:36,662 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:36,662 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:36,666 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:36,668 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:36,669 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:36,670 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:37,081 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-19 22:09:37,084 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-19 22:09:37,085 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-19 22:09:37,086 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-19 22:09:37,087 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-19 22:09:37,088 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-19 22:09:37,088 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-19 22:09:37,089 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-19 22:09:37,098 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-19 22:09:37,100 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-19 22:09:37,299 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-19 22:09:37,573 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:37,574 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:37,593 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:37,594 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:37,600 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:37,601 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:37,615 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:37,617 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:37,618 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:37,618 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:37,618 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:37,619 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:37,619 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:37,653 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 22:09:37,691 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 22:09:37,712 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_clean_up_harness.i[4497,4510] [2022-07-19 22:09:37,713 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_clean_up_harness.i[4557,4570] [2022-07-19 22:09:37,745 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:37,745 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:37,746 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:37,778 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:37,779 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:37,782 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:37,783 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:37,783 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:37,784 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:37,784 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:37,784 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:37,785 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:37,785 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:37,811 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-19 22:09:37,812 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-19 22:09:37,812 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-19 22:09:37,813 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-19 22:09:37,814 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-19 22:09:37,814 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-19 22:09:37,817 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-19 22:09:37,817 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-19 22:09:37,817 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-19 22:09:37,818 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-19 22:09:37,838 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-19 22:09:37,921 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:37,921 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:37,928 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:37,928 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:37,930 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:37,931 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:37,956 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:37,957 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:37,957 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:37,957 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:37,958 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:37,958 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:37,959 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:37,981 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 22:09:38,191 INFO L208 MainTranslator]: Completed translation [2022-07-19 22:09:38,192 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:09:38 WrapperNode [2022-07-19 22:09:38,192 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 22:09:38,193 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 22:09:38,193 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 22:09:38,193 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 22:09:38,199 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:09:38" (1/1) ... [2022-07-19 22:09:38,296 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:09:38" (1/1) ... [2022-07-19 22:09:38,371 INFO L137 Inliner]: procedures = 775, calls = 2445, calls flagged for inlining = 71, calls inlined = 16, statements flattened = 721 [2022-07-19 22:09:38,372 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 22:09:38,373 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 22:09:38,374 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 22:09:38,374 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 22:09:38,381 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:09:38" (1/1) ... [2022-07-19 22:09:38,382 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:09:38" (1/1) ... [2022-07-19 22:09:38,393 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:09:38" (1/1) ... [2022-07-19 22:09:38,394 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:09:38" (1/1) ... [2022-07-19 22:09:38,433 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:09:38" (1/1) ... [2022-07-19 22:09:38,441 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:09:38" (1/1) ... [2022-07-19 22:09:38,461 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:09:38" (1/1) ... [2022-07-19 22:09:38,471 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 22:09:38,483 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 22:09:38,483 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 22:09:38,483 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 22:09:38,484 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:09:38" (1/1) ... [2022-07-19 22:09:38,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 22:09:38,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:09:38,520 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-19 22:09:38,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-19 22:09:38,555 INFO L130 BoogieDeclarations]: Found specification of procedure memset_override_0_impl [2022-07-19 22:09:38,556 INFO L138 BoogieDeclarations]: Found implementation of procedure memset_override_0_impl [2022-07-19 22:09:38,556 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-07-19 22:09:38,556 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2022-07-19 22:09:38,556 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2022-07-19 22:09:38,556 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-19 22:09:38,556 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2022-07-19 22:09:38,556 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2022-07-19 22:09:38,556 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-19 22:09:38,557 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-19 22:09:38,557 INFO L130 BoogieDeclarations]: Found specification of procedure hash_table_state_is_valid [2022-07-19 22:09:38,557 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_table_state_is_valid [2022-07-19 22:09:38,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-19 22:09:38,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 22:09:38,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-19 22:09:38,558 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 22:09:38,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 22:09:38,558 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2022-07-19 22:09:38,558 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2022-07-19 22:09:38,558 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mul_size_checked [2022-07-19 22:09:38,559 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mul_size_checked [2022-07-19 22:09:38,559 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mem_release [2022-07-19 22:09:38,559 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mem_release [2022-07-19 22:09:38,559 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-19 22:09:38,559 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_plus [2022-07-19 22:09:38,559 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_plus [2022-07-19 22:09:38,560 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-19 22:09:38,560 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-07-19 22:09:38,560 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-07-19 22:09:38,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-19 22:09:38,560 INFO L130 BoogieDeclarations]: Found specification of procedure my_memset [2022-07-19 22:09:38,560 INFO L138 BoogieDeclarations]: Found implementation of procedure my_memset [2022-07-19 22:09:38,560 INFO L130 BoogieDeclarations]: Found specification of procedure aws_is_power_of_two [2022-07-19 22:09:38,561 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_is_power_of_two [2022-07-19 22:09:38,561 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-19 22:09:38,561 INFO L130 BoogieDeclarations]: Found specification of procedure hash_table_state_required_bytes [2022-07-19 22:09:38,561 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_table_state_required_bytes [2022-07-19 22:09:38,561 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-07-19 22:09:38,562 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-07-19 22:09:38,562 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-19 22:09:38,562 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-19 22:09:38,562 INFO L130 BoogieDeclarations]: Found specification of procedure aws_hash_table_is_valid [2022-07-19 22:09:38,563 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_hash_table_is_valid [2022-07-19 22:09:38,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-19 22:09:38,565 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2022-07-19 22:09:38,565 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2022-07-19 22:09:38,565 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_mult [2022-07-19 22:09:38,566 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_mult [2022-07-19 22:09:38,566 INFO L130 BoogieDeclarations]: Found specification of procedure aws_add_size_checked [2022-07-19 22:09:38,566 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_add_size_checked [2022-07-19 22:09:38,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 22:09:38,905 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 22:09:38,907 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 22:09:39,728 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 22:09:39,741 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 22:09:39,742 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-19 22:09:39,744 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:09:39 BoogieIcfgContainer [2022-07-19 22:09:39,745 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 22:09:39,749 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 22:09:39,749 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 22:09:39,753 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 22:09:39,753 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 10:09:35" (1/3) ... [2022-07-19 22:09:39,754 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d39f1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 10:09:39, skipping insertion in model container [2022-07-19 22:09:39,754 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:09:38" (2/3) ... [2022-07-19 22:09:39,754 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d39f1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 10:09:39, skipping insertion in model container [2022-07-19 22:09:39,755 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:09:39" (3/3) ... [2022-07-19 22:09:39,756 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_hash_table_clean_up_harness.i [2022-07-19 22:09:39,770 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 22:09:39,771 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 22:09:39,841 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 22:09:39,851 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6653ad2a, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@75ff13d7 [2022-07-19 22:09:39,852 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 22:09:39,860 INFO L276 IsEmpty]: Start isEmpty. Operand has 194 states, 126 states have (on average 1.1984126984126984) internal successors, (151), 127 states have internal predecessors, (151), 47 states have call successors, (47), 19 states have call predecessors, (47), 19 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) [2022-07-19 22:09:39,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-07-19 22:09:39,879 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:09:39,880 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 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, 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, 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, 1, 1, 1, 1, 1, 1] [2022-07-19 22:09:39,880 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:09:39,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:09:39,887 INFO L85 PathProgramCache]: Analyzing trace with hash -623915720, now seen corresponding path program 1 times [2022-07-19 22:09:39,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:09:39,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778858665] [2022-07-19 22:09:39,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:09:39,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:09:40,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:40,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:09:40,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:40,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 22:09:40,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:40,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:09:40,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:40,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 22:09:40,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:40,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 22:09:40,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:09:40,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778858665] [2022-07-19 22:09:40,490 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2022-07-19 22:09:40,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [77568678] [2022-07-19 22:09:40,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:09:40,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:09:40,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:09:40,493 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 22:09:40,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-19 22:09:41,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:41,054 INFO L263 TraceCheckSpWp]: Trace formula consists of 2338 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-19 22:09:41,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:09:41,084 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2022-07-19 22:09:41,084 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 22:09:41,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [77568678] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:09:41,085 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:09:41,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-19 22:09:41,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765820199] [2022-07-19 22:09:41,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:09:41,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-19 22:09:41,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:09:41,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-19 22:09:41,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 22:09:41,118 INFO L87 Difference]: Start difference. First operand has 194 states, 126 states have (on average 1.1984126984126984) internal successors, (151), 127 states have internal predecessors, (151), 47 states have call successors, (47), 19 states have call predecessors, (47), 19 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) Second operand has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-19 22:09:41,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:09:41,185 INFO L93 Difference]: Finished difference Result 383 states and 508 transitions. [2022-07-19 22:09:41,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-19 22:09:41,187 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 134 [2022-07-19 22:09:41,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:09:41,196 INFO L225 Difference]: With dead ends: 383 [2022-07-19 22:09:41,196 INFO L226 Difference]: Without dead ends: 187 [2022-07-19 22:09:41,200 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 22:09:41,203 INFO L413 NwaCegarLoop]: 241 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 22:09:41,204 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 22:09:41,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2022-07-19 22:09:41,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2022-07-19 22:09:41,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 120 states have (on average 1.1666666666666667) internal successors, (140), 121 states have internal predecessors, (140), 47 states have call successors, (47), 19 states have call predecessors, (47), 19 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2022-07-19 22:09:41,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 233 transitions. [2022-07-19 22:09:41,250 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 233 transitions. Word has length 134 [2022-07-19 22:09:41,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:09:41,251 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 233 transitions. [2022-07-19 22:09:41,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-19 22:09:41,252 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 233 transitions. [2022-07-19 22:09:41,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-07-19 22:09:41,257 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:09:41,257 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 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, 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, 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, 1, 1, 1, 1, 1, 1] [2022-07-19 22:09:41,283 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-19 22:09:41,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-07-19 22:09:41,473 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:09:41,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:09:41,474 INFO L85 PathProgramCache]: Analyzing trace with hash -428434944, now seen corresponding path program 1 times [2022-07-19 22:09:41,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:09:41,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115436468] [2022-07-19 22:09:41,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:09:41,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:09:41,563 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-19 22:09:41,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1899234248] [2022-07-19 22:09:41,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:09:41,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:09:41,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:09:41,566 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 22:09:41,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-19 22:09:42,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:42,075 INFO L263 TraceCheckSpWp]: Trace formula consists of 2338 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-19 22:09:42,081 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:09:42,120 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2022-07-19 22:09:42,121 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 22:09:42,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:09:42,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115436468] [2022-07-19 22:09:42,121 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-19 22:09:42,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1899234248] [2022-07-19 22:09:42,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1899234248] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:09:42,122 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:09:42,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 22:09:42,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104422805] [2022-07-19 22:09:42,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:09:42,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 22:09:42,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:09:42,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 22:09:42,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 22:09:42,129 INFO L87 Difference]: Start difference. First operand 187 states and 233 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-19 22:09:42,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:09:42,182 INFO L93 Difference]: Finished difference Result 337 states and 421 transitions. [2022-07-19 22:09:42,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 22:09:42,183 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) Word has length 134 [2022-07-19 22:09:42,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:09:42,190 INFO L225 Difference]: With dead ends: 337 [2022-07-19 22:09:42,194 INFO L226 Difference]: Without dead ends: 192 [2022-07-19 22:09:42,196 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-19 22:09:42,199 INFO L413 NwaCegarLoop]: 230 mSDtfsCounter, 2 mSDsluCounter, 685 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 915 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 22:09:42,202 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 915 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 22:09:42,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2022-07-19 22:09:42,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2022-07-19 22:09:42,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 124 states have (on average 1.1612903225806452) internal successors, (144), 125 states have internal predecessors, (144), 47 states have call successors, (47), 19 states have call predecessors, (47), 20 states have return successors, (47), 47 states have call predecessors, (47), 46 states have call successors, (47) [2022-07-19 22:09:42,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 238 transitions. [2022-07-19 22:09:42,224 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 238 transitions. Word has length 134 [2022-07-19 22:09:42,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:09:42,225 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 238 transitions. [2022-07-19 22:09:42,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-19 22:09:42,226 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 238 transitions. [2022-07-19 22:09:42,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-07-19 22:09:42,244 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:09:42,244 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:09:42,275 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-19 22:09:42,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2022-07-19 22:09:42,468 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:09:42,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:09:42,468 INFO L85 PathProgramCache]: Analyzing trace with hash -447704184, now seen corresponding path program 1 times [2022-07-19 22:09:42,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:09:42,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198469558] [2022-07-19 22:09:42,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:09:42,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:09:42,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:42,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:09:42,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:42,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 22:09:42,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:42,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:09:42,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:42,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 22:09:42,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:42,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 22:09:42,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:42,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:09:42,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:42,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:09:42,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:42,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:09:42,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:42,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 22:09:42,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:42,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 22:09:42,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:42,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:09:42,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:42,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 22:09:42,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:43,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-19 22:09:43,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:43,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-19 22:09:43,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:43,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-19 22:09:43,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:43,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-19 22:09:43,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:43,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-19 22:09:43,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:43,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-19 22:09:43,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:43,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-19 22:09:43,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:43,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-19 22:09:43,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:43,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-19 22:09:43,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:43,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-19 22:09:43,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:43,165 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2022-07-19 22:09:43,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:09:43,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198469558] [2022-07-19 22:09:43,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198469558] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:09:43,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:09:43,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-19 22:09:43,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890956556] [2022-07-19 22:09:43,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:09:43,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-19 22:09:43,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:09:43,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-19 22:09:43,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2022-07-19 22:09:43,168 INFO L87 Difference]: Start difference. First operand 192 states and 238 transitions. Second operand has 13 states, 13 states have (on average 4.923076923076923) internal successors, (64), 9 states have internal predecessors, (64), 4 states have call successors, (23), 5 states have call predecessors, (23), 3 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2022-07-19 22:09:44,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:09:44,312 INFO L93 Difference]: Finished difference Result 348 states and 437 transitions. [2022-07-19 22:09:44,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-19 22:09:44,313 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.923076923076923) internal successors, (64), 9 states have internal predecessors, (64), 4 states have call successors, (23), 5 states have call predecessors, (23), 3 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) Word has length 140 [2022-07-19 22:09:44,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:09:44,321 INFO L225 Difference]: With dead ends: 348 [2022-07-19 22:09:44,321 INFO L226 Difference]: Without dead ends: 217 [2022-07-19 22:09:44,323 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2022-07-19 22:09:44,327 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 170 mSDsluCounter, 777 mSDsCounter, 0 mSdLazyCounter, 1051 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 974 SdHoareTripleChecker+Invalid, 1132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 1051 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-19 22:09:44,329 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 974 Invalid, 1132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 1051 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-19 22:09:44,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2022-07-19 22:09:44,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 197. [2022-07-19 22:09:44,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 128 states have (on average 1.1640625) internal successors, (149), 130 states have internal predecessors, (149), 47 states have call successors, (47), 19 states have call predecessors, (47), 21 states have return successors, (50), 47 states have call predecessors, (50), 46 states have call successors, (50) [2022-07-19 22:09:44,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 246 transitions. [2022-07-19 22:09:44,366 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 246 transitions. Word has length 140 [2022-07-19 22:09:44,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:09:44,367 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 246 transitions. [2022-07-19 22:09:44,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.923076923076923) internal successors, (64), 9 states have internal predecessors, (64), 4 states have call successors, (23), 5 states have call predecessors, (23), 3 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2022-07-19 22:09:44,368 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 246 transitions. [2022-07-19 22:09:44,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-07-19 22:09:44,371 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:09:44,372 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:09:44,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-19 22:09:44,372 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:09:44,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:09:44,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1286400266, now seen corresponding path program 1 times [2022-07-19 22:09:44,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:09:44,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031895213] [2022-07-19 22:09:44,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:09:44,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:09:44,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:44,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:09:44,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:44,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 22:09:44,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:44,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:09:44,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:44,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 22:09:44,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:44,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 22:09:44,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:44,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:09:44,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:44,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:09:44,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:44,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:09:44,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:44,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 22:09:44,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:44,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 22:09:44,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:44,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:09:44,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:44,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 22:09:44,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:44,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-19 22:09:44,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:44,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-19 22:09:44,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:44,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-19 22:09:44,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:44,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-19 22:09:44,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:44,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-19 22:09:44,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:44,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-19 22:09:44,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:44,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-19 22:09:44,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:44,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-19 22:09:44,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:44,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-19 22:09:44,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:44,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-19 22:09:44,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:44,878 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2022-07-19 22:09:44,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:09:44,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031895213] [2022-07-19 22:09:44,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031895213] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:09:44,879 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:09:44,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-19 22:09:44,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104661804] [2022-07-19 22:09:44,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:09:44,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 22:09:44,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:09:44,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 22:09:44,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-19 22:09:44,881 INFO L87 Difference]: Start difference. First operand 197 states and 246 transitions. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 5 states have internal predecessors, (64), 3 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2022-07-19 22:09:45,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:09:45,502 INFO L93 Difference]: Finished difference Result 355 states and 449 transitions. [2022-07-19 22:09:45,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 22:09:45,503 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 5 states have internal predecessors, (64), 3 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) Word has length 140 [2022-07-19 22:09:45,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:09:45,505 INFO L225 Difference]: With dead ends: 355 [2022-07-19 22:09:45,505 INFO L226 Difference]: Without dead ends: 219 [2022-07-19 22:09:45,506 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-07-19 22:09:45,507 INFO L413 NwaCegarLoop]: 211 mSDtfsCounter, 194 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-19 22:09:45,507 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 632 Invalid, 627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 505 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-19 22:09:45,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2022-07-19 22:09:45,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 199. [2022-07-19 22:09:45,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 129 states have (on average 1.1627906976744187) internal successors, (150), 131 states have internal predecessors, (150), 48 states have call successors, (48), 19 states have call predecessors, (48), 21 states have return successors, (51), 48 states have call predecessors, (51), 47 states have call successors, (51) [2022-07-19 22:09:45,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 249 transitions. [2022-07-19 22:09:45,524 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 249 transitions. Word has length 140 [2022-07-19 22:09:45,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:09:45,525 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 249 transitions. [2022-07-19 22:09:45,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 5 states have internal predecessors, (64), 3 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2022-07-19 22:09:45,525 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 249 transitions. [2022-07-19 22:09:45,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-07-19 22:09:45,527 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:09:45,527 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:09:45,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-19 22:09:45,528 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:09:45,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:09:45,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1325960714, now seen corresponding path program 1 times [2022-07-19 22:09:45,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:09:45,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132215267] [2022-07-19 22:09:45,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:09:45,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:09:45,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:45,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:09:45,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:45,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 22:09:45,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:45,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:09:45,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:45,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 22:09:45,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:45,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 22:09:45,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:45,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:09:45,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:45,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:09:45,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:45,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:09:45,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:45,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 22:09:45,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:45,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 22:09:45,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:45,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:09:45,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:45,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 22:09:45,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:45,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 22:09:45,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:45,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-19 22:09:45,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:45,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-19 22:09:45,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:45,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-19 22:09:45,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:45,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-19 22:09:45,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:45,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-19 22:09:45,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:45,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-19 22:09:45,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:45,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-19 22:09:45,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:46,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-19 22:09:46,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:46,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-19 22:09:46,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:46,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-19 22:09:46,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:46,035 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2022-07-19 22:09:46,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:09:46,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132215267] [2022-07-19 22:09:46,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132215267] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:09:46,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:09:46,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-19 22:09:46,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541052569] [2022-07-19 22:09:46,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:09:46,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-19 22:09:46,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:09:46,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-19 22:09:46,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-19 22:09:46,038 INFO L87 Difference]: Start difference. First operand 199 states and 249 transitions. Second operand has 10 states, 9 states have (on average 7.555555555555555) internal successors, (68), 7 states have internal predecessors, (68), 3 states have call successors, (24), 5 states have call predecessors, (24), 3 states have return successors, (23), 2 states have call predecessors, (23), 3 states have call successors, (23) [2022-07-19 22:09:46,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:09:46,866 INFO L93 Difference]: Finished difference Result 357 states and 457 transitions. [2022-07-19 22:09:46,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-19 22:09:46,866 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.555555555555555) internal successors, (68), 7 states have internal predecessors, (68), 3 states have call successors, (24), 5 states have call predecessors, (24), 3 states have return successors, (23), 2 states have call predecessors, (23), 3 states have call successors, (23) Word has length 146 [2022-07-19 22:09:46,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:09:46,868 INFO L225 Difference]: With dead ends: 357 [2022-07-19 22:09:46,868 INFO L226 Difference]: Without dead ends: 217 [2022-07-19 22:09:46,869 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2022-07-19 22:09:46,870 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 149 mSDsluCounter, 708 mSDsCounter, 0 mSdLazyCounter, 741 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 918 SdHoareTripleChecker+Invalid, 867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-19 22:09:46,870 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 918 Invalid, 867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 741 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-19 22:09:46,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2022-07-19 22:09:46,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 199. [2022-07-19 22:09:46,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 129 states have (on average 1.1550387596899225) internal successors, (149), 131 states have internal predecessors, (149), 48 states have call successors, (48), 19 states have call predecessors, (48), 21 states have return successors, (51), 48 states have call predecessors, (51), 47 states have call successors, (51) [2022-07-19 22:09:46,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 248 transitions. [2022-07-19 22:09:46,883 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 248 transitions. Word has length 146 [2022-07-19 22:09:46,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:09:46,884 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 248 transitions. [2022-07-19 22:09:46,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.555555555555555) internal successors, (68), 7 states have internal predecessors, (68), 3 states have call successors, (24), 5 states have call predecessors, (24), 3 states have return successors, (23), 2 states have call predecessors, (23), 3 states have call successors, (23) [2022-07-19 22:09:46,884 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 248 transitions. [2022-07-19 22:09:46,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-07-19 22:09:46,889 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:09:46,890 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:09:46,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-19 22:09:46,890 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:09:46,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:09:46,891 INFO L85 PathProgramCache]: Analyzing trace with hash -133220748, now seen corresponding path program 1 times [2022-07-19 22:09:46,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:09:46,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160600711] [2022-07-19 22:09:46,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:09:46,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:09:47,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:47,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:09:47,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:47,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 22:09:47,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:47,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:09:47,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:47,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 22:09:47,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:47,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 22:09:47,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:47,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:09:47,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:47,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:09:47,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:47,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:09:47,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:47,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 22:09:47,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:47,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 22:09:47,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:47,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:09:47,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:47,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 22:09:47,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:47,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 22:09:47,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:47,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:09:47,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:47,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-19 22:09:47,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:47,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-19 22:09:47,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:47,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-19 22:09:47,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:47,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-19 22:09:47,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:47,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-19 22:09:47,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:47,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-19 22:09:47,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:47,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-19 22:09:47,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:47,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-19 22:09:47,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:47,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-19 22:09:47,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:47,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-19 22:09:47,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:47,506 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2022-07-19 22:09:47,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:09:47,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160600711] [2022-07-19 22:09:47,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160600711] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:09:47,507 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:09:47,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-19 22:09:47,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745391540] [2022-07-19 22:09:47,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:09:47,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-19 22:09:47,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:09:47,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-19 22:09:47,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-07-19 22:09:47,509 INFO L87 Difference]: Start difference. First operand 199 states and 248 transitions. Second operand has 11 states, 10 states have (on average 6.9) internal successors, (69), 7 states have internal predecessors, (69), 3 states have call successors, (25), 5 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2022-07-19 22:09:48,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:09:48,464 INFO L93 Difference]: Finished difference Result 232 states and 287 transitions. [2022-07-19 22:09:48,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-19 22:09:48,465 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.9) internal successors, (69), 7 states have internal predecessors, (69), 3 states have call successors, (25), 5 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 151 [2022-07-19 22:09:48,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:09:48,467 INFO L225 Difference]: With dead ends: 232 [2022-07-19 22:09:48,467 INFO L226 Difference]: Without dead ends: 230 [2022-07-19 22:09:48,468 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2022-07-19 22:09:48,468 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 220 mSDsluCounter, 657 mSDsCounter, 0 mSdLazyCounter, 1008 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 844 SdHoareTripleChecker+Invalid, 1166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 1008 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-19 22:09:48,469 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 844 Invalid, 1166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 1008 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-19 22:09:48,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2022-07-19 22:09:48,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 203. [2022-07-19 22:09:48,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 132 states have (on average 1.1515151515151516) internal successors, (152), 134 states have internal predecessors, (152), 48 states have call successors, (48), 20 states have call predecessors, (48), 22 states have return successors, (51), 48 states have call predecessors, (51), 47 states have call successors, (51) [2022-07-19 22:09:48,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 251 transitions. [2022-07-19 22:09:48,482 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 251 transitions. Word has length 151 [2022-07-19 22:09:48,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:09:48,483 INFO L495 AbstractCegarLoop]: Abstraction has 203 states and 251 transitions. [2022-07-19 22:09:48,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.9) internal successors, (69), 7 states have internal predecessors, (69), 3 states have call successors, (25), 5 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2022-07-19 22:09:48,483 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 251 transitions. [2022-07-19 22:09:48,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-07-19 22:09:48,485 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:09:48,485 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:09:48,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-19 22:09:48,486 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:09:48,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:09:48,486 INFO L85 PathProgramCache]: Analyzing trace with hash -777949396, now seen corresponding path program 1 times [2022-07-19 22:09:48,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:09:48,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716090634] [2022-07-19 22:09:48,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:09:48,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:09:48,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:49,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:09:49,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:49,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 22:09:49,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:49,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:09:49,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:49,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 22:09:49,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:49,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 22:09:49,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:49,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:09:49,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:49,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:09:49,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:49,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:09:49,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:49,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 22:09:49,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:49,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 22:09:49,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:49,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:09:49,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:49,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 22:09:49,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:49,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 22:09:49,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:49,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:09:49,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:49,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-19 22:09:49,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:49,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-19 22:09:49,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:49,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-19 22:09:49,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:49,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-19 22:09:49,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:49,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-19 22:09:49,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:49,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-19 22:09:49,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:49,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-19 22:09:49,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:49,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-19 22:09:49,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:49,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-19 22:09:49,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:49,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-19 22:09:49,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:49,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-19 22:09:49,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:49,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-19 22:09:49,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:49,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-19 22:09:49,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:49,760 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-07-19 22:09:49,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:09:49,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716090634] [2022-07-19 22:09:49,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716090634] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:09:49,760 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:09:49,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-07-19 22:09:49,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007085379] [2022-07-19 22:09:49,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:09:49,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-19 22:09:49,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:09:49,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-19 22:09:49,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2022-07-19 22:09:49,763 INFO L87 Difference]: Start difference. First operand 203 states and 251 transitions. Second operand has 22 states, 21 states have (on average 3.619047619047619) internal successors, (76), 18 states have internal predecessors, (76), 13 states have call successors, (28), 5 states have call predecessors, (28), 4 states have return successors, (27), 14 states have call predecessors, (27), 13 states have call successors, (27) [2022-07-19 22:09:51,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:09:51,988 INFO L93 Difference]: Finished difference Result 259 states and 314 transitions. [2022-07-19 22:09:51,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-19 22:09:51,989 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.619047619047619) internal successors, (76), 18 states have internal predecessors, (76), 13 states have call successors, (28), 5 states have call predecessors, (28), 4 states have return successors, (27), 14 states have call predecessors, (27), 13 states have call successors, (27) Word has length 169 [2022-07-19 22:09:51,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:09:51,991 INFO L225 Difference]: With dead ends: 259 [2022-07-19 22:09:51,991 INFO L226 Difference]: Without dead ends: 233 [2022-07-19 22:09:51,992 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=161, Invalid=1099, Unknown=0, NotChecked=0, Total=1260 [2022-07-19 22:09:51,992 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 370 mSDsluCounter, 813 mSDsCounter, 0 mSdLazyCounter, 2530 mSolverCounterSat, 255 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 971 SdHoareTripleChecker+Invalid, 2785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 255 IncrementalHoareTripleChecker+Valid, 2530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-07-19 22:09:51,993 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 971 Invalid, 2785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [255 Valid, 2530 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-07-19 22:09:51,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2022-07-19 22:09:52,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 203. [2022-07-19 22:09:52,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 132 states have (on average 1.143939393939394) internal successors, (151), 134 states have internal predecessors, (151), 48 states have call successors, (48), 20 states have call predecessors, (48), 22 states have return successors, (51), 48 states have call predecessors, (51), 47 states have call successors, (51) [2022-07-19 22:09:52,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 250 transitions. [2022-07-19 22:09:52,008 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 250 transitions. Word has length 169 [2022-07-19 22:09:52,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:09:52,008 INFO L495 AbstractCegarLoop]: Abstraction has 203 states and 250 transitions. [2022-07-19 22:09:52,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.619047619047619) internal successors, (76), 18 states have internal predecessors, (76), 13 states have call successors, (28), 5 states have call predecessors, (28), 4 states have return successors, (27), 14 states have call predecessors, (27), 13 states have call successors, (27) [2022-07-19 22:09:52,009 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 250 transitions. [2022-07-19 22:09:52,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-07-19 22:09:52,011 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:09:52,011 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 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, 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, 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, 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, 1] [2022-07-19 22:09:52,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-19 22:09:52,011 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:09:52,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:09:52,012 INFO L85 PathProgramCache]: Analyzing trace with hash 442702791, now seen corresponding path program 1 times [2022-07-19 22:09:52,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:09:52,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967989319] [2022-07-19 22:09:52,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:09:52,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:09:52,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:52,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:09:52,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:52,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 22:09:52,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:52,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:09:52,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:52,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 22:09:52,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:52,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 22:09:52,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:52,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:09:52,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:52,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:09:52,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:52,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:09:52,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:52,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 22:09:52,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:52,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 22:09:52,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:52,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:09:52,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:52,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 22:09:52,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:52,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 22:09:52,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:52,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:09:52,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:52,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-19 22:09:52,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:52,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-19 22:09:52,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:52,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-19 22:09:52,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:52,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-19 22:09:52,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:52,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-19 22:09:52,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:52,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-19 22:09:52,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:52,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-19 22:09:52,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:52,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-19 22:09:52,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:52,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-19 22:09:52,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:52,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-19 22:09:52,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:52,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-19 22:09:52,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:52,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-19 22:09:52,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:52,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-19 22:09:52,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:52,408 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2022-07-19 22:09:52,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:09:52,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967989319] [2022-07-19 22:09:52,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967989319] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:09:52,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:09:52,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 22:09:52,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636130984] [2022-07-19 22:09:52,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:09:52,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 22:09:52,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:09:52,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 22:09:52,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-19 22:09:52,411 INFO L87 Difference]: Start difference. First operand 203 states and 250 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (30), 5 states have call predecessors, (30), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2022-07-19 22:09:52,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:09:52,791 INFO L93 Difference]: Finished difference Result 307 states and 371 transitions. [2022-07-19 22:09:52,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 22:09:52,791 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (30), 5 states have call predecessors, (30), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 176 [2022-07-19 22:09:52,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:09:52,793 INFO L225 Difference]: With dead ends: 307 [2022-07-19 22:09:52,793 INFO L226 Difference]: Without dead ends: 221 [2022-07-19 22:09:52,794 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-07-19 22:09:52,794 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 133 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 22:09:52,794 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 469 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-19 22:09:52,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2022-07-19 22:09:52,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 204. [2022-07-19 22:09:52,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 133 states have (on average 1.1428571428571428) internal successors, (152), 135 states have internal predecessors, (152), 48 states have call successors, (48), 20 states have call predecessors, (48), 22 states have return successors, (51), 48 states have call predecessors, (51), 47 states have call successors, (51) [2022-07-19 22:09:52,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 251 transitions. [2022-07-19 22:09:52,809 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 251 transitions. Word has length 176 [2022-07-19 22:09:52,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:09:52,810 INFO L495 AbstractCegarLoop]: Abstraction has 204 states and 251 transitions. [2022-07-19 22:09:52,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (30), 5 states have call predecessors, (30), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2022-07-19 22:09:52,810 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 251 transitions. [2022-07-19 22:09:52,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-07-19 22:09:52,812 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:09:52,813 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 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, 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, 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, 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, 1] [2022-07-19 22:09:52,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-19 22:09:52,813 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:09:52,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:09:52,814 INFO L85 PathProgramCache]: Analyzing trace with hash -578365563, now seen corresponding path program 1 times [2022-07-19 22:09:52,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:09:52,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944186646] [2022-07-19 22:09:52,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:09:52,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:09:52,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:52,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:09:52,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:53,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 22:09:53,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:53,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:09:53,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:53,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 22:09:53,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:53,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 22:09:53,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:53,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:09:53,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:53,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:09:53,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:53,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:09:53,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:53,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 22:09:53,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:53,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 22:09:53,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:53,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:09:53,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:53,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 22:09:53,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:53,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 22:09:53,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:53,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:09:53,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:53,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-19 22:09:53,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:53,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-19 22:09:53,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:53,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-19 22:09:53,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:53,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-19 22:09:53,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:53,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-19 22:09:53,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:53,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-19 22:09:53,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:53,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-19 22:09:53,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:53,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-19 22:09:53,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:53,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-19 22:09:53,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:53,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-19 22:09:53,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:53,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-19 22:09:53,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:53,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-19 22:09:53,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:53,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-19 22:09:53,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:53,228 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2022-07-19 22:09:53,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:09:53,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944186646] [2022-07-19 22:09:53,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944186646] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:09:53,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:09:53,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-19 22:09:53,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440666100] [2022-07-19 22:09:53,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:09:53,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 22:09:53,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:09:53,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 22:09:53,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-19 22:09:53,231 INFO L87 Difference]: Start difference. First operand 204 states and 251 transitions. Second operand has 8 states, 8 states have (on average 9.375) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (30), 5 states have call predecessors, (30), 1 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) [2022-07-19 22:09:53,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:09:53,881 INFO L93 Difference]: Finished difference Result 331 states and 405 transitions. [2022-07-19 22:09:53,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 22:09:53,881 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (30), 5 states have call predecessors, (30), 1 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) Word has length 176 [2022-07-19 22:09:53,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:09:53,883 INFO L225 Difference]: With dead ends: 331 [2022-07-19 22:09:53,883 INFO L226 Difference]: Without dead ends: 221 [2022-07-19 22:09:53,884 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-07-19 22:09:53,884 INFO L413 NwaCegarLoop]: 202 mSDtfsCounter, 93 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 642 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-19 22:09:53,884 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 652 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 642 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-19 22:09:53,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2022-07-19 22:09:53,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 204. [2022-07-19 22:09:53,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 133 states have (on average 1.1353383458646618) internal successors, (151), 135 states have internal predecessors, (151), 48 states have call successors, (48), 20 states have call predecessors, (48), 22 states have return successors, (51), 48 states have call predecessors, (51), 47 states have call successors, (51) [2022-07-19 22:09:53,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 250 transitions. [2022-07-19 22:09:53,903 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 250 transitions. Word has length 176 [2022-07-19 22:09:53,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:09:53,907 INFO L495 AbstractCegarLoop]: Abstraction has 204 states and 250 transitions. [2022-07-19 22:09:53,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (30), 5 states have call predecessors, (30), 1 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) [2022-07-19 22:09:53,908 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 250 transitions. [2022-07-19 22:09:53,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2022-07-19 22:09:53,911 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:09:53,911 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 3, 3, 3, 3, 3, 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, 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, 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, 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] [2022-07-19 22:09:53,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-19 22:09:53,912 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:09:53,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:09:53,915 INFO L85 PathProgramCache]: Analyzing trace with hash -361857032, now seen corresponding path program 1 times [2022-07-19 22:09:53,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:09:53,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123907621] [2022-07-19 22:09:53,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:09:53,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:09:54,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:54,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:09:54,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:54,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 22:09:54,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:54,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:09:54,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:54,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 22:09:54,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:54,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 22:09:54,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:54,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:09:54,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:54,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:09:54,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:54,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:09:54,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:54,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 22:09:54,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:54,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 22:09:54,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:54,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:09:54,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:54,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 22:09:54,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:54,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 22:09:54,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:54,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:09:54,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:54,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-19 22:09:54,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:54,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-19 22:09:54,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:54,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-19 22:09:54,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:54,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-19 22:09:54,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:54,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-19 22:09:54,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:54,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-19 22:09:54,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:54,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-19 22:09:54,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:54,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-19 22:09:54,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:54,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-19 22:09:54,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:54,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-19 22:09:54,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:54,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-19 22:09:54,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:54,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-19 22:09:54,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:54,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-19 22:09:54,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:54,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-19 22:09:54,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:54,473 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2022-07-19 22:09:54,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:09:54,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123907621] [2022-07-19 22:09:54,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123907621] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:09:54,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1011944599] [2022-07-19 22:09:54,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:09:54,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:09:54,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:09:54,480 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 22:09:54,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-19 22:09:54,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:54,994 INFO L263 TraceCheckSpWp]: Trace formula consists of 2530 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-19 22:09:55,001 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:09:55,272 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 101 proven. 3 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-07-19 22:09:55,273 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 22:09:55,665 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 36 proven. 3 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2022-07-19 22:09:55,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1011944599] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 22:09:55,665 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 22:09:55,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 9] total 24 [2022-07-19 22:09:55,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135284886] [2022-07-19 22:09:55,666 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 22:09:55,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-19 22:09:55,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:09:55,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-19 22:09:55,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=498, Unknown=0, NotChecked=0, Total=552 [2022-07-19 22:09:55,668 INFO L87 Difference]: Start difference. First operand 204 states and 250 transitions. Second operand has 24 states, 20 states have (on average 6.45) internal successors, (129), 18 states have internal predecessors, (129), 7 states have call successors, (60), 6 states have call predecessors, (60), 6 states have return successors, (52), 5 states have call predecessors, (52), 7 states have call successors, (52) [2022-07-19 22:09:57,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:09:57,605 INFO L93 Difference]: Finished difference Result 342 states and 420 transitions. [2022-07-19 22:09:57,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-19 22:09:57,606 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 20 states have (on average 6.45) internal successors, (129), 18 states have internal predecessors, (129), 7 states have call successors, (60), 6 states have call predecessors, (60), 6 states have return successors, (52), 5 states have call predecessors, (52), 7 states have call successors, (52) Word has length 185 [2022-07-19 22:09:57,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:09:57,608 INFO L225 Difference]: With dead ends: 342 [2022-07-19 22:09:57,608 INFO L226 Difference]: Without dead ends: 230 [2022-07-19 22:09:57,609 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 415 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=290, Invalid=1690, Unknown=0, NotChecked=0, Total=1980 [2022-07-19 22:09:57,610 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 504 mSDsluCounter, 1266 mSDsCounter, 0 mSdLazyCounter, 2193 mSolverCounterSat, 385 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 1417 SdHoareTripleChecker+Invalid, 2578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 385 IncrementalHoareTripleChecker+Valid, 2193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-19 22:09:57,610 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 1417 Invalid, 2578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [385 Valid, 2193 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-07-19 22:09:57,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2022-07-19 22:09:57,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 210. [2022-07-19 22:09:57,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 137 states have (on average 1.1313868613138687) internal successors, (155), 141 states have internal predecessors, (155), 48 states have call successors, (48), 20 states have call predecessors, (48), 24 states have return successors, (54), 48 states have call predecessors, (54), 47 states have call successors, (54) [2022-07-19 22:09:57,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 257 transitions. [2022-07-19 22:09:57,627 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 257 transitions. Word has length 185 [2022-07-19 22:09:57,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:09:57,628 INFO L495 AbstractCegarLoop]: Abstraction has 210 states and 257 transitions. [2022-07-19 22:09:57,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 20 states have (on average 6.45) internal successors, (129), 18 states have internal predecessors, (129), 7 states have call successors, (60), 6 states have call predecessors, (60), 6 states have return successors, (52), 5 states have call predecessors, (52), 7 states have call successors, (52) [2022-07-19 22:09:57,629 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 257 transitions. [2022-07-19 22:09:57,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2022-07-19 22:09:57,630 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:09:57,631 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 3, 3, 3, 3, 3, 3, 2, 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, 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, 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, 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] [2022-07-19 22:09:57,668 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-19 22:09:57,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:09:57,856 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:09:57,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:09:57,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1707074820, now seen corresponding path program 1 times [2022-07-19 22:09:57,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:09:57,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809625129] [2022-07-19 22:09:57,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:09:57,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:09:57,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:58,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:09:58,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:58,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 22:09:58,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:58,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:09:58,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:58,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 22:09:58,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:58,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 22:09:58,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:58,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:09:58,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:58,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:09:58,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:58,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:09:58,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:58,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 22:09:58,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:58,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 22:09:58,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:58,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:09:58,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:58,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 22:09:58,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:58,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 22:09:58,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:58,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:09:58,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:58,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-19 22:09:58,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:58,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-19 22:09:58,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:58,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-19 22:09:58,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:58,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-19 22:09:58,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:58,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-19 22:09:58,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:58,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-19 22:09:58,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:58,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-19 22:09:58,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:58,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-19 22:09:58,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:58,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-19 22:09:58,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:58,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-19 22:09:58,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:58,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-19 22:09:58,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:58,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-19 22:09:58,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:58,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 22:09:58,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:58,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:09:58,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:58,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-19 22:09:58,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:58,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-07-19 22:09:58,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:58,627 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2022-07-19 22:09:58,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:09:58,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809625129] [2022-07-19 22:09:58,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809625129] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:09:58,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [134789326] [2022-07-19 22:09:58,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:09:58,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:09:58,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:09:58,630 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 22:09:58,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-19 22:09:59,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:09:59,158 INFO L263 TraceCheckSpWp]: Trace formula consists of 2579 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-19 22:09:59,163 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:09:59,342 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2022-07-19 22:09:59,343 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 22:09:59,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [134789326] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:09:59,343 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 22:09:59,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [13] total 18 [2022-07-19 22:09:59,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826083877] [2022-07-19 22:09:59,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:09:59,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 22:09:59,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:09:59,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 22:09:59,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2022-07-19 22:09:59,346 INFO L87 Difference]: Start difference. First operand 210 states and 257 transitions. Second operand has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 7 states have internal predecessors, (97), 4 states have call successors, (33), 2 states have call predecessors, (33), 3 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) [2022-07-19 22:09:59,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:09:59,597 INFO L93 Difference]: Finished difference Result 327 states and 397 transitions. [2022-07-19 22:09:59,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 22:09:59,598 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 7 states have internal predecessors, (97), 4 states have call successors, (33), 2 states have call predecessors, (33), 3 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) Word has length 196 [2022-07-19 22:09:59,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:09:59,600 INFO L225 Difference]: With dead ends: 327 [2022-07-19 22:09:59,600 INFO L226 Difference]: Without dead ends: 210 [2022-07-19 22:09:59,600 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2022-07-19 22:09:59,601 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 275 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 656 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 22:09:59,601 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 656 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 22:09:59,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2022-07-19 22:09:59,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 207. [2022-07-19 22:09:59,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 135 states have (on average 1.1333333333333333) internal successors, (153), 138 states have internal predecessors, (153), 48 states have call successors, (48), 20 states have call predecessors, (48), 23 states have return successors, (51), 48 states have call predecessors, (51), 47 states have call successors, (51) [2022-07-19 22:09:59,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 252 transitions. [2022-07-19 22:09:59,619 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 252 transitions. Word has length 196 [2022-07-19 22:09:59,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:09:59,619 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 252 transitions. [2022-07-19 22:09:59,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 7 states have internal predecessors, (97), 4 states have call successors, (33), 2 states have call predecessors, (33), 3 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) [2022-07-19 22:09:59,620 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 252 transitions. [2022-07-19 22:09:59,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2022-07-19 22:09:59,621 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:09:59,622 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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, 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] [2022-07-19 22:09:59,654 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-19 22:09:59,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:09:59,847 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:09:59,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:09:59,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1755111832, now seen corresponding path program 1 times [2022-07-19 22:09:59,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:09:59,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768292031] [2022-07-19 22:09:59,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:09:59,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:10:00,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:00,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:10:00,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:00,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 22:10:00,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:00,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:10:00,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:00,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 22:10:00,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:00,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 22:10:00,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:00,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:10:00,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:00,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:10:00,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:00,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:10:00,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:00,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 22:10:00,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:00,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 22:10:00,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:00,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:10:00,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:00,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 22:10:00,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:00,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 22:10:00,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:00,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:10:00,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:00,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-19 22:10:00,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:00,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-19 22:10:00,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:00,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-19 22:10:00,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:00,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-19 22:10:00,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:00,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-19 22:10:00,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:00,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-19 22:10:00,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:00,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-19 22:10:00,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:00,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-19 22:10:00,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:00,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-19 22:10:00,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:00,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-19 22:10:00,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:00,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 22:10:00,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:00,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:10:00,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:00,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-19 22:10:00,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:00,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-19 22:10:00,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:00,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 22:10:00,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:00,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:10:00,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:00,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-07-19 22:10:00,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:00,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2022-07-19 22:10:00,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:00,464 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 333 trivial. 0 not checked. [2022-07-19 22:10:00,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:10:00,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768292031] [2022-07-19 22:10:00,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768292031] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:10:00,465 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:10:00,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-19 22:10:00,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424479591] [2022-07-19 22:10:00,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:10:00,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-19 22:10:00,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:10:00,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-19 22:10:00,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-07-19 22:10:00,467 INFO L87 Difference]: Start difference. First operand 207 states and 252 transitions. Second operand has 11 states, 9 states have (on average 8.333333333333334) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (31), 7 states have call predecessors, (31), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2022-07-19 22:10:01,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:10:01,296 INFO L93 Difference]: Finished difference Result 230 states and 278 transitions. [2022-07-19 22:10:01,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-19 22:10:01,296 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 8.333333333333334) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (31), 7 states have call predecessors, (31), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 207 [2022-07-19 22:10:01,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:10:01,298 INFO L225 Difference]: With dead ends: 230 [2022-07-19 22:10:01,298 INFO L226 Difference]: Without dead ends: 228 [2022-07-19 22:10:01,299 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2022-07-19 22:10:01,299 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 122 mSDsluCounter, 901 mSDsCounter, 0 mSdLazyCounter, 872 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 1106 SdHoareTripleChecker+Invalid, 950 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 872 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-19 22:10:01,299 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 1106 Invalid, 950 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 872 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-19 22:10:01,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2022-07-19 22:10:01,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 211. [2022-07-19 22:10:01,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 138 states have (on average 1.1304347826086956) internal successors, (156), 141 states have internal predecessors, (156), 48 states have call successors, (48), 21 states have call predecessors, (48), 24 states have return successors, (51), 48 states have call predecessors, (51), 47 states have call successors, (51) [2022-07-19 22:10:01,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 255 transitions. [2022-07-19 22:10:01,314 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 255 transitions. Word has length 207 [2022-07-19 22:10:01,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:10:01,316 INFO L495 AbstractCegarLoop]: Abstraction has 211 states and 255 transitions. [2022-07-19 22:10:01,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 8.333333333333334) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (31), 7 states have call predecessors, (31), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2022-07-19 22:10:01,317 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 255 transitions. [2022-07-19 22:10:01,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2022-07-19 22:10:01,319 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:10:01,319 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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, 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, 1, 1, 1, 1, 1, 1] [2022-07-19 22:10:01,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-19 22:10:01,320 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:10:01,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:10:01,320 INFO L85 PathProgramCache]: Analyzing trace with hash 2124808202, now seen corresponding path program 1 times [2022-07-19 22:10:01,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:10:01,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050500953] [2022-07-19 22:10:01,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:10:01,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:10:01,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:02,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:10:02,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:02,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 22:10:02,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:02,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:10:02,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:02,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 22:10:02,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:02,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 22:10:02,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:02,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:10:02,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:02,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:10:02,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:02,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:10:02,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:02,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 22:10:02,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:02,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 22:10:02,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:02,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:10:02,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:02,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 22:10:02,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:02,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 22:10:02,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:02,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:10:02,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:02,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-19 22:10:02,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:02,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-19 22:10:02,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:02,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-19 22:10:02,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:02,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-19 22:10:02,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:02,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-19 22:10:02,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:02,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-19 22:10:02,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:02,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-19 22:10:02,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:02,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-19 22:10:02,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:02,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-19 22:10:02,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:02,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-19 22:10:02,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:02,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 22:10:02,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:02,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:10:02,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:02,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-19 22:10:02,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:02,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-19 22:10:02,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:02,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 22:10:02,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:02,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:10:02,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:02,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-07-19 22:10:02,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:02,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2022-07-19 22:10:02,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:02,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2022-07-19 22:10:02,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:02,524 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2022-07-19 22:10:02,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:10:02,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050500953] [2022-07-19 22:10:02,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050500953] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:10:02,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [320327101] [2022-07-19 22:10:02,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:10:02,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:10:02,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:10:02,526 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 22:10:02,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-19 22:10:03,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:03,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 2651 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-19 22:10:03,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:10:03,211 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2022-07-19 22:10:03,213 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 22:10:03,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [320327101] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:10:03,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 22:10:03,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 13 [2022-07-19 22:10:03,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075467803] [2022-07-19 22:10:03,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:10:03,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 22:10:03,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:10:03,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 22:10:03,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2022-07-19 22:10:03,218 INFO L87 Difference]: Start difference. First operand 211 states and 255 transitions. Second operand has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 4 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (29), 4 states have call predecessors, (29), 4 states have call successors, (29) [2022-07-19 22:10:03,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:10:03,524 INFO L93 Difference]: Finished difference Result 375 states and 454 transitions. [2022-07-19 22:10:03,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-19 22:10:03,525 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 4 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (29), 4 states have call predecessors, (29), 4 states have call successors, (29) Word has length 213 [2022-07-19 22:10:03,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:10:03,526 INFO L225 Difference]: With dead ends: 375 [2022-07-19 22:10:03,526 INFO L226 Difference]: Without dead ends: 211 [2022-07-19 22:10:03,527 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2022-07-19 22:10:03,528 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 241 mSDsluCounter, 680 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 861 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 22:10:03,528 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 861 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 22:10:03,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2022-07-19 22:10:03,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 206. [2022-07-19 22:10:03,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 134 states have (on average 1.1194029850746268) internal successors, (150), 137 states have internal predecessors, (150), 48 states have call successors, (48), 21 states have call predecessors, (48), 23 states have return successors, (50), 47 states have call predecessors, (50), 47 states have call successors, (50) [2022-07-19 22:10:03,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 248 transitions. [2022-07-19 22:10:03,546 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 248 transitions. Word has length 213 [2022-07-19 22:10:03,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:10:03,546 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 248 transitions. [2022-07-19 22:10:03,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 4 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (29), 4 states have call predecessors, (29), 4 states have call successors, (29) [2022-07-19 22:10:03,547 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 248 transitions. [2022-07-19 22:10:03,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2022-07-19 22:10:03,549 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:10:03,549 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:10:03,580 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-19 22:10:03,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-19 22:10:03,776 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:10:03,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:10:03,776 INFO L85 PathProgramCache]: Analyzing trace with hash -2025906859, now seen corresponding path program 1 times [2022-07-19 22:10:03,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:10:03,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934931767] [2022-07-19 22:10:03,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:10:03,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:10:03,853 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-19 22:10:03,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [830343414] [2022-07-19 22:10:03,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:10:03,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:10:03,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:10:03,855 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 22:10:03,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-19 22:12:17,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:17,654 INFO L263 TraceCheckSpWp]: Trace formula consists of 2756 conjuncts, 403 conjunts are in the unsatisfiable core [2022-07-19 22:12:17,670 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:12:17,704 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-19 22:12:18,034 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-19 22:12:18,034 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-19 22:12:18,090 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-19 22:12:18,236 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-19 22:12:18,377 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-07-19 22:12:18,548 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-19 22:12:18,866 INFO L356 Elim1Store]: treesize reduction 183, result has 22.1 percent of original size [2022-07-19 22:12:18,867 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 120 treesize of output 149 [2022-07-19 22:12:22,486 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-19 22:12:23,154 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 148 proven. 15 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2022-07-19 22:12:23,155 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 22:12:23,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:12:23,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934931767] [2022-07-19 22:12:23,526 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-19 22:12:23,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [830343414] [2022-07-19 22:12:23,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [830343414] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:12:23,526 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-07-19 22:12:23,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2022-07-19 22:12:23,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084164516] [2022-07-19 22:12:23,527 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-07-19 22:12:23,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-07-19 22:12:23,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:12:23,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-07-19 22:12:23,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1210, Unknown=1, NotChecked=0, Total=1332 [2022-07-19 22:12:23,531 INFO L87 Difference]: Start difference. First operand 206 states and 248 transitions. Second operand has 34 states, 27 states have (on average 3.6296296296296298) internal successors, (98), 25 states have internal predecessors, (98), 11 states have call successors, (33), 6 states have call predecessors, (33), 10 states have return successors, (30), 10 states have call predecessors, (30), 11 states have call successors, (30) [2022-07-19 22:12:24,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:12:24,197 INFO L93 Difference]: Finished difference Result 409 states and 485 transitions. [2022-07-19 22:12:24,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-07-19 22:12:24,198 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 27 states have (on average 3.6296296296296298) internal successors, (98), 25 states have internal predecessors, (98), 11 states have call successors, (33), 6 states have call predecessors, (33), 10 states have return successors, (30), 10 states have call predecessors, (30), 11 states have call successors, (30) Word has length 219 [2022-07-19 22:12:24,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:12:24,199 INFO L225 Difference]: With dead ends: 409 [2022-07-19 22:12:24,199 INFO L226 Difference]: Without dead ends: 232 [2022-07-19 22:12:24,201 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 287 SyntacticMatches, 5 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=134, Invalid=1347, Unknown=1, NotChecked=0, Total=1482 [2022-07-19 22:12:24,201 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 23 mSDsluCounter, 1735 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 1945 SdHoareTripleChecker+Invalid, 2132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1663 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-19 22:12:24,201 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 1945 Invalid, 2132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 409 Invalid, 0 Unknown, 1663 Unchecked, 0.5s Time] [2022-07-19 22:12:24,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2022-07-19 22:12:24,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 225. [2022-07-19 22:12:24,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 147 states have (on average 1.1088435374149659) internal successors, (163), 150 states have internal predecessors, (163), 50 states have call successors, (50), 25 states have call predecessors, (50), 27 states have return successors, (53), 49 states have call predecessors, (53), 49 states have call successors, (53) [2022-07-19 22:12:24,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 266 transitions. [2022-07-19 22:12:24,217 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 266 transitions. Word has length 219 [2022-07-19 22:12:24,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:12:24,217 INFO L495 AbstractCegarLoop]: Abstraction has 225 states and 266 transitions. [2022-07-19 22:12:24,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 27 states have (on average 3.6296296296296298) internal successors, (98), 25 states have internal predecessors, (98), 11 states have call successors, (33), 6 states have call predecessors, (33), 10 states have return successors, (30), 10 states have call predecessors, (30), 11 states have call successors, (30) [2022-07-19 22:12:24,218 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 266 transitions. [2022-07-19 22:12:24,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2022-07-19 22:12:24,220 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:12:24,220 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:12:24,309 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-19 22:12:24,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:12:24,432 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:12:24,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:12:24,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1719785267, now seen corresponding path program 1 times [2022-07-19 22:12:24,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:12:24,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013399940] [2022-07-19 22:12:24,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:12:24,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:12:24,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:24,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:12:24,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:24,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 22:12:24,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:24,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:12:24,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:24,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 22:12:24,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:24,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 22:12:24,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:24,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:12:24,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:24,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:12:24,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:24,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:12:24,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:24,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-19 22:12:24,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:24,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:12:24,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:24,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-19 22:12:24,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:24,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 22:12:24,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:24,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:12:24,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:24,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-19 22:12:24,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:24,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 22:12:24,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:24,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:12:24,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:24,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-19 22:12:24,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:24,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-19 22:12:24,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:24,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-19 22:12:24,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:24,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-19 22:12:24,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:24,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-19 22:12:24,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:24,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-19 22:12:24,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:24,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-19 22:12:24,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:24,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-19 22:12:24,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:24,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-19 22:12:24,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:24,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-19 22:12:24,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:24,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 22:12:24,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:24,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:12:24,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:24,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-19 22:12:24,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:24,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-07-19 22:12:24,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:24,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 22:12:24,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:24,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:12:24,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:24,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-07-19 22:12:24,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:24,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2022-07-19 22:12:24,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:24,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2022-07-19 22:12:24,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:24,983 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 333 trivial. 0 not checked. [2022-07-19 22:12:24,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:12:24,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013399940] [2022-07-19 22:12:24,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013399940] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:12:24,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:12:24,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-19 22:12:24,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860598639] [2022-07-19 22:12:24,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:12:24,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-19 22:12:24,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:12:24,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-19 22:12:24,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-19 22:12:24,987 INFO L87 Difference]: Start difference. First operand 225 states and 266 transitions. Second operand has 10 states, 10 states have (on average 8.7) internal successors, (87), 6 states have internal predecessors, (87), 2 states have call successors, (34), 5 states have call predecessors, (34), 4 states have return successors, (31), 4 states have call predecessors, (31), 2 states have call successors, (31) [2022-07-19 22:12:25,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:12:25,660 INFO L93 Difference]: Finished difference Result 412 states and 487 transitions. [2022-07-19 22:12:25,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-19 22:12:25,661 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 6 states have internal predecessors, (87), 2 states have call successors, (34), 5 states have call predecessors, (34), 4 states have return successors, (31), 4 states have call predecessors, (31), 2 states have call successors, (31) Word has length 225 [2022-07-19 22:12:25,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:12:25,662 INFO L225 Difference]: With dead ends: 412 [2022-07-19 22:12:25,662 INFO L226 Difference]: Without dead ends: 223 [2022-07-19 22:12:25,663 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-07-19 22:12:25,663 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 79 mSDsluCounter, 738 mSDsCounter, 0 mSdLazyCounter, 794 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 943 SdHoareTripleChecker+Invalid, 856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 794 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-19 22:12:25,663 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 943 Invalid, 856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 794 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-19 22:12:25,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2022-07-19 22:12:25,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 214. [2022-07-19 22:12:25,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 140 states have (on average 1.1) internal successors, (154), 143 states have internal predecessors, (154), 47 states have call successors, (47), 24 states have call predecessors, (47), 26 states have return successors, (49), 46 states have call predecessors, (49), 46 states have call successors, (49) [2022-07-19 22:12:25,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 250 transitions. [2022-07-19 22:12:25,685 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 250 transitions. Word has length 225 [2022-07-19 22:12:25,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:12:25,685 INFO L495 AbstractCegarLoop]: Abstraction has 214 states and 250 transitions. [2022-07-19 22:12:25,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 6 states have internal predecessors, (87), 2 states have call successors, (34), 5 states have call predecessors, (34), 4 states have return successors, (31), 4 states have call predecessors, (31), 2 states have call successors, (31) [2022-07-19 22:12:25,686 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 250 transitions. [2022-07-19 22:12:25,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2022-07-19 22:12:25,688 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:12:25,688 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:12:25,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-19 22:12:25,688 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:12:25,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:12:25,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1638507119, now seen corresponding path program 1 times [2022-07-19 22:12:25,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:12:25,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462135878] [2022-07-19 22:12:25,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:12:25,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:12:25,745 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-19 22:12:25,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1779647060] [2022-07-19 22:12:25,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:12:25,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:12:25,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:12:25,748 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 22:12:25,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-19 22:12:26,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:12:26,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 2760 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-19 22:12:26,307 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:12:26,344 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2022-07-19 22:12:26,344 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 22:12:26,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:12:26,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462135878] [2022-07-19 22:12:26,344 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-19 22:12:26,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1779647060] [2022-07-19 22:12:26,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1779647060] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:12:26,345 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:12:26,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 22:12:26,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196169615] [2022-07-19 22:12:26,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:12:26,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 22:12:26,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:12:26,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 22:12:26,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-19 22:12:26,347 INFO L87 Difference]: Start difference. First operand 214 states and 250 transitions. Second operand has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 6 states have internal predecessors, (93), 2 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (31), 4 states have call predecessors, (31), 2 states have call successors, (31) [2022-07-19 22:12:26,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:12:26,368 INFO L93 Difference]: Finished difference Result 214 states and 250 transitions. [2022-07-19 22:12:26,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 22:12:26,369 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 6 states have internal predecessors, (93), 2 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (31), 4 states have call predecessors, (31), 2 states have call successors, (31) Word has length 225 [2022-07-19 22:12:26,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:12:26,369 INFO L225 Difference]: With dead ends: 214 [2022-07-19 22:12:26,369 INFO L226 Difference]: Without dead ends: 0 [2022-07-19 22:12:26,370 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-19 22:12:26,370 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 2 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 22:12:26,371 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 272 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 22:12:26,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-19 22:12:26,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-19 22:12:26,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 22:12:26,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-19 22:12:26,371 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 225 [2022-07-19 22:12:26,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:12:26,372 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-19 22:12:26,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 6 states have internal predecessors, (93), 2 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (31), 4 states have call predecessors, (31), 2 states have call successors, (31) [2022-07-19 22:12:26,372 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-19 22:12:26,372 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-19 22:12:26,374 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-19 22:12:26,406 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-19 22:12:26,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:12:26,601 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-19 22:12:27,486 INFO L899 garLoopResultBuilder]: For program point L6944-1(lines 6944 6946) no Hoare annotation was computed. [2022-07-19 22:12:27,486 INFO L895 garLoopResultBuilder]: At program point L6944(lines 6944 6946) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (= |bounded_malloc_#in~size| bounded_malloc_~size) (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) (forall ((|aux_div_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_5_104| Int) (|aux_mod_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_5_104| Int) (|v_ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base_BEFORE_CALL_3| Int)) (or (not (<= 0 |aux_mod_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_5_104|)) (not (= (+ (* |aux_div_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_5_104| 442721857769029238784) (* |aux_mod_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_5_104| 24)) (+ 29629528 (select (select |#memory_int| |v_ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base_BEFORE_CALL_3|) 0)))) (not (<= |aux_mod_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_5_104| 8))))) [2022-07-19 22:12:27,486 INFO L895 garLoopResultBuilder]: At program point bounded_mallocENTRY(lines 6943 6948) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) (forall ((|aux_div_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_5_104| Int) (|aux_mod_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_5_104| Int) (|v_ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base_BEFORE_CALL_3| Int)) (or (not (<= 0 |aux_mod_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_5_104|)) (not (= (+ (* |aux_div_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_5_104| 442721857769029238784) (* |aux_mod_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_5_104| 24)) (+ 29629528 (select (select |#memory_int| |v_ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base_BEFORE_CALL_3|) 0)))) (not (<= |aux_mod_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_5_104| 8))))) [2022-07-19 22:12:27,487 INFO L899 garLoopResultBuilder]: For program point bounded_mallocFINAL(lines 6943 6948) no Hoare annotation was computed. [2022-07-19 22:12:27,487 INFO L899 garLoopResultBuilder]: For program point bounded_mallocEXIT(lines 6943 6948) no Hoare annotation was computed. [2022-07-19 22:12:27,487 INFO L902 garLoopResultBuilder]: At program point L10017-4(line 10017) the Hoare annotation is: true [2022-07-19 22:12:27,487 INFO L899 garLoopResultBuilder]: For program point L10017-5(line 10017) no Hoare annotation was computed. [2022-07-19 22:12:27,487 INFO L899 garLoopResultBuilder]: For program point L10017-7(line 10017) no Hoare annotation was computed. [2022-07-19 22:12:27,487 INFO L899 garLoopResultBuilder]: For program point L10017(line 10017) no Hoare annotation was computed. [2022-07-19 22:12:27,487 INFO L899 garLoopResultBuilder]: For program point L10017-2(line 10017) no Hoare annotation was computed. [2022-07-19 22:12:27,487 INFO L899 garLoopResultBuilder]: For program point L10017-3(line 10017) no Hoare annotation was computed. [2022-07-19 22:12:27,487 INFO L902 garLoopResultBuilder]: At program point aws_hash_table_is_validENTRY(lines 10015 10018) the Hoare annotation is: true [2022-07-19 22:12:27,487 INFO L899 garLoopResultBuilder]: For program point aws_hash_table_is_validEXIT(lines 10015 10018) no Hoare annotation was computed. [2022-07-19 22:12:27,487 INFO L899 garLoopResultBuilder]: For program point aws_hash_table_is_validFINAL(lines 10015 10018) no Hoare annotation was computed. [2022-07-19 22:12:27,487 INFO L899 garLoopResultBuilder]: For program point nondet_boolFINAL(line 261) no Hoare annotation was computed. [2022-07-19 22:12:27,487 INFO L899 garLoopResultBuilder]: For program point nondet_boolEXIT(line 261) no Hoare annotation was computed. [2022-07-19 22:12:27,488 INFO L902 garLoopResultBuilder]: At program point nondet_boolENTRY(line 261) the Hoare annotation is: true [2022-07-19 22:12:27,488 INFO L899 garLoopResultBuilder]: For program point L7130(lines 7130 7134) no Hoare annotation was computed. [2022-07-19 22:12:27,488 INFO L899 garLoopResultBuilder]: For program point aws_mem_releaseEXIT(lines 7122 7135) no Hoare annotation was computed. [2022-07-19 22:12:27,488 INFO L902 garLoopResultBuilder]: At program point L7126(lines 7126 7128) the Hoare annotation is: true [2022-07-19 22:12:27,488 INFO L902 garLoopResultBuilder]: At program point aws_mem_releaseENTRY(lines 7122 7135) the Hoare annotation is: true [2022-07-19 22:12:27,488 INFO L899 garLoopResultBuilder]: For program point L7130-2(lines 7122 7135) no Hoare annotation was computed. [2022-07-19 22:12:27,488 INFO L899 garLoopResultBuilder]: For program point L7123-1(lines 7123 7125) no Hoare annotation was computed. [2022-07-19 22:12:27,488 INFO L902 garLoopResultBuilder]: At program point L7123(lines 7123 7125) the Hoare annotation is: true [2022-07-19 22:12:27,488 INFO L899 garLoopResultBuilder]: For program point L7126-1(lines 7126 7128) no Hoare annotation was computed. [2022-07-19 22:12:27,488 INFO L895 garLoopResultBuilder]: At program point hash_table_state_required_bytesENTRY(lines 10128 10140) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |old(#valid)| |#valid|))) [2022-07-19 22:12:27,488 INFO L899 garLoopResultBuilder]: For program point L10135-2(lines 10135 10137) no Hoare annotation was computed. [2022-07-19 22:12:27,488 INFO L895 garLoopResultBuilder]: At program point L10131(line 10131) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (= (store |old(#valid)| |hash_table_state_required_bytes_~#elemsize~0.base| 1) |#valid|) (= hash_table_state_required_bytes_~required_bytes.offset |hash_table_state_required_bytes_#in~required_bytes.offset|) (= (select |old(#valid)| |hash_table_state_required_bytes_~#elemsize~0.base|) 0) (= hash_table_state_required_bytes_~size |hash_table_state_required_bytes_#in~size|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= hash_table_state_required_bytes_~required_bytes.base |hash_table_state_required_bytes_#in~required_bytes.base|) (= |hash_table_state_required_bytes_~#elemsize~0.offset| 0))) [2022-07-19 22:12:27,488 INFO L899 garLoopResultBuilder]: For program point L10131-1(line 10131) no Hoare annotation was computed. [2022-07-19 22:12:27,489 INFO L895 garLoopResultBuilder]: At program point L10135(line 10135) the Hoare annotation is: (or (and (= hash_table_state_required_bytes_~required_bytes.offset |hash_table_state_required_bytes_#in~required_bytes.offset|) (= (select |old(#valid)| |hash_table_state_required_bytes_~#elemsize~0.base|) 0) (= (store |old(#valid)| |hash_table_state_required_bytes_~#elemsize~0.base| (select |#valid| |hash_table_state_required_bytes_~#elemsize~0.base|)) |#valid|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= (* |hash_table_state_required_bytes_#in~size| 24) |hash_table_state_required_bytes_#t~mem1325|) (= hash_table_state_required_bytes_~required_bytes.base |hash_table_state_required_bytes_#in~required_bytes.base|) (exists ((v_ArrVal_1486 Int) (|v___CPROVER_overflow_mult_~#c~1.base_67| Int)) (let ((.cse0 (store |old(#valid)| |hash_table_state_required_bytes_~#elemsize~0.base| 1))) (and (= (store .cse0 |v___CPROVER_overflow_mult_~#c~1.base_67| v_ArrVal_1486) |#valid|) (= (select .cse0 |v___CPROVER_overflow_mult_~#c~1.base_67|) 0))))) (not (< 0 |#StackHeapBarrier|))) [2022-07-19 22:12:27,489 INFO L899 garLoopResultBuilder]: For program point hash_table_state_required_bytesEXIT(lines 10128 10140) no Hoare annotation was computed. [2022-07-19 22:12:27,489 INFO L899 garLoopResultBuilder]: For program point L10135-1(line 10135) no Hoare annotation was computed. [2022-07-19 22:12:27,489 INFO L899 garLoopResultBuilder]: For program point L10131-2(lines 10131 10133) no Hoare annotation was computed. [2022-07-19 22:12:27,489 INFO L899 garLoopResultBuilder]: For program point hash_table_state_required_bytesFINAL(lines 10128 10140) no Hoare annotation was computed. [2022-07-19 22:12:27,489 INFO L902 garLoopResultBuilder]: At program point memset_override_0_implENTRY(lines 7397 7412) the Hoare annotation is: true [2022-07-19 22:12:27,489 INFO L899 garLoopResultBuilder]: For program point memset_override_0_implFINAL(lines 7397 7412) no Hoare annotation was computed. [2022-07-19 22:12:27,489 INFO L899 garLoopResultBuilder]: For program point L7403-1(line 7403) no Hoare annotation was computed. [2022-07-19 22:12:27,489 INFO L902 garLoopResultBuilder]: At program point L7403(line 7403) the Hoare annotation is: true [2022-07-19 22:12:27,489 INFO L899 garLoopResultBuilder]: For program point L7407-4(lines 7407 7409) no Hoare annotation was computed. [2022-07-19 22:12:27,489 INFO L902 garLoopResultBuilder]: At program point L7407-3(lines 7407 7409) the Hoare annotation is: true [2022-07-19 22:12:27,489 INFO L899 garLoopResultBuilder]: For program point L7407-2(lines 7407 7409) no Hoare annotation was computed. [2022-07-19 22:12:27,490 INFO L899 garLoopResultBuilder]: For program point memset_override_0_implEXIT(lines 7397 7412) no Hoare annotation was computed. [2022-07-19 22:12:27,490 INFO L902 garLoopResultBuilder]: At program point L7398(line 7398) the Hoare annotation is: true [2022-07-19 22:12:27,490 INFO L899 garLoopResultBuilder]: For program point L7400(line 7400) no Hoare annotation was computed. [2022-07-19 22:12:27,490 INFO L902 garLoopResultBuilder]: At program point L7398-1(line 7398) the Hoare annotation is: true [2022-07-19 22:12:27,490 INFO L899 garLoopResultBuilder]: For program point aws_mul_size_checkedEXIT(lines 2586 2594) no Hoare annotation was computed. [2022-07-19 22:12:27,490 INFO L899 garLoopResultBuilder]: For program point L2498-1(lines 2498 2499) no Hoare annotation was computed. [2022-07-19 22:12:27,490 INFO L899 garLoopResultBuilder]: For program point aws_mul_size_checkedFINAL(lines 2586 2594) no Hoare annotation was computed. [2022-07-19 22:12:27,490 INFO L895 garLoopResultBuilder]: At program point aws_mul_size_checkedENTRY(lines 2586 2594) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |old(#valid)| |#valid|))) [2022-07-19 22:12:27,490 INFO L895 garLoopResultBuilder]: At program point L2501(lines 2497 2502) the Hoare annotation is: (let ((.cse0 (= |old(#valid)| |#valid|)) (.cse1 (< 0 |#StackHeapBarrier|))) (or (and (= (* |aws_mul_size_checked_#in~b#1| |aws_mul_size_checked_#in~a#1|) (select (select |#memory_int| |aws_mul_size_checked_#in~r#1.base|) |aws_mul_size_checked_#in~r#1.offset|)) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (exists ((v_ArrVal_1486 Int) (|v___CPROVER_overflow_mult_~#c~1.base_67| Int)) (and (= (store |old(#valid)| |v___CPROVER_overflow_mult_~#c~1.base_67| v_ArrVal_1486) |#valid|) (= (select |old(#valid)| |v___CPROVER_overflow_mult_~#c~1.base_67|) 0))) .cse0 .cse1) (not .cse1) (and (<= (+ |aws_mul_size_checked_aws_mul_u64_checked_#res#1| 1) 0) .cse0 .cse1))) [2022-07-19 22:12:27,490 INFO L895 garLoopResultBuilder]: At program point L2498(line 2498) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |aws_mul_size_checked_aws_mul_u64_checked_~r#1.base| |aws_mul_size_checked_#in~r#1.base|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |aws_mul_size_checked_#in~a#1| |aws_mul_size_checked_aws_mul_u64_checked_~a#1|) (= |aws_mul_size_checked_#in~b#1| |aws_mul_size_checked_aws_mul_u64_checked_~b#1|) (= |old(#valid)| |#valid|) (= |aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset| |aws_mul_size_checked_#in~r#1.offset|))) [2022-07-19 22:12:27,490 INFO L899 garLoopResultBuilder]: For program point L2499-1(line 2499) no Hoare annotation was computed. [2022-07-19 22:12:27,490 INFO L895 garLoopResultBuilder]: At program point L2499(line 2499) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (= |aws_mul_size_checked_aws_mul_u64_checked_~r#1.base| |aws_mul_size_checked_#in~r#1.base|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |aws_mul_size_checked_#in~a#1| |aws_mul_size_checked_aws_mul_u64_checked_~a#1|) (= |aws_mul_size_checked_#in~b#1| |aws_mul_size_checked_aws_mul_u64_checked_~b#1|) (exists ((v_ArrVal_1486 Int) (|v___CPROVER_overflow_mult_~#c~1.base_67| Int)) (and (= (store |old(#valid)| |v___CPROVER_overflow_mult_~#c~1.base_67| v_ArrVal_1486) |#valid|) (= (select |old(#valid)| |v___CPROVER_overflow_mult_~#c~1.base_67|) 0))) (= |old(#valid)| |#valid|) (= |aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset| |aws_mul_size_checked_#in~r#1.offset|))) [2022-07-19 22:12:27,490 INFO L899 garLoopResultBuilder]: For program point nondet_uint64_tEXIT(line 266) no Hoare annotation was computed. [2022-07-19 22:12:27,491 INFO L902 garLoopResultBuilder]: At program point nondet_uint64_tENTRY(line 266) the Hoare annotation is: true [2022-07-19 22:12:27,491 INFO L899 garLoopResultBuilder]: For program point nondet_uint64_tFINAL(line 266) no Hoare annotation was computed. [2022-07-19 22:12:27,491 INFO L899 garLoopResultBuilder]: For program point ##fun~$Pointer$~TO~VOIDEXIT(line -1) no Hoare annotation was computed. [2022-07-19 22:12:27,491 INFO L902 garLoopResultBuilder]: At program point ##fun~$Pointer$~TO~VOIDENTRY(line -1) the Hoare annotation is: true [2022-07-19 22:12:27,491 INFO L899 garLoopResultBuilder]: For program point ##fun~$Pointer$~TO~VOIDFINAL(line -1) no Hoare annotation was computed. [2022-07-19 22:12:27,491 INFO L899 garLoopResultBuilder]: For program point L6852(line 6852) no Hoare annotation was computed. [2022-07-19 22:12:27,491 INFO L895 garLoopResultBuilder]: At program point __CPROVER_overflow_plusENTRY(lines 248 251) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) [2022-07-19 22:12:27,491 INFO L899 garLoopResultBuilder]: For program point __CPROVER_overflow_plusFINAL(lines 248 251) no Hoare annotation was computed. [2022-07-19 22:12:27,491 INFO L899 garLoopResultBuilder]: For program point __CPROVER_overflow_plusEXIT(lines 248 251) no Hoare annotation was computed. [2022-07-19 22:12:27,491 INFO L902 garLoopResultBuilder]: At program point hash_table_state_is_validENTRY(lines 10026 10073) the Hoare annotation is: true [2022-07-19 22:12:27,491 INFO L899 garLoopResultBuilder]: For program point L10028(lines 10028 10032) no Hoare annotation was computed. [2022-07-19 22:12:27,491 INFO L899 garLoopResultBuilder]: For program point hash_table_state_is_validEXIT(lines 10026 10073) no Hoare annotation was computed. [2022-07-19 22:12:27,491 INFO L899 garLoopResultBuilder]: For program point hash_table_state_is_validFINAL(lines 10026 10073) no Hoare annotation was computed. [2022-07-19 22:12:27,491 INFO L899 garLoopResultBuilder]: For program point L10054-1(line 10054) no Hoare annotation was computed. [2022-07-19 22:12:27,491 INFO L902 garLoopResultBuilder]: At program point L10054(line 10054) the Hoare annotation is: true [2022-07-19 22:12:27,492 INFO L902 garLoopResultBuilder]: At program point my_memsetENTRY(lines 7414 7416) the Hoare annotation is: true [2022-07-19 22:12:27,492 INFO L899 garLoopResultBuilder]: For program point my_memsetFINAL(lines 7414 7416) no Hoare annotation was computed. [2022-07-19 22:12:27,492 INFO L899 garLoopResultBuilder]: For program point L7415-1(line 7415) no Hoare annotation was computed. [2022-07-19 22:12:27,492 INFO L902 garLoopResultBuilder]: At program point L7415(line 7415) the Hoare annotation is: true [2022-07-19 22:12:27,492 INFO L899 garLoopResultBuilder]: For program point my_memsetEXIT(lines 7414 7416) no Hoare annotation was computed. [2022-07-19 22:12:27,492 INFO L899 garLoopResultBuilder]: For program point L211-2(lines 210 212) no Hoare annotation was computed. [2022-07-19 22:12:27,492 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 210 212) the Hoare annotation is: true [2022-07-19 22:12:27,492 INFO L899 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2022-07-19 22:12:27,492 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 210 212) no Hoare annotation was computed. [2022-07-19 22:12:27,492 INFO L895 garLoopResultBuilder]: At program point aws_raise_errorENTRY(lines 1988 1999) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (= ~tl_last_error~0 |old(~tl_last_error~0)|)) [2022-07-19 22:12:27,492 INFO L899 garLoopResultBuilder]: For program point aws_raise_errorFINAL(lines 1988 1999) no Hoare annotation was computed. [2022-07-19 22:12:27,492 INFO L899 garLoopResultBuilder]: For program point L7385(lines 7385 7387) no Hoare annotation was computed. [2022-07-19 22:12:27,492 INFO L899 garLoopResultBuilder]: For program point aws_raise_errorEXIT(lines 1988 1999) no Hoare annotation was computed. [2022-07-19 22:12:27,492 INFO L899 garLoopResultBuilder]: For program point can_fail_allocatorFINAL(lines 6950 6952) no Hoare annotation was computed. [2022-07-19 22:12:27,492 INFO L899 garLoopResultBuilder]: For program point can_fail_allocatorEXIT(lines 6950 6952) no Hoare annotation was computed. [2022-07-19 22:12:27,493 INFO L902 garLoopResultBuilder]: At program point can_fail_allocatorENTRY(lines 6950 6952) the Hoare annotation is: true [2022-07-19 22:12:27,493 INFO L895 garLoopResultBuilder]: At program point __CPROVER_overflow_multENTRY(lines 253 256) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) [2022-07-19 22:12:27,493 INFO L899 garLoopResultBuilder]: For program point __CPROVER_overflow_multEXIT(lines 253 256) no Hoare annotation was computed. [2022-07-19 22:12:27,493 INFO L899 garLoopResultBuilder]: For program point __CPROVER_overflow_multFINAL(lines 253 256) no Hoare annotation was computed. [2022-07-19 22:12:27,493 INFO L899 garLoopResultBuilder]: For program point aws_is_power_of_twoFINAL(lines 2626 2631) no Hoare annotation was computed. [2022-07-19 22:12:27,493 INFO L899 garLoopResultBuilder]: For program point aws_is_power_of_twoEXIT(lines 2626 2631) no Hoare annotation was computed. [2022-07-19 22:12:27,493 INFO L902 garLoopResultBuilder]: At program point aws_is_power_of_twoENTRY(lines 2626 2631) the Hoare annotation is: true [2022-07-19 22:12:27,493 INFO L895 garLoopResultBuilder]: At program point L2545(lines 2541 2546) the Hoare annotation is: (let ((.cse0 (= |old(#valid)| |#valid|))) (or (not (< 0 |#StackHeapBarrier|)) (and (<= (+ |aws_add_size_checked_aws_add_u64_checked_#res#1| 1) 0) .cse0) (and (= (select (select |#memory_int| |aws_add_size_checked_#in~r#1.base|) |aws_add_size_checked_#in~r#1.offset|) (+ |aws_add_size_checked_#in~b#1| |aws_add_size_checked_#in~a#1|)) (exists ((v_ArrVal_1486 Int) (|v___CPROVER_overflow_mult_~#c~1.base_67| Int)) (and (= (store |old(#valid)| |v___CPROVER_overflow_mult_~#c~1.base_67| v_ArrVal_1486) |#valid|) (= (select |old(#valid)| |v___CPROVER_overflow_mult_~#c~1.base_67|) 0))) .cse0))) [2022-07-19 22:12:27,493 INFO L895 garLoopResultBuilder]: At program point aws_add_size_checkedENTRY(lines 2613 2621) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |old(#valid)| |#valid|))) [2022-07-19 22:12:27,493 INFO L895 garLoopResultBuilder]: At program point L2542(line 2542) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (= |aws_add_size_checked_#in~b#1| |aws_add_size_checked_aws_add_u64_checked_~b#1|) (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |aws_add_size_checked_#in~r#1.base| |aws_add_size_checked_aws_add_u64_checked_~r#1.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |aws_add_size_checked_#in~r#1.offset| |aws_add_size_checked_aws_add_u64_checked_~r#1.offset|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |old(#valid)| |#valid|) (= |aws_add_size_checked_#in~a#1| |aws_add_size_checked_aws_add_u64_checked_~a#1|))) [2022-07-19 22:12:27,493 INFO L899 garLoopResultBuilder]: For program point L2543-1(line 2543) no Hoare annotation was computed. [2022-07-19 22:12:27,493 INFO L895 garLoopResultBuilder]: At program point L2543(line 2543) the Hoare annotation is: (or (and (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |old(#valid)| |#valid|)) (not (< 0 |#StackHeapBarrier|))) [2022-07-19 22:12:27,493 INFO L899 garLoopResultBuilder]: For program point L2542-1(lines 2542 2543) no Hoare annotation was computed. [2022-07-19 22:12:27,493 INFO L899 garLoopResultBuilder]: For program point aws_add_size_checkedFINAL(lines 2613 2621) no Hoare annotation was computed. [2022-07-19 22:12:27,494 INFO L899 garLoopResultBuilder]: For program point aws_add_size_checkedEXIT(lines 2613 2621) no Hoare annotation was computed. [2022-07-19 22:12:27,494 INFO L899 garLoopResultBuilder]: For program point L6815-1(line 6815) no Hoare annotation was computed. [2022-07-19 22:12:27,494 INFO L895 garLoopResultBuilder]: At program point L6815(line 6815) the Hoare annotation is: (and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|) (not (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base| |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|)) (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.offset| 0) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.offset|) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|) (= |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base|) 1) (<= (mod |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| 18446744073709551616) 8) (= (select |#valid| |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|) 1) (< 0 |#StackHeapBarrier|)) [2022-07-19 22:12:27,494 INFO L899 garLoopResultBuilder]: For program point L9276(lines 9276 9278) no Hoare annotation was computed. [2022-07-19 22:12:27,494 INFO L895 garLoopResultBuilder]: At program point L9276-2(lines 9276 9278) the Hoare annotation is: false [2022-07-19 22:12:27,494 INFO L899 garLoopResultBuilder]: For program point L6815-3(line 6815) no Hoare annotation was computed. [2022-07-19 22:12:27,494 INFO L895 garLoopResultBuilder]: At program point L6815-2(line 6815) the Hoare annotation is: (let ((.cse0 (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|)) (.cse1 (not (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base| |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|))) (.cse2 (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.offset|)) (.cse3 (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|)) (.cse4 (= (select |#valid| |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|) 1)) (.cse5 (< 0 |#StackHeapBarrier|))) (or (and (<= (+ |ULTIMATE.start_ensure_allocated_hash_table_#t~ret550#1| 1) 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.offset| 0) .cse2 .cse3 (= (+ 29629528 (select (select |#memory_int| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base|) |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.offset|)) (* |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| 24)) (= |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base|) 1) (<= (mod |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| 18446744073709551616) 8) .cse4 (= |ULTIMATE.start_ensure_allocated_hash_table_#t~ret550#1| 0) .cse5))) [2022-07-19 22:12:27,494 INFO L899 garLoopResultBuilder]: For program point L6840-1(line 6840) no Hoare annotation was computed. [2022-07-19 22:12:27,494 INFO L895 garLoopResultBuilder]: At program point L6840(line 6840) the Hoare annotation is: false [2022-07-19 22:12:27,494 INFO L899 garLoopResultBuilder]: For program point L9276-3(lines 9276 9278) no Hoare annotation was computed. [2022-07-19 22:12:27,494 INFO L895 garLoopResultBuilder]: At program point L9945(line 9945) the Hoare annotation is: false [2022-07-19 22:12:27,494 INFO L899 garLoopResultBuilder]: For program point L9945-1(line 9945) no Hoare annotation was computed. [2022-07-19 22:12:27,494 INFO L899 garLoopResultBuilder]: For program point L7179-1(line 7179) no Hoare annotation was computed. [2022-07-19 22:12:27,495 INFO L895 garLoopResultBuilder]: At program point L7179(line 7179) the Hoare annotation is: false [2022-07-19 22:12:27,495 INFO L899 garLoopResultBuilder]: For program point L9285(lines 9285 9287) no Hoare annotation was computed. [2022-07-19 22:12:27,495 INFO L895 garLoopResultBuilder]: At program point L9954(line 9954) the Hoare annotation is: false [2022-07-19 22:12:27,495 INFO L899 garLoopResultBuilder]: For program point L6816-1(line 6816) no Hoare annotation was computed. [2022-07-19 22:12:27,495 INFO L895 garLoopResultBuilder]: At program point L6816(line 6816) the Hoare annotation is: (let ((.cse0 (select |#memory_int| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base|))) (and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|) (not (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base| |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|)) (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.offset| 0) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.offset|) (= (select .cse0 0) |ULTIMATE.start_ensure_allocated_hash_table_#t~mem551#1|) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|) (= (+ 29629528 (select .cse0 |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.offset|)) (* |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| 24)) (= |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base|) 1) (<= (mod |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| 18446744073709551616) 8) (= (select |#valid| |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|) 1) (< 0 |#StackHeapBarrier|))) [2022-07-19 22:12:27,495 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-19 22:12:27,495 INFO L899 garLoopResultBuilder]: For program point L9954-1(line 9954) no Hoare annotation was computed. [2022-07-19 22:12:27,495 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-19 22:12:27,495 INFO L899 garLoopResultBuilder]: For program point L6841-1(line 6841) no Hoare annotation was computed. [2022-07-19 22:12:27,495 INFO L895 garLoopResultBuilder]: At program point L6841(line 6841) the Hoare annotation is: false [2022-07-19 22:12:27,495 INFO L899 garLoopResultBuilder]: For program point L9938(line 9938) no Hoare annotation was computed. [2022-07-19 22:12:27,495 INFO L895 garLoopResultBuilder]: At program point L6833(lines 6831 6834) the Hoare annotation is: false [2022-07-19 22:12:27,495 INFO L902 garLoopResultBuilder]: At program point L10161(line 10161) the Hoare annotation is: true [2022-07-19 22:12:27,495 INFO L899 garLoopResultBuilder]: For program point L9938-2(lines 9938 9951) no Hoare annotation was computed. [2022-07-19 22:12:27,496 INFO L899 garLoopResultBuilder]: For program point L7180-1(line 7180) no Hoare annotation was computed. [2022-07-19 22:12:27,496 INFO L899 garLoopResultBuilder]: For program point L235(line 235) no Hoare annotation was computed. [2022-07-19 22:12:27,496 INFO L899 garLoopResultBuilder]: For program point L9938-3(lines 9938 9951) no Hoare annotation was computed. [2022-07-19 22:12:27,496 INFO L895 garLoopResultBuilder]: At program point L7180(line 7180) the Hoare annotation is: false [2022-07-19 22:12:27,496 INFO L899 garLoopResultBuilder]: For program point L6825-3(lines 6825 6827) no Hoare annotation was computed. [2022-07-19 22:12:27,496 INFO L899 garLoopResultBuilder]: For program point L6825-1(lines 6825 6827) no Hoare annotation was computed. [2022-07-19 22:12:27,496 INFO L895 garLoopResultBuilder]: At program point L6825(line 6825) the Hoare annotation is: false [2022-07-19 22:12:27,496 INFO L899 garLoopResultBuilder]: For program point L9278-1(line 9278) no Hoare annotation was computed. [2022-07-19 22:12:27,496 INFO L899 garLoopResultBuilder]: For program point L9947(lines 9947 9949) no Hoare annotation was computed. [2022-07-19 22:12:27,496 INFO L895 garLoopResultBuilder]: At program point L10145(line 10145) the Hoare annotation is: false [2022-07-19 22:12:27,496 INFO L895 garLoopResultBuilder]: At program point L10145-1(line 10145) the Hoare annotation is: false [2022-07-19 22:12:27,496 INFO L899 garLoopResultBuilder]: For program point L10145-2(line 10145) no Hoare annotation was computed. [2022-07-19 22:12:27,496 INFO L895 garLoopResultBuilder]: At program point L9278(line 9278) the Hoare annotation is: false [2022-07-19 22:12:27,496 INFO L899 garLoopResultBuilder]: For program point L6809(lines 6809 6819) no Hoare annotation was computed. [2022-07-19 22:12:27,496 INFO L899 garLoopResultBuilder]: For program point L9939-1(lines 9939 9950) no Hoare annotation was computed. [2022-07-19 22:12:27,496 INFO L895 garLoopResultBuilder]: At program point L10154(line 10154) the Hoare annotation is: false [2022-07-19 22:12:27,497 INFO L895 garLoopResultBuilder]: At program point L9939-3(lines 9939 9950) the Hoare annotation is: false [2022-07-19 22:12:27,497 INFO L895 garLoopResultBuilder]: At program point L9939-4(lines 9939 9950) the Hoare annotation is: false [2022-07-19 22:12:27,497 INFO L895 garLoopResultBuilder]: At program point L9295(lines 9295 9297) the Hoare annotation is: false [2022-07-19 22:12:27,497 INFO L899 garLoopResultBuilder]: For program point L7181-1(line 7181) no Hoare annotation was computed. [2022-07-19 22:12:27,497 INFO L899 garLoopResultBuilder]: For program point L9295-1(lines 9295 9297) no Hoare annotation was computed. [2022-07-19 22:12:27,497 INFO L895 garLoopResultBuilder]: At program point L7181(line 7181) the Hoare annotation is: false [2022-07-19 22:12:27,497 INFO L899 garLoopResultBuilder]: For program point L10154-1(line 10154) no Hoare annotation was computed. [2022-07-19 22:12:27,497 INFO L895 garLoopResultBuilder]: At program point L9948(line 9948) the Hoare annotation is: false [2022-07-19 22:12:27,497 INFO L899 garLoopResultBuilder]: For program point L9948-1(line 9948) no Hoare annotation was computed. [2022-07-19 22:12:27,497 INFO L895 garLoopResultBuilder]: At program point L6810(line 6810) the Hoare annotation is: (and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.offset|) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|) (= |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|) 1) (< 0 |#StackHeapBarrier|) (= |ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries#1| 8)) [2022-07-19 22:12:27,497 INFO L895 garLoopResultBuilder]: At program point L6843(lines 6837 6844) the Hoare annotation is: false [2022-07-19 22:12:27,497 INFO L899 garLoopResultBuilder]: For program point L6810-1(line 6810) no Hoare annotation was computed. [2022-07-19 22:12:27,497 INFO L895 garLoopResultBuilder]: At program point L9957(line 9957) the Hoare annotation is: false [2022-07-19 22:12:27,497 INFO L895 garLoopResultBuilder]: At program point L9957-1(line 9957) the Hoare annotation is: false [2022-07-19 22:12:27,497 INFO L895 garLoopResultBuilder]: At program point L10147(line 10147) the Hoare annotation is: false [2022-07-19 22:12:27,498 INFO L899 garLoopResultBuilder]: For program point L9957-2(line 9957) no Hoare annotation was computed. [2022-07-19 22:12:27,498 INFO L899 garLoopResultBuilder]: For program point L10147-1(line 10147) no Hoare annotation was computed. [2022-07-19 22:12:27,498 INFO L895 garLoopResultBuilder]: At program point L6811-1(line 6811) the Hoare annotation is: (and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.offset|) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|) (= |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.offset| 0) (<= (mod |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| 18446744073709551616) 8) (= (select |#valid| |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|) 1) (< 0 |#StackHeapBarrier|)) [2022-07-19 22:12:27,498 INFO L895 garLoopResultBuilder]: At program point L6811(line 6811) the Hoare annotation is: (and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.offset|) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|) (= |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|) 1) (< 0 |#StackHeapBarrier|) (= |ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries#1| 8)) [2022-07-19 22:12:27,498 INFO L899 garLoopResultBuilder]: For program point L9941(lines 9941 9943) no Hoare annotation was computed. [2022-07-19 22:12:27,498 INFO L895 garLoopResultBuilder]: At program point L9272(lines 9272 9298) the Hoare annotation is: false [2022-07-19 22:12:27,498 INFO L899 garLoopResultBuilder]: For program point L9933(lines 9933 9958) no Hoare annotation was computed. [2022-07-19 22:12:27,498 INFO L895 garLoopResultBuilder]: At program point L10156(lines 10156 10158) the Hoare annotation is: false [2022-07-19 22:12:27,498 INFO L899 garLoopResultBuilder]: For program point L10156-1(lines 10156 10158) no Hoare annotation was computed. [2022-07-19 22:12:27,498 INFO L899 garLoopResultBuilder]: For program point L7175(lines 7175 7183) no Hoare annotation was computed. [2022-07-19 22:12:27,498 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-19 22:12:27,498 INFO L899 garLoopResultBuilder]: For program point L6812-1(line 6812) no Hoare annotation was computed. [2022-07-19 22:12:27,498 INFO L895 garLoopResultBuilder]: At program point L6812(line 6812) the Hoare annotation is: (and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.offset|) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|) (= |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.offset| 0) (<= (mod |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| 18446744073709551616) 8) (= (select |#valid| |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|) 1) (< 0 |#StackHeapBarrier|)) [2022-07-19 22:12:27,498 INFO L895 garLoopResultBuilder]: At program point L9273(lines 9273 9275) the Hoare annotation is: false [2022-07-19 22:12:27,499 INFO L899 garLoopResultBuilder]: For program point L9273-1(lines 9273 9275) no Hoare annotation was computed. [2022-07-19 22:12:27,499 INFO L895 garLoopResultBuilder]: At program point L9934-1(line 9934) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|) |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.offset|))) (and (not (= .cse0 |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|)) (= |ULTIMATE.start_aws_hash_table_clear_#t~ret1248#1| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|) |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.offset|) |ULTIMATE.start_aws_hash_table_clean_up_~state~4#1.offset|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|) (not (= |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base| |ULTIMATE.start_aws_hash_table_clean_up_harness_~#empty_slot_idx~1#1.base|)) (not (= |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base| |ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base|)) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.offset|) (= |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base| |ULTIMATE.start_aws_hash_table_clean_up_~map#1.base|) (= |ULTIMATE.start_aws_hash_table_clean_up_~map#1.offset| |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.offset|) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|) (= .cse0 |ULTIMATE.start_aws_hash_table_clean_up_~state~4#1.base|) (= (select |#valid| |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_hash_table_clean_up_~map#1.base|) |ULTIMATE.start_aws_hash_table_clean_up_~map#1.offset|) 0)) (< 0 |#StackHeapBarrier|))) [2022-07-19 22:12:27,499 INFO L899 garLoopResultBuilder]: For program point L9934-2(line 9934) no Hoare annotation was computed. [2022-07-19 22:12:27,499 INFO L895 garLoopResultBuilder]: At program point L9290(line 9290) the Hoare annotation is: false [2022-07-19 22:12:27,499 INFO L895 garLoopResultBuilder]: At program point L9934(line 9934) the Hoare annotation is: false [2022-07-19 22:12:27,499 INFO L899 garLoopResultBuilder]: For program point L7176(lines 7176 7182) no Hoare annotation was computed. [2022-07-19 22:12:27,499 INFO L899 garLoopResultBuilder]: For program point L9290-1(line 9290) no Hoare annotation was computed. [2022-07-19 22:12:27,499 INFO L899 garLoopResultBuilder]: For program point L6821(lines 6821 6828) no Hoare annotation was computed. [2022-07-19 22:12:27,499 INFO L899 garLoopResultBuilder]: For program point L10141(lines 10141 10160) no Hoare annotation was computed. [2022-07-19 22:12:27,499 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-19 22:12:27,499 INFO L899 garLoopResultBuilder]: For program point L7185(lines 7185 7187) no Hoare annotation was computed. [2022-07-19 22:12:27,499 INFO L895 garLoopResultBuilder]: At program point L6822(line 6822) the Hoare annotation is: false [2022-07-19 22:12:27,499 INFO L899 garLoopResultBuilder]: For program point L6822-3(lines 6822 6824) no Hoare annotation was computed. [2022-07-19 22:12:27,499 INFO L899 garLoopResultBuilder]: For program point L6822-1(lines 6822 6824) no Hoare annotation was computed. [2022-07-19 22:12:27,500 INFO L899 garLoopResultBuilder]: For program point L6839-1(line 6839) no Hoare annotation was computed. [2022-07-19 22:12:27,500 INFO L895 garLoopResultBuilder]: At program point L6839(line 6839) the Hoare annotation is: false [2022-07-19 22:12:27,500 INFO L899 garLoopResultBuilder]: For program point L9944(lines 9944 9946) no Hoare annotation was computed. [2022-07-19 22:12:27,500 INFO L899 garLoopResultBuilder]: For program point L9944-2(lines 9944 9946) no Hoare annotation was computed. [2022-07-19 22:12:27,500 INFO L899 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2022-07-19 22:12:27,500 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 222 224) the Hoare annotation is: true [2022-07-19 22:12:27,500 INFO L899 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2022-07-19 22:12:27,500 INFO L899 garLoopResultBuilder]: For program point L223-3(lines 222 224) no Hoare annotation was computed. [2022-07-19 22:12:27,500 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 222 224) no Hoare annotation was computed. [2022-07-19 22:12:27,500 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2022-07-19 22:12:27,503 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:12:27,505 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-19 22:12:27,514 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1486,QUANTIFIED] [2022-07-19 22:12:27,515 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_67,QUANTIFIED] [2022-07-19 22:12:27,515 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_67,QUANTIFIED] [2022-07-19 22:12:27,518 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1486,QUANTIFIED] [2022-07-19 22:12:27,518 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_67,QUANTIFIED] [2022-07-19 22:12:27,518 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_67,QUANTIFIED] [2022-07-19 22:12:27,519 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1486,QUANTIFIED] [2022-07-19 22:12:27,519 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_67,QUANTIFIED] [2022-07-19 22:12:27,519 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_67,QUANTIFIED] [2022-07-19 22:12:27,519 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1486,QUANTIFIED] [2022-07-19 22:12:27,519 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_67,QUANTIFIED] [2022-07-19 22:12:27,519 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_67,QUANTIFIED] [2022-07-19 22:12:27,520 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.07 10:12:27 BoogieIcfgContainer [2022-07-19 22:12:27,520 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-19 22:12:27,521 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-19 22:12:27,521 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-19 22:12:27,521 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-19 22:12:27,521 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:09:39" (3/4) ... [2022-07-19 22:12:27,524 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-19 22:12:27,528 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure bounded_malloc [2022-07-19 22:12:27,529 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_hash_table_is_valid [2022-07-19 22:12:27,529 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure hash_table_state_is_valid [2022-07-19 22:12:27,529 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure my_memset [2022-07-19 22:12:27,529 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_bool [2022-07-19 22:12:27,529 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_mem_release [2022-07-19 22:12:27,529 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure hash_table_state_required_bytes [2022-07-19 22:12:27,529 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2022-07-19 22:12:27,529 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure memset_override_0_impl [2022-07-19 22:12:27,529 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_raise_error [2022-07-19 22:12:27,529 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure can_fail_allocator [2022-07-19 22:12:27,529 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __CPROVER_overflow_mult [2022-07-19 22:12:27,529 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_is_power_of_two [2022-07-19 22:12:27,529 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_add_size_checked [2022-07-19 22:12:27,530 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_mul_size_checked [2022-07-19 22:12:27,530 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_uint64_t [2022-07-19 22:12:27,530 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~$Pointer$~TO~VOID [2022-07-19 22:12:27,530 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2022-07-19 22:12:27,530 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __CPROVER_overflow_plus [2022-07-19 22:12:27,541 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 161 nodes and edges [2022-07-19 22:12:27,543 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 77 nodes and edges [2022-07-19 22:12:27,544 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 28 nodes and edges [2022-07-19 22:12:27,544 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2022-07-19 22:12:27,545 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2022-07-19 22:12:27,546 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-07-19 22:12:27,547 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-19 22:12:27,548 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-19 22:12:27,573 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((\old(b) * \old(a) == unknown-#memory_int-unknown[r][r] && tl_last_error == \old(tl_last_error)) && (\exists v_ArrVal_1486 : int, v___CPROVER_overflow_mult_~#c~1.base_67 : int :: \old(\valid)[v___CPROVER_overflow_mult_~#c~1.base_67 := v_ArrVal_1486] == \valid && \old(\valid)[v___CPROVER_overflow_mult_~#c~1.base_67] == 0)) && \old(\valid) == \valid) && 0 < unknown-#StackHeapBarrier-unknown) || !(0 < unknown-#StackHeapBarrier-unknown)) || ((\result + 1 <= 0 && \old(\valid) == \valid) && 0 < unknown-#StackHeapBarrier-unknown) [2022-07-19 22:12:27,574 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(0 < unknown-#StackHeapBarrier-unknown) || (\result + 1 <= 0 && \old(\valid) == \valid)) || ((unknown-#memory_int-unknown[r][r] == \old(b) + \old(a) && (\exists v_ArrVal_1486 : int, v___CPROVER_overflow_mult_~#c~1.base_67 : int :: \old(\valid)[v___CPROVER_overflow_mult_~#c~1.base_67 := v_ArrVal_1486] == \valid && \old(\valid)[v___CPROVER_overflow_mult_~#c~1.base_67] == 0)) && \old(\valid) == \valid) [2022-07-19 22:12:27,903 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-19 22:12:27,903 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-19 22:12:27,904 INFO L158 Benchmark]: Toolchain (without parser) took 172467.15ms. Allocated memory was 94.4MB in the beginning and 484.4MB in the end (delta: 390.1MB). Free memory was 50.0MB in the beginning and 159.0MB in the end (delta: -109.0MB). Peak memory consumption was 280.7MB. Max. memory is 16.1GB. [2022-07-19 22:12:27,904 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 94.4MB. Free memory was 63.4MB in the beginning and 63.4MB in the end (delta: 30.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 22:12:27,904 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2752.85ms. Allocated memory was 94.4MB in the beginning and 153.1MB in the end (delta: 58.7MB). Free memory was 49.6MB in the beginning and 77.0MB in the end (delta: -27.3MB). Peak memory consumption was 51.4MB. Max. memory is 16.1GB. [2022-07-19 22:12:27,904 INFO L158 Benchmark]: Boogie Procedure Inliner took 179.50ms. Allocated memory is still 153.1MB. Free memory was 77.0MB in the beginning and 65.7MB in the end (delta: 11.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-19 22:12:27,905 INFO L158 Benchmark]: Boogie Preprocessor took 108.66ms. Allocated memory is still 153.1MB. Free memory was 65.7MB in the beginning and 95.1MB in the end (delta: -29.4MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. [2022-07-19 22:12:27,905 INFO L158 Benchmark]: RCFGBuilder took 1262.41ms. Allocated memory was 153.1MB in the beginning and 184.5MB in the end (delta: 31.5MB). Free memory was 95.1MB in the beginning and 109.8MB in the end (delta: -14.8MB). Peak memory consumption was 46.8MB. Max. memory is 16.1GB. [2022-07-19 22:12:27,905 INFO L158 Benchmark]: TraceAbstraction took 167771.50ms. Allocated memory was 184.5MB in the beginning and 484.4MB in the end (delta: 299.9MB). Free memory was 108.8MB in the beginning and 281.7MB in the end (delta: -172.9MB). Peak memory consumption was 127.0MB. Max. memory is 16.1GB. [2022-07-19 22:12:27,905 INFO L158 Benchmark]: Witness Printer took 382.55ms. Allocated memory is still 484.4MB. Free memory was 281.7MB in the beginning and 159.0MB in the end (delta: 122.7MB). Peak memory consumption was 123.7MB. Max. memory is 16.1GB. [2022-07-19 22:12:27,907 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 94.4MB. Free memory was 63.4MB in the beginning and 63.4MB in the end (delta: 30.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2752.85ms. Allocated memory was 94.4MB in the beginning and 153.1MB in the end (delta: 58.7MB). Free memory was 49.6MB in the beginning and 77.0MB in the end (delta: -27.3MB). Peak memory consumption was 51.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 179.50ms. Allocated memory is still 153.1MB. Free memory was 77.0MB in the beginning and 65.7MB in the end (delta: 11.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 108.66ms. Allocated memory is still 153.1MB. Free memory was 65.7MB in the beginning and 95.1MB in the end (delta: -29.4MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. * RCFGBuilder took 1262.41ms. Allocated memory was 153.1MB in the beginning and 184.5MB in the end (delta: 31.5MB). Free memory was 95.1MB in the beginning and 109.8MB in the end (delta: -14.8MB). Peak memory consumption was 46.8MB. Max. memory is 16.1GB. * TraceAbstraction took 167771.50ms. Allocated memory was 184.5MB in the beginning and 484.4MB in the end (delta: 299.9MB). Free memory was 108.8MB in the beginning and 281.7MB in the end (delta: -172.9MB). Peak memory consumption was 127.0MB. Max. memory is 16.1GB. * Witness Printer took 382.55ms. Allocated memory is still 484.4MB. Free memory was 281.7MB in the beginning and 159.0MB in the end (delta: 122.7MB). Peak memory consumption was 123.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1486,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1486,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1486,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1486,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_67,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 20 procedures, 194 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 167.7s, OverallIterations: 16, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 11.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2716 SdHoareTripleChecker+Valid, 9.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2577 mSDsluCounter, 13816 SdHoareTripleChecker+Invalid, 7.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1663 IncrementalHoareTripleChecker+Unchecked, 10784 mSDsCounter, 1649 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11465 IncrementalHoareTripleChecker+Invalid, 14777 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1649 mSolverCounterUnsat, 3032 mSDtfsCounter, 11465 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2453 GetRequests, 2184 SyntacticMatches, 7 SemanticMatches, 262 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1198 ImplicationChecksByTransitivity, 7.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=225occurred in iteration=14, InterpolantAutomatonStates: 202, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 16 MinimizatonAttempts, 210 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 75 LocationsWithAnnotation, 648 PreInvPairs, 675 NumberOfFragments, 900 HoareAnnotationTreeSize, 648 FomulaSimplifications, 498 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 75 FomulaSimplificationsInter, 1261 FormulaSimplificationTreeSizeReductionInter, 0.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 137.1s SatisfiabilityAnalysisTime, 13.5s InterpolantComputationTime, 3564 NumberOfCodeBlocks, 3564 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 3595 ConstructedInterpolants, 46 QuantifiedInterpolants, 8467 SizeOfPredicates, 60 NumberOfNonLiveVariables, 17952 ConjunctsInSsa, 470 ConjunctsInUnsatCore, 20 InterpolantComputations, 14 PerfectInterpolantSequences, 5348/5422 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 6831]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 7407]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 9939]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 6837]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2497]: Loop Invariant [2022-07-19 22:12:27,912 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1486,QUANTIFIED] [2022-07-19 22:12:27,913 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_67,QUANTIFIED] [2022-07-19 22:12:27,913 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_67,QUANTIFIED] [2022-07-19 22:12:27,913 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1486,QUANTIFIED] [2022-07-19 22:12:27,913 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_67,QUANTIFIED] [2022-07-19 22:12:27,913 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_67,QUANTIFIED] Derived loop invariant: (((((\old(b) * \old(a) == unknown-#memory_int-unknown[r][r] && tl_last_error == \old(tl_last_error)) && (\exists v_ArrVal_1486 : int, v___CPROVER_overflow_mult_~#c~1.base_67 : int :: \old(\valid)[v___CPROVER_overflow_mult_~#c~1.base_67 := v_ArrVal_1486] == \valid && \old(\valid)[v___CPROVER_overflow_mult_~#c~1.base_67] == 0)) && \old(\valid) == \valid) && 0 < unknown-#StackHeapBarrier-unknown) || !(0 < unknown-#StackHeapBarrier-unknown)) || ((\result + 1 <= 0 && \old(\valid) == \valid) && 0 < unknown-#StackHeapBarrier-unknown) - InvariantResult [Line: 2541]: Loop Invariant [2022-07-19 22:12:27,914 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1486,QUANTIFIED] [2022-07-19 22:12:27,914 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_67,QUANTIFIED] [2022-07-19 22:12:27,914 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_67,QUANTIFIED] [2022-07-19 22:12:27,915 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1486,QUANTIFIED] [2022-07-19 22:12:27,915 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_67,QUANTIFIED] [2022-07-19 22:12:27,915 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_67,QUANTIFIED] Derived loop invariant: (!(0 < unknown-#StackHeapBarrier-unknown) || (\result + 1 <= 0 && \old(\valid) == \valid)) || ((unknown-#memory_int-unknown[r][r] == \old(b) + \old(a) && (\exists v_ArrVal_1486 : int, v___CPROVER_overflow_mult_~#c~1.base_67 : int :: \old(\valid)[v___CPROVER_overflow_mult_~#c~1.base_67 := v_ArrVal_1486] == \valid && \old(\valid)[v___CPROVER_overflow_mult_~#c~1.base_67] == 0)) && \old(\valid) == \valid) - InvariantResult [Line: 10161]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 9272]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9939]: Loop Invariant Derived loop invariant: 0 RESULT: Ultimate proved your program to be correct! [2022-07-19 22:12:27,950 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE