./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 791161d1 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-?-791161d [2022-07-22 22:23:16,552 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 22:23:16,554 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 22:23:16,583 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 22:23:16,583 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 22:23:16,584 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 22:23:16,586 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 22:23:16,589 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 22:23:16,590 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 22:23:16,594 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 22:23:16,594 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 22:23:16,596 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 22:23:16,596 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 22:23:16,597 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 22:23:16,598 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 22:23:16,601 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 22:23:16,601 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 22:23:16,602 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 22:23:16,603 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 22:23:16,607 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 22:23:16,609 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 22:23:16,609 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 22:23:16,610 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 22:23:16,610 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 22:23:16,611 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 22:23:16,616 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 22:23:16,616 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 22:23:16,616 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 22:23:16,617 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 22:23:16,617 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 22:23:16,618 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 22:23:16,618 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 22:23:16,620 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 22:23:16,620 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 22:23:16,620 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 22:23:16,621 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 22:23:16,621 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 22:23:16,622 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 22:23:16,622 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 22:23:16,623 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 22:23:16,623 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 22:23:16,624 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 22:23:16,625 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-22 22:23:16,647 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 22:23:16,647 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 22:23:16,648 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 22:23:16,648 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 22:23:16,648 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 22:23:16,648 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 22:23:16,649 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 22:23:16,649 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 22:23:16,649 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 22:23:16,650 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 22:23:16,650 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 22:23:16,650 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 22:23:16,650 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 22:23:16,650 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 22:23:16,650 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 22:23:16,651 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 22:23:16,651 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 22:23:16,651 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 22:23:16,651 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 22:23:16,651 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 22:23:16,651 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 22:23:16,651 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 22:23:16,652 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 22:23:16,652 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 22:23:16,652 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 22:23:16,652 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 22:23:16,652 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 22:23:16,652 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 22:23:16,652 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 22:23:16,653 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 22:23:16,653 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-22 22:23:16,859 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 22:23:16,884 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 22:23:16,885 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 22:23:16,886 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 22:23:16,887 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 22:23:16,888 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-22 22:23:16,929 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f24032b9c/94c38e658e494b1cb828e89ad633e168/FLAG4db6ddb56 [2022-07-22 22:23:17,517 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 22:23:17,517 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_clean_up_harness.i [2022-07-22 22:23:17,539 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f24032b9c/94c38e658e494b1cb828e89ad633e168/FLAG4db6ddb56 [2022-07-22 22:23:17,986 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f24032b9c/94c38e658e494b1cb828e89ad633e168 [2022-07-22 22:23:17,992 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 22:23:17,993 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 22:23:17,994 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 22:23:17,994 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 22:23:17,996 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 22:23:17,997 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 10:23:17" (1/1) ... [2022-07-22 22:23:17,997 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d8dc682 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:23:17, skipping insertion in model container [2022-07-22 22:23:17,998 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 10:23:17" (1/1) ... [2022-07-22 22:23:18,002 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 22:23:18,064 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 22:23:18,288 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-22 22:23:18,293 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-22 22:23:19,000 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:23:19,000 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:23:19,001 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:23:19,001 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:23:19,002 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:23:19,018 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:23:19,019 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:23:19,020 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:23:19,020 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:23:19,021 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:23:19,022 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:23:19,022 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:23:19,022 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:23:19,342 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-22 22:23:19,343 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-22 22:23:19,344 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-22 22:23:19,345 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-22 22:23:19,346 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-22 22:23:19,347 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-22 22:23:19,347 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-22 22:23:19,348 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-22 22:23:19,348 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-22 22:23:19,349 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-22 22:23:19,496 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-22 22:23:19,758 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:23:19,759 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:23:19,783 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:23:19,785 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:23:19,791 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:23:19,792 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:23:19,808 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:23:19,809 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:23:19,810 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:23:19,810 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:23:19,811 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:23:19,811 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:23:19,811 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:23:19,844 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 22:23:19,878 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 22:23:19,896 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-22 22:23:19,896 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-22 22:23:19,928 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:23:19,929 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:23:19,929 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:23:19,929 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:23:19,930 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:23:19,936 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:23:19,937 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:23:19,944 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:23:19,945 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:23:19,945 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:23:19,946 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:23:19,946 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:23:19,946 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:23:19,965 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-22 22:23:19,966 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-22 22:23:19,966 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-22 22:23:19,967 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-22 22:23:19,967 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-22 22:23:19,968 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-22 22:23:19,968 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-22 22:23:20,003 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-22 22:23:20,004 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-22 22:23:20,004 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-22 22:23:20,025 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-22 22:23:20,097 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:23:20,098 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:23:20,102 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:23:20,103 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:23:20,104 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:23:20,105 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:23:20,113 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:23:20,114 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:23:20,114 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:23:20,114 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:23:20,115 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:23:20,115 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:23:20,116 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:23:20,127 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 22:23:20,344 INFO L208 MainTranslator]: Completed translation [2022-07-22 22:23:20,345 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:23:20 WrapperNode [2022-07-22 22:23:20,345 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 22:23:20,346 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 22:23:20,346 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 22:23:20,346 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 22:23:20,351 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:23:20" (1/1) ... [2022-07-22 22:23:20,446 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:23:20" (1/1) ... [2022-07-22 22:23:20,518 INFO L137 Inliner]: procedures = 775, calls = 2445, calls flagged for inlining = 71, calls inlined = 16, statements flattened = 721 [2022-07-22 22:23:20,519 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 22:23:20,520 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 22:23:20,521 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 22:23:20,521 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 22:23:20,527 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:23:20" (1/1) ... [2022-07-22 22:23:20,528 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:23:20" (1/1) ... [2022-07-22 22:23:20,537 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:23:20" (1/1) ... [2022-07-22 22:23:20,538 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:23:20" (1/1) ... [2022-07-22 22:23:20,578 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:23:20" (1/1) ... [2022-07-22 22:23:20,590 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:23:20" (1/1) ... [2022-07-22 22:23:20,595 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:23:20" (1/1) ... [2022-07-22 22:23:20,606 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 22:23:20,610 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 22:23:20,610 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 22:23:20,611 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 22:23:20,612 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:23:20" (1/1) ... [2022-07-22 22:23:20,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 22:23:20,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:23:20,637 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-22 22:23:20,653 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-22 22:23:20,681 INFO L130 BoogieDeclarations]: Found specification of procedure memset_override_0_impl [2022-07-22 22:23:20,681 INFO L138 BoogieDeclarations]: Found implementation of procedure memset_override_0_impl [2022-07-22 22:23:20,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-07-22 22:23:20,682 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2022-07-22 22:23:20,682 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2022-07-22 22:23:20,682 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 22:23:20,683 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2022-07-22 22:23:20,683 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2022-07-22 22:23:20,683 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-22 22:23:20,683 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-22 22:23:20,683 INFO L130 BoogieDeclarations]: Found specification of procedure hash_table_state_is_valid [2022-07-22 22:23:20,683 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_table_state_is_valid [2022-07-22 22:23:20,683 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 22:23:20,683 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 22:23:20,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-22 22:23:20,684 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 22:23:20,684 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 22:23:20,684 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2022-07-22 22:23:20,684 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2022-07-22 22:23:20,684 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mul_size_checked [2022-07-22 22:23:20,684 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mul_size_checked [2022-07-22 22:23:20,684 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mem_release [2022-07-22 22:23:20,685 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mem_release [2022-07-22 22:23:20,685 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 22:23:20,685 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_plus [2022-07-22 22:23:20,685 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_plus [2022-07-22 22:23:20,685 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-22 22:23:20,685 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-07-22 22:23:20,685 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-07-22 22:23:20,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 22:23:20,686 INFO L130 BoogieDeclarations]: Found specification of procedure my_memset [2022-07-22 22:23:20,686 INFO L138 BoogieDeclarations]: Found implementation of procedure my_memset [2022-07-22 22:23:20,686 INFO L130 BoogieDeclarations]: Found specification of procedure aws_is_power_of_two [2022-07-22 22:23:20,686 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_is_power_of_two [2022-07-22 22:23:20,686 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 22:23:20,686 INFO L130 BoogieDeclarations]: Found specification of procedure hash_table_state_required_bytes [2022-07-22 22:23:20,687 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_table_state_required_bytes [2022-07-22 22:23:20,687 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-07-22 22:23:20,687 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-07-22 22:23:20,687 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-22 22:23:20,687 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-22 22:23:20,688 INFO L130 BoogieDeclarations]: Found specification of procedure aws_hash_table_is_valid [2022-07-22 22:23:20,688 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_hash_table_is_valid [2022-07-22 22:23:20,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-22 22:23:20,691 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2022-07-22 22:23:20,691 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2022-07-22 22:23:20,691 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_mult [2022-07-22 22:23:20,691 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_mult [2022-07-22 22:23:20,692 INFO L130 BoogieDeclarations]: Found specification of procedure aws_add_size_checked [2022-07-22 22:23:20,692 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_add_size_checked [2022-07-22 22:23:20,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 22:23:20,966 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 22:23:20,968 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 22:23:21,664 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 22:23:21,672 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 22:23:21,672 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-22 22:23:21,674 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 10:23:21 BoogieIcfgContainer [2022-07-22 22:23:21,674 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 22:23:21,676 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 22:23:21,676 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 22:23:21,679 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 22:23:21,679 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 10:23:17" (1/3) ... [2022-07-22 22:23:21,679 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@372998a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 10:23:21, skipping insertion in model container [2022-07-22 22:23:21,679 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:23:20" (2/3) ... [2022-07-22 22:23:21,680 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@372998a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 10:23:21, skipping insertion in model container [2022-07-22 22:23:21,680 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 10:23:21" (3/3) ... [2022-07-22 22:23:21,681 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_hash_table_clean_up_harness.i [2022-07-22 22:23:21,691 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 22:23:21,691 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 22:23:21,743 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 22:23:21,752 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@4c1fdb5c, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@69f95eb0 [2022-07-22 22:23:21,752 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-22 22:23:21,756 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-22 22:23:21,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-07-22 22:23:21,768 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:23:21,769 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-22 22:23:21,769 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:23:21,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:23:21,774 INFO L85 PathProgramCache]: Analyzing trace with hash -623915720, now seen corresponding path program 1 times [2022-07-22 22:23:21,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:23:21,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215582288] [2022-07-22 22:23:21,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:23:21,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:23:22,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:22,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:23:22,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:22,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 22:23:22,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:22,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 22:23:22,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:22,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-22 22:23:22,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:22,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-22 22:23:22,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:23:22,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215582288] [2022-07-22 22:23:22,284 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2022-07-22 22:23:22,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1597300299] [2022-07-22 22:23:22,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:23:22,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:23:22,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:23:22,294 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-22 22:23:22,307 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-22 22:23:22,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:22,790 INFO L263 TraceCheckSpWp]: Trace formula consists of 2338 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-22 22:23:22,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:23:22,816 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-22 22:23:22,817 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 22:23:22,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1597300299] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:23:22,818 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:23:22,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 22:23:22,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981292255] [2022-07-22 22:23:22,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:23:22,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-22 22:23:22,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:23:22,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-22 22:23:22,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 22:23:22,846 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-22 22:23:22,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:23:22,878 INFO L93 Difference]: Finished difference Result 383 states and 508 transitions. [2022-07-22 22:23:22,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-22 22:23:22,880 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-22 22:23:22,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:23:22,887 INFO L225 Difference]: With dead ends: 383 [2022-07-22 22:23:22,888 INFO L226 Difference]: Without dead ends: 187 [2022-07-22 22:23:22,891 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-22 22:23:22,894 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-22 22:23:22,894 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-22 22:23:22,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2022-07-22 22:23:22,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2022-07-22 22:23:22,931 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-22 22:23:22,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 233 transitions. [2022-07-22 22:23:22,935 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 233 transitions. Word has length 134 [2022-07-22 22:23:22,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:23:22,936 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 233 transitions. [2022-07-22 22:23:22,937 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-22 22:23:22,937 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 233 transitions. [2022-07-22 22:23:22,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-07-22 22:23:22,939 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:23:22,939 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-22 22:23:22,970 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-22 22:23:23,158 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-22 22:23:23,158 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:23:23,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:23:23,159 INFO L85 PathProgramCache]: Analyzing trace with hash -428434944, now seen corresponding path program 1 times [2022-07-22 22:23:23,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:23:23,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571808785] [2022-07-22 22:23:23,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:23:23,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:23:23,252 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-22 22:23:23,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1043411531] [2022-07-22 22:23:23,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:23:23,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:23:23,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:23:23,255 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-22 22:23:23,257 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-22 22:23:23,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:23,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 2338 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-22 22:23:23,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:23:23,831 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-22 22:23:23,832 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 22:23:23,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:23:23,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571808785] [2022-07-22 22:23:23,832 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-22 22:23:23,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1043411531] [2022-07-22 22:23:23,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1043411531] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:23:23,833 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:23:23,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 22:23:23,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437424224] [2022-07-22 22:23:23,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:23:23,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 22:23:23,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:23:23,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 22:23:23,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 22:23:23,840 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-22 22:23:23,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:23:23,913 INFO L93 Difference]: Finished difference Result 337 states and 421 transitions. [2022-07-22 22:23:23,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 22:23:23,927 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-22 22:23:23,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:23:23,932 INFO L225 Difference]: With dead ends: 337 [2022-07-22 22:23:23,932 INFO L226 Difference]: Without dead ends: 192 [2022-07-22 22:23:23,933 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-22 22:23:23,934 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-22 22:23:23,934 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-22 22:23:23,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2022-07-22 22:23:23,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2022-07-22 22:23:23,953 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-22 22:23:23,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 238 transitions. [2022-07-22 22:23:23,959 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 238 transitions. Word has length 134 [2022-07-22 22:23:23,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:23:23,961 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 238 transitions. [2022-07-22 22:23:23,962 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-22 22:23:23,962 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 238 transitions. [2022-07-22 22:23:23,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-07-22 22:23:23,966 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:23:23,966 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-22 22:23:24,005 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-07-22 22:23:24,179 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-22 22:23:24,179 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:23:24,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:23:24,180 INFO L85 PathProgramCache]: Analyzing trace with hash -447704184, now seen corresponding path program 1 times [2022-07-22 22:23:24,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:23:24,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629311199] [2022-07-22 22:23:24,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:23:24,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:23:24,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:24,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:23:24,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:24,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 22:23:24,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:24,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 22:23:24,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:24,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-22 22:23:24,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:24,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-22 22:23:24,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:24,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:23:24,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:24,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:23:24,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:24,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-22 22:23:24,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:24,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-22 22:23:24,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:24,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-22 22:23:24,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:24,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:23:24,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:24,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-22 22:23:24,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:24,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-22 22:23:24,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:24,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-22 22:23:24,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:24,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-22 22:23:24,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:24,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-22 22:23:24,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:24,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-22 22:23:24,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:24,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-22 22:23:24,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:24,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-22 22:23:24,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:24,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-22 22:23:24,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:24,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-22 22:23:24,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:24,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-22 22:23:24,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:24,807 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-22 22:23:24,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:23:24,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629311199] [2022-07-22 22:23:24,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629311199] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:23:24,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:23:24,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-22 22:23:24,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843296125] [2022-07-22 22:23:24,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:23:24,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-22 22:23:24,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:23:24,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-22 22:23:24,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2022-07-22 22:23:24,810 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-22 22:23:25,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:23:25,778 INFO L93 Difference]: Finished difference Result 348 states and 437 transitions. [2022-07-22 22:23:25,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-22 22:23:25,779 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-22 22:23:25,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:23:25,782 INFO L225 Difference]: With dead ends: 348 [2022-07-22 22:23:25,782 INFO L226 Difference]: Without dead ends: 217 [2022-07-22 22:23:25,783 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2022-07-22 22:23:25,784 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 170 mSDsluCounter, 777 mSDsCounter, 0 mSdLazyCounter, 1051 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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.8s IncrementalHoareTripleChecker+Time [2022-07-22 22:23:25,784 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.8s Time] [2022-07-22 22:23:25,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2022-07-22 22:23:25,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 197. [2022-07-22 22:23:25,798 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-22 22:23:25,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 246 transitions. [2022-07-22 22:23:25,800 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 246 transitions. Word has length 140 [2022-07-22 22:23:25,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:23:25,800 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 246 transitions. [2022-07-22 22:23:25,801 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-22 22:23:25,801 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 246 transitions. [2022-07-22 22:23:25,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-07-22 22:23:25,802 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:23:25,803 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-22 22:23:25,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-22 22:23:25,803 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:23:25,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:23:25,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1286400266, now seen corresponding path program 1 times [2022-07-22 22:23:25,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:23:25,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768856019] [2022-07-22 22:23:25,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:23:25,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:23:25,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:25,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:23:25,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:25,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 22:23:25,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:25,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 22:23:25,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:25,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-22 22:23:25,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:26,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-22 22:23:26,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:26,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:23:26,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:26,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:23:26,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:26,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-22 22:23:26,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:26,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-22 22:23:26,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:26,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-22 22:23:26,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:26,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:23:26,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:26,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-22 22:23:26,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:26,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-22 22:23:26,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:26,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-22 22:23:26,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:26,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-22 22:23:26,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:26,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-22 22:23:26,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:26,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-22 22:23:26,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:26,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-22 22:23:26,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:26,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-22 22:23:26,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:26,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-22 22:23:26,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:26,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-22 22:23:26,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:26,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-22 22:23:26,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:26,254 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-22 22:23:26,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:23:26,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768856019] [2022-07-22 22:23:26,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768856019] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:23:26,255 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:23:26,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-22 22:23:26,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749436620] [2022-07-22 22:23:26,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:23:26,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-22 22:23:26,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:23:26,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-22 22:23:26,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-22 22:23:26,258 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-22 22:23:26,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:23:26,811 INFO L93 Difference]: Finished difference Result 355 states and 449 transitions. [2022-07-22 22:23:26,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 22:23:26,811 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-22 22:23:26,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:23:26,813 INFO L225 Difference]: With dead ends: 355 [2022-07-22 22:23:26,813 INFO L226 Difference]: Without dead ends: 219 [2022-07-22 22:23:26,814 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-22 22:23:26,814 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-22 22:23:26,815 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-22 22:23:26,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2022-07-22 22:23:26,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 199. [2022-07-22 22:23:26,830 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-22 22:23:26,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 249 transitions. [2022-07-22 22:23:26,832 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 249 transitions. Word has length 140 [2022-07-22 22:23:26,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:23:26,832 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 249 transitions. [2022-07-22 22:23:26,832 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-22 22:23:26,832 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 249 transitions. [2022-07-22 22:23:26,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-07-22 22:23:26,834 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:23:26,834 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-22 22:23:26,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-22 22:23:26,835 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:23:26,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:23:26,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1325960714, now seen corresponding path program 1 times [2022-07-22 22:23:26,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:23:26,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181091428] [2022-07-22 22:23:26,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:23:26,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:23:26,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:26,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:23:26,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:26,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 22:23:26,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:26,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 22:23:27,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:27,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-22 22:23:27,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:27,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-22 22:23:27,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:27,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:23:27,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:27,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:23:27,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:27,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-22 22:23:27,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:27,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-22 22:23:27,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:27,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-22 22:23:27,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:27,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:23:27,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:27,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-22 22:23:27,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:27,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 22:23:27,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:27,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-22 22:23:27,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:27,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-22 22:23:27,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:27,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-22 22:23:27,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:27,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-22 22:23:27,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:27,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-22 22:23:27,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:27,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-22 22:23:27,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:27,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-22 22:23:27,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:27,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-22 22:23:27,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:27,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-22 22:23:27,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:27,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-22 22:23:27,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:27,277 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-22 22:23:27,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:23:27,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181091428] [2022-07-22 22:23:27,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181091428] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:23:27,279 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:23:27,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-22 22:23:27,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988688408] [2022-07-22 22:23:27,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:23:27,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-22 22:23:27,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:23:27,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-22 22:23:27,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-22 22:23:27,281 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-22 22:23:28,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:23:28,055 INFO L93 Difference]: Finished difference Result 357 states and 457 transitions. [2022-07-22 22:23:28,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-22 22:23:28,056 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-22 22:23:28,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:23:28,058 INFO L225 Difference]: With dead ends: 357 [2022-07-22 22:23:28,058 INFO L226 Difference]: Without dead ends: 217 [2022-07-22 22:23:28,059 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-22 22:23:28,059 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-22 22:23:28,060 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-22 22:23:28,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2022-07-22 22:23:28,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 199. [2022-07-22 22:23:28,070 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-22 22:23:28,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 248 transitions. [2022-07-22 22:23:28,072 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 248 transitions. Word has length 146 [2022-07-22 22:23:28,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:23:28,072 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 248 transitions. [2022-07-22 22:23:28,072 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-22 22:23:28,072 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 248 transitions. [2022-07-22 22:23:28,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-07-22 22:23:28,074 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:23:28,074 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-22 22:23:28,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-22 22:23:28,075 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:23:28,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:23:28,075 INFO L85 PathProgramCache]: Analyzing trace with hash -133220748, now seen corresponding path program 1 times [2022-07-22 22:23:28,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:23:28,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169119087] [2022-07-22 22:23:28,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:23:28,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:23:28,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:28,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:23:28,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:28,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 22:23:28,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:28,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 22:23:28,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:28,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-22 22:23:28,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:28,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-22 22:23:28,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:28,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:23:28,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:28,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:23:28,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:28,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-22 22:23:28,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:28,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-22 22:23:28,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:28,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-22 22:23:28,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:28,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:23:28,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:28,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-22 22:23:28,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:28,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 22:23:28,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:28,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:23:28,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:28,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-22 22:23:28,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:28,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-22 22:23:28,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:28,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-22 22:23:28,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:28,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-22 22:23:28,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:28,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-22 22:23:28,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:28,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-22 22:23:28,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:28,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-22 22:23:28,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:28,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-22 22:23:28,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:28,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-22 22:23:28,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:28,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-22 22:23:28,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:28,543 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-22 22:23:28,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:23:28,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169119087] [2022-07-22 22:23:28,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169119087] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:23:28,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:23:28,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-22 22:23:28,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427298305] [2022-07-22 22:23:28,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:23:28,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-22 22:23:28,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:23:28,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-22 22:23:28,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-07-22 22:23:28,545 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-22 22:23:29,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:23:29,126 INFO L93 Difference]: Finished difference Result 232 states and 287 transitions. [2022-07-22 22:23:29,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-22 22:23:29,127 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-22 22:23:29,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:23:29,128 INFO L225 Difference]: With dead ends: 232 [2022-07-22 22:23:29,128 INFO L226 Difference]: Without dead ends: 230 [2022-07-22 22:23:29,128 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2022-07-22 22:23:29,129 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 220 mSDsluCounter, 657 mSDsCounter, 0 mSdLazyCounter, 1008 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2022-07-22 22:23:29,129 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.5s Time] [2022-07-22 22:23:29,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2022-07-22 22:23:29,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 203. [2022-07-22 22:23:29,142 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-22 22:23:29,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 251 transitions. [2022-07-22 22:23:29,143 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 251 transitions. Word has length 151 [2022-07-22 22:23:29,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:23:29,160 INFO L495 AbstractCegarLoop]: Abstraction has 203 states and 251 transitions. [2022-07-22 22:23:29,160 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-22 22:23:29,161 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 251 transitions. [2022-07-22 22:23:29,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-07-22 22:23:29,162 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:23:29,162 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-22 22:23:29,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-22 22:23:29,162 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:23:29,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:23:29,163 INFO L85 PathProgramCache]: Analyzing trace with hash -777949396, now seen corresponding path program 1 times [2022-07-22 22:23:29,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:23:29,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916572203] [2022-07-22 22:23:29,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:23:29,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:23:29,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:29,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:23:29,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:29,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 22:23:29,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:29,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 22:23:29,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:29,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-22 22:23:29,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:29,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-22 22:23:29,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:29,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:23:29,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:29,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:23:29,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:29,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-22 22:23:29,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:29,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-22 22:23:29,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:29,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-22 22:23:29,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:30,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:23:30,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:30,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-22 22:23:30,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:30,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 22:23:30,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:30,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:23:30,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:30,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-22 22:23:30,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:30,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-22 22:23:30,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:30,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-22 22:23:30,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:30,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-22 22:23:30,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:30,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-22 22:23:30,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:30,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-22 22:23:30,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:30,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-22 22:23:30,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:30,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-22 22:23:30,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:30,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-22 22:23:30,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:30,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-22 22:23:30,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:30,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-22 22:23:30,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:30,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-22 22:23:30,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:30,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-22 22:23:30,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:30,144 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-22 22:23:30,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:23:30,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916572203] [2022-07-22 22:23:30,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916572203] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:23:30,145 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:23:30,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-07-22 22:23:30,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809721749] [2022-07-22 22:23:30,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:23:30,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-22 22:23:30,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:23:30,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-22 22:23:30,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2022-07-22 22:23:30,147 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-22 22:23:32,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:23:32,065 INFO L93 Difference]: Finished difference Result 259 states and 314 transitions. [2022-07-22 22:23:32,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-22 22:23:32,065 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-22 22:23:32,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:23:32,067 INFO L225 Difference]: With dead ends: 259 [2022-07-22 22:23:32,067 INFO L226 Difference]: Without dead ends: 233 [2022-07-22 22:23:32,067 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=161, Invalid=1099, Unknown=0, NotChecked=0, Total=1260 [2022-07-22 22:23:32,068 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 370 mSDsluCounter, 813 mSDsCounter, 0 mSdLazyCounter, 2530 mSolverCounterSat, 255 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s 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.5s IncrementalHoareTripleChecker+Time [2022-07-22 22:23:32,068 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.5s Time] [2022-07-22 22:23:32,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2022-07-22 22:23:32,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 203. [2022-07-22 22:23:32,081 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-22 22:23:32,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 250 transitions. [2022-07-22 22:23:32,082 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 250 transitions. Word has length 169 [2022-07-22 22:23:32,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:23:32,083 INFO L495 AbstractCegarLoop]: Abstraction has 203 states and 250 transitions. [2022-07-22 22:23:32,083 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-22 22:23:32,083 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 250 transitions. [2022-07-22 22:23:32,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-07-22 22:23:32,085 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:23:32,085 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-22 22:23:32,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-22 22:23:32,086 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:23:32,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:23:32,086 INFO L85 PathProgramCache]: Analyzing trace with hash 442702791, now seen corresponding path program 1 times [2022-07-22 22:23:32,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:23:32,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971042037] [2022-07-22 22:23:32,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:23:32,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:23:32,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:32,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:23:32,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:32,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 22:23:32,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:32,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 22:23:32,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:32,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-22 22:23:32,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:32,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-22 22:23:32,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:32,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:23:32,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:32,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:23:32,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:32,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-22 22:23:32,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:32,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-22 22:23:32,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:32,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-22 22:23:32,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:32,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:23:32,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:32,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-22 22:23:32,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:32,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 22:23:32,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:32,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:23:32,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:32,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-22 22:23:32,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:32,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-22 22:23:32,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:32,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-22 22:23:32,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:32,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-22 22:23:32,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:32,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-22 22:23:32,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:32,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-22 22:23:32,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:32,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-22 22:23:32,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:32,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-22 22:23:32,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:32,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-22 22:23:32,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:32,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-22 22:23:32,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:32,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-22 22:23:32,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:32,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-22 22:23:32,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:32,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-22 22:23:32,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:32,375 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-22 22:23:32,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:23:32,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971042037] [2022-07-22 22:23:32,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971042037] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:23:32,376 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:23:32,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 22:23:32,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403166086] [2022-07-22 22:23:32,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:23:32,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 22:23:32,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:23:32,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 22:23:32,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-22 22:23:32,378 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-22 22:23:32,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:23:32,681 INFO L93 Difference]: Finished difference Result 307 states and 371 transitions. [2022-07-22 22:23:32,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 22:23:32,681 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-22 22:23:32,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:23:32,683 INFO L225 Difference]: With dead ends: 307 [2022-07-22 22:23:32,683 INFO L226 Difference]: Without dead ends: 221 [2022-07-22 22:23:32,683 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-22 22:23:32,684 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 133 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-22 22:23:32,684 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-22 22:23:32,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2022-07-22 22:23:32,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 204. [2022-07-22 22:23:32,695 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-22 22:23:32,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 251 transitions. [2022-07-22 22:23:32,697 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 251 transitions. Word has length 176 [2022-07-22 22:23:32,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:23:32,697 INFO L495 AbstractCegarLoop]: Abstraction has 204 states and 251 transitions. [2022-07-22 22:23:32,697 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-22 22:23:32,697 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 251 transitions. [2022-07-22 22:23:32,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-07-22 22:23:32,699 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:23:32,699 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-22 22:23:32,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-22 22:23:32,699 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:23:32,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:23:32,700 INFO L85 PathProgramCache]: Analyzing trace with hash -578365563, now seen corresponding path program 1 times [2022-07-22 22:23:32,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:23:32,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926051829] [2022-07-22 22:23:32,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:23:32,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:23:32,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:32,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:23:32,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:32,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 22:23:32,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:32,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 22:23:32,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:32,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-22 22:23:32,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:32,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-22 22:23:32,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:32,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:23:32,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:32,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:23:32,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:32,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-22 22:23:32,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:32,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-22 22:23:32,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:32,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-22 22:23:32,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:32,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:23:32,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:32,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-22 22:23:32,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:32,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 22:23:32,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:32,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:23:32,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:32,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-22 22:23:32,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:32,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-22 22:23:32,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:32,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-22 22:23:32,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:32,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-22 22:23:32,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:32,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-22 22:23:32,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:32,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-22 22:23:32,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:32,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-22 22:23:32,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:32,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-22 22:23:32,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:32,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-22 22:23:32,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:32,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-22 22:23:32,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:32,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-22 22:23:32,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:32,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-22 22:23:32,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:32,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-22 22:23:32,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:32,998 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-22 22:23:32,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:23:32,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926051829] [2022-07-22 22:23:32,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926051829] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:23:32,999 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:23:32,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-22 22:23:32,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903513699] [2022-07-22 22:23:32,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:23:32,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-22 22:23:32,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:23:33,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-22 22:23:33,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-22 22:23:33,000 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-22 22:23:33,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:23:33,528 INFO L93 Difference]: Finished difference Result 331 states and 405 transitions. [2022-07-22 22:23:33,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 22:23:33,529 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-22 22:23:33,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:23:33,530 INFO L225 Difference]: With dead ends: 331 [2022-07-22 22:23:33,530 INFO L226 Difference]: Without dead ends: 221 [2022-07-22 22:23:33,531 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-07-22 22:23:33,531 INFO L413 NwaCegarLoop]: 202 mSDtfsCounter, 93 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 642 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2022-07-22 22:23:33,531 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.5s Time] [2022-07-22 22:23:33,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2022-07-22 22:23:33,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 204. [2022-07-22 22:23:33,541 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-22 22:23:33,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 250 transitions. [2022-07-22 22:23:33,542 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 250 transitions. Word has length 176 [2022-07-22 22:23:33,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:23:33,542 INFO L495 AbstractCegarLoop]: Abstraction has 204 states and 250 transitions. [2022-07-22 22:23:33,543 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-22 22:23:33,543 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 250 transitions. [2022-07-22 22:23:33,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2022-07-22 22:23:33,544 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:23:33,544 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-22 22:23:33,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-22 22:23:33,544 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:23:33,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:23:33,545 INFO L85 PathProgramCache]: Analyzing trace with hash -361857032, now seen corresponding path program 1 times [2022-07-22 22:23:33,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:23:33,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565207910] [2022-07-22 22:23:33,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:23:33,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:23:33,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:33,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:23:33,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:33,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 22:23:33,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:33,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 22:23:33,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:33,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-22 22:23:33,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:33,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-22 22:23:33,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:33,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:23:33,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:33,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:23:33,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:33,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-22 22:23:33,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:33,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-22 22:23:33,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:33,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-22 22:23:33,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:33,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:23:33,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:33,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-22 22:23:33,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:33,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 22:23:33,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:33,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:23:33,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:33,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-22 22:23:33,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:33,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-22 22:23:33,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:33,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-22 22:23:33,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:33,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-22 22:23:33,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:33,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-22 22:23:33,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:33,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-22 22:23:33,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:33,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-22 22:23:33,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:33,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-22 22:23:33,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:33,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-22 22:23:33,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:33,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-22 22:23:33,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:33,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-22 22:23:33,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:33,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-22 22:23:33,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:33,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-22 22:23:33,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:33,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-22 22:23:33,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:33,887 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-22 22:23:33,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:23:33,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565207910] [2022-07-22 22:23:33,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565207910] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:23:33,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1857455025] [2022-07-22 22:23:33,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:23:33,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:23:33,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:23:33,889 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-22 22:23:33,917 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-22 22:23:34,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:34,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 2530 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-22 22:23:34,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:23:34,535 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-22 22:23:34,535 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 22:23:34,850 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-22 22:23:34,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1857455025] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 22:23:34,850 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 22:23:34,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 9] total 24 [2022-07-22 22:23:34,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920613126] [2022-07-22 22:23:34,851 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 22:23:34,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-22 22:23:34,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:23:34,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-22 22:23:34,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=498, Unknown=0, NotChecked=0, Total=552 [2022-07-22 22:23:34,852 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-22 22:23:36,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:23:36,477 INFO L93 Difference]: Finished difference Result 342 states and 420 transitions. [2022-07-22 22:23:36,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-22 22:23:36,478 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-22 22:23:36,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:23:36,479 INFO L225 Difference]: With dead ends: 342 [2022-07-22 22:23:36,479 INFO L226 Difference]: Without dead ends: 230 [2022-07-22 22:23:36,481 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 415 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=290, Invalid=1690, Unknown=0, NotChecked=0, Total=1980 [2022-07-22 22:23:36,481 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 504 mSDsluCounter, 1266 mSDsCounter, 0 mSdLazyCounter, 2193 mSolverCounterSat, 385 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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.2s IncrementalHoareTripleChecker+Time [2022-07-22 22:23:36,481 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.2s Time] [2022-07-22 22:23:36,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2022-07-22 22:23:36,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 210. [2022-07-22 22:23:36,493 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-22 22:23:36,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 257 transitions. [2022-07-22 22:23:36,494 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 257 transitions. Word has length 185 [2022-07-22 22:23:36,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:23:36,495 INFO L495 AbstractCegarLoop]: Abstraction has 210 states and 257 transitions. [2022-07-22 22:23:36,495 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-22 22:23:36,495 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 257 transitions. [2022-07-22 22:23:36,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2022-07-22 22:23:36,496 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:23:36,496 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-22 22:23:36,519 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-22 22:23:36,716 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-22 22:23:36,717 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:23:36,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:23:36,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1707074820, now seen corresponding path program 1 times [2022-07-22 22:23:36,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:23:36,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127486296] [2022-07-22 22:23:36,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:23:36,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:23:36,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:36,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:23:36,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:36,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 22:23:36,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:36,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 22:23:36,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:36,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-22 22:23:36,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:36,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-22 22:23:36,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:36,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:23:36,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:36,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:23:36,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:36,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-22 22:23:36,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:36,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-22 22:23:36,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:36,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-22 22:23:36,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:36,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:23:36,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:36,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-22 22:23:37,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:37,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 22:23:37,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:37,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:23:37,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:37,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-22 22:23:37,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:37,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-22 22:23:37,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:37,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-22 22:23:37,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:37,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-22 22:23:37,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:37,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-22 22:23:37,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:37,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-22 22:23:37,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:37,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-22 22:23:37,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:37,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-22 22:23:37,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:37,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-22 22:23:37,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:37,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-22 22:23:37,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:37,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-22 22:23:37,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:37,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-22 22:23:37,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:37,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 22:23:37,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:37,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:23:37,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:37,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-22 22:23:37,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:37,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-07-22 22:23:37,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:37,228 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-22 22:23:37,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:23:37,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127486296] [2022-07-22 22:23:37,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127486296] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:23:37,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [3775664] [2022-07-22 22:23:37,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:23:37,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:23:37,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:23:37,230 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-22 22:23:37,231 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-22 22:23:37,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:37,632 INFO L263 TraceCheckSpWp]: Trace formula consists of 2579 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-22 22:23:37,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:23:37,768 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-22 22:23:37,768 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 22:23:37,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [3775664] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:23:37,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 22:23:37,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [13] total 18 [2022-07-22 22:23:37,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456561543] [2022-07-22 22:23:37,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:23:37,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 22:23:37,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:23:37,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 22:23:37,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2022-07-22 22:23:37,770 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-22 22:23:37,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:23:37,912 INFO L93 Difference]: Finished difference Result 327 states and 397 transitions. [2022-07-22 22:23:37,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 22:23:37,912 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-22 22:23:37,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:23:37,913 INFO L225 Difference]: With dead ends: 327 [2022-07-22 22:23:37,913 INFO L226 Difference]: Without dead ends: 210 [2022-07-22 22:23:37,914 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-22 22:23:37,914 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 275 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-07-22 22:23:37,914 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.1s Time] [2022-07-22 22:23:37,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2022-07-22 22:23:37,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 207. [2022-07-22 22:23:37,926 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-22 22:23:37,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 252 transitions. [2022-07-22 22:23:37,928 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 252 transitions. Word has length 196 [2022-07-22 22:23:37,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:23:37,928 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 252 transitions. [2022-07-22 22:23:37,928 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-22 22:23:37,928 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 252 transitions. [2022-07-22 22:23:37,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2022-07-22 22:23:37,930 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:23:37,930 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-22 22:23:37,969 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-22 22:23:38,151 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-22 22:23:38,152 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:23:38,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:23:38,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1755111832, now seen corresponding path program 1 times [2022-07-22 22:23:38,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:23:38,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699737254] [2022-07-22 22:23:38,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:23:38,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:23:38,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:38,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:23:38,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:38,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 22:23:38,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:38,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 22:23:38,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:38,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-22 22:23:38,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:38,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-22 22:23:38,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:38,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:23:38,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:38,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:23:38,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:38,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-22 22:23:38,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:38,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-22 22:23:38,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:38,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-22 22:23:38,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:38,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:23:38,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:38,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-22 22:23:38,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:38,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 22:23:38,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:38,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:23:38,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:38,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-22 22:23:38,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:38,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-22 22:23:38,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:38,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-22 22:23:38,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:38,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-22 22:23:38,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:38,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-22 22:23:38,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:38,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-22 22:23:38,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:38,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-22 22:23:38,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:38,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-22 22:23:38,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:38,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-22 22:23:38,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:38,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-22 22:23:38,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:38,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 22:23:38,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:38,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:23:38,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:38,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-22 22:23:38,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:38,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-22 22:23:38,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:38,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 22:23:38,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:38,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:23:38,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:38,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-07-22 22:23:38,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:38,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2022-07-22 22:23:38,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:38,568 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-22 22:23:38,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:23:38,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699737254] [2022-07-22 22:23:38,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699737254] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:23:38,568 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:23:38,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-22 22:23:38,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048062321] [2022-07-22 22:23:38,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:23:38,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-22 22:23:38,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:23:38,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-22 22:23:38,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-07-22 22:23:38,570 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-22 22:23:39,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:23:39,196 INFO L93 Difference]: Finished difference Result 230 states and 278 transitions. [2022-07-22 22:23:39,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-22 22:23:39,196 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-22 22:23:39,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:23:39,198 INFO L225 Difference]: With dead ends: 230 [2022-07-22 22:23:39,198 INFO L226 Difference]: Without dead ends: 228 [2022-07-22 22:23:39,198 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2022-07-22 22:23:39,199 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 122 mSDsluCounter, 901 mSDsCounter, 0 mSdLazyCounter, 872 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2022-07-22 22:23:39,199 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.5s Time] [2022-07-22 22:23:39,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2022-07-22 22:23:39,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 211. [2022-07-22 22:23:39,209 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-22 22:23:39,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 255 transitions. [2022-07-22 22:23:39,210 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 255 transitions. Word has length 207 [2022-07-22 22:23:39,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:23:39,210 INFO L495 AbstractCegarLoop]: Abstraction has 211 states and 255 transitions. [2022-07-22 22:23:39,211 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-22 22:23:39,211 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 255 transitions. [2022-07-22 22:23:39,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2022-07-22 22:23:39,212 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:23:39,212 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-22 22:23:39,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-22 22:23:39,213 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:23:39,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:23:39,213 INFO L85 PathProgramCache]: Analyzing trace with hash 2124808202, now seen corresponding path program 1 times [2022-07-22 22:23:39,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:23:39,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643200135] [2022-07-22 22:23:39,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:23:39,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:23:39,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:39,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:23:39,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:39,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 22:23:39,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:39,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 22:23:39,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:39,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-22 22:23:39,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:39,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-22 22:23:39,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:39,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:23:39,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:39,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:23:39,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:39,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-22 22:23:39,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:39,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-22 22:23:39,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:39,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-22 22:23:39,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:39,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:23:39,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:39,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-22 22:23:39,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:39,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 22:23:39,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:39,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:23:39,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:39,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-22 22:23:39,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:39,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-22 22:23:39,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:39,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-22 22:23:39,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:39,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-22 22:23:39,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:39,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-22 22:23:39,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:39,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-22 22:23:39,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:39,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-22 22:23:39,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:39,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-22 22:23:39,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:39,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-22 22:23:39,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:39,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-22 22:23:39,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:39,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 22:23:39,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:39,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:23:39,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:39,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-22 22:23:39,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:39,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-22 22:23:39,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:39,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 22:23:39,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:39,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:23:39,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:39,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-07-22 22:23:39,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:39,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2022-07-22 22:23:39,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:39,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2022-07-22 22:23:39,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:39,831 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-22 22:23:39,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:23:39,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643200135] [2022-07-22 22:23:39,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643200135] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:23:39,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1306008891] [2022-07-22 22:23:39,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:23:39,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:23:39,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:23:39,833 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-22 22:23:39,848 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-22 22:23:40,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:23:40,326 INFO L263 TraceCheckSpWp]: Trace formula consists of 2651 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-22 22:23:40,336 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:23:40,394 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-22 22:23:40,394 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 22:23:40,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1306008891] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:23:40,394 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 22:23:40,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 13 [2022-07-22 22:23:40,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851180080] [2022-07-22 22:23:40,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:23:40,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-22 22:23:40,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:23:40,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-22 22:23:40,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2022-07-22 22:23:40,396 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-22 22:23:40,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:23:40,622 INFO L93 Difference]: Finished difference Result 375 states and 454 transitions. [2022-07-22 22:23:40,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-22 22:23:40,622 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-22 22:23:40,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:23:40,623 INFO L225 Difference]: With dead ends: 375 [2022-07-22 22:23:40,623 INFO L226 Difference]: Without dead ends: 211 [2022-07-22 22:23:40,624 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-22 22:23:40,624 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 241 mSDsluCounter, 680 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-22 22:23:40,624 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-22 22:23:40,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2022-07-22 22:23:40,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 206. [2022-07-22 22:23:40,635 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-22 22:23:40,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 248 transitions. [2022-07-22 22:23:40,636 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 248 transitions. Word has length 213 [2022-07-22 22:23:40,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:23:40,637 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 248 transitions. [2022-07-22 22:23:40,637 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-22 22:23:40,637 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 248 transitions. [2022-07-22 22:23:40,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2022-07-22 22:23:40,639 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:23:40,639 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-22 22:23:40,660 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-22 22:23:40,854 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-22 22:23:40,854 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:23:40,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:23:40,855 INFO L85 PathProgramCache]: Analyzing trace with hash -2025906859, now seen corresponding path program 1 times [2022-07-22 22:23:40,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:23:40,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372952388] [2022-07-22 22:23:40,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:23:40,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:23:40,894 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-22 22:23:40,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [239502970] [2022-07-22 22:23:40,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:23:40,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:23:40,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:23:40,895 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-22 22:23:40,896 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-22 22:26:03,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:26:03,118 INFO L263 TraceCheckSpWp]: Trace formula consists of 2756 conjuncts, 403 conjunts are in the unsatisfiable core [2022-07-22 22:26:03,128 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:26:03,160 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-22 22:26:03,466 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-22 22:26:03,466 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-22 22:26:03,520 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-22 22:26:03,666 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-22 22:26:03,777 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-22 22:26:03,924 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-22 22:26:04,204 INFO L356 Elim1Store]: treesize reduction 183, result has 22.1 percent of original size [2022-07-22 22:26:04,204 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-22 22:26:05,526 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-22 22:26:06,005 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-22 22:26:06,005 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 22:26:06,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:26:06,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372952388] [2022-07-22 22:26:06,345 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-22 22:26:06,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [239502970] [2022-07-22 22:26:06,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [239502970] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:26:06,345 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-07-22 22:26:06,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2022-07-22 22:26:06,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572779791] [2022-07-22 22:26:06,345 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-07-22 22:26:06,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-07-22 22:26:06,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:26:06,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-07-22 22:26:06,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1210, Unknown=0, NotChecked=0, Total=1332 [2022-07-22 22:26:06,347 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-22 22:26:06,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:26:06,850 INFO L93 Difference]: Finished difference Result 409 states and 485 transitions. [2022-07-22 22:26:06,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-07-22 22:26:06,850 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-22 22:26:06,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:26:06,851 INFO L225 Difference]: With dead ends: 409 [2022-07-22 22:26:06,852 INFO L226 Difference]: Without dead ends: 232 [2022-07-22 22:26:06,852 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 287 SyntacticMatches, 5 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 456 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=135, Invalid=1347, Unknown=0, NotChecked=0, Total=1482 [2022-07-22 22:26:06,853 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 23 mSDsluCounter, 1735 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2022-07-22 22:26:06,853 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.4s Time] [2022-07-22 22:26:06,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2022-07-22 22:26:06,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 225. [2022-07-22 22:26:06,862 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-22 22:26:06,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 266 transitions. [2022-07-22 22:26:06,863 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 266 transitions. Word has length 219 [2022-07-22 22:26:06,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:26:06,863 INFO L495 AbstractCegarLoop]: Abstraction has 225 states and 266 transitions. [2022-07-22 22:26:06,863 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-22 22:26:06,863 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 266 transitions. [2022-07-22 22:26:06,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2022-07-22 22:26:06,865 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:26:06,865 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-22 22:26:06,929 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-22 22:26:07,065 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-22 22:26:07,066 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:26:07,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:26:07,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1719785267, now seen corresponding path program 1 times [2022-07-22 22:26:07,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:26:07,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910965923] [2022-07-22 22:26:07,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:26:07,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:26:07,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:26:07,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:26:07,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:26:07,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 22:26:07,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:26:07,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 22:26:07,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:26:07,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-22 22:26:07,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:26:07,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-22 22:26:07,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:26:07,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:26:07,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:26:07,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:26:07,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:26:07,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-22 22:26:07,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:26:07,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-22 22:26:07,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:26:07,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:26:07,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:26:07,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-22 22:26:07,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:26:07,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-22 22:26:07,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:26:07,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:26:07,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:26:07,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-22 22:26:07,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:26:07,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 22:26:07,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:26:07,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:26:07,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:26:07,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-22 22:26:07,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:26:07,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-22 22:26:07,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:26:07,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-22 22:26:07,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:26:07,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-22 22:26:07,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:26:07,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-22 22:26:07,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:26:07,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-22 22:26:07,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:26:07,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-22 22:26:07,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:26:07,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-22 22:26:07,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:26:07,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-22 22:26:07,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:26:07,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-22 22:26:07,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:26:07,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 22:26:07,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:26:07,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:26:07,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:26:07,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-22 22:26:07,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:26:07,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-07-22 22:26:07,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:26:07,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 22:26:07,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:26:07,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:26:07,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:26:07,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-07-22 22:26:07,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:26:07,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2022-07-22 22:26:07,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:26:07,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2022-07-22 22:26:07,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:26:07,434 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-22 22:26:07,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:26:07,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910965923] [2022-07-22 22:26:07,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910965923] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:26:07,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:26:07,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-22 22:26:07,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413497867] [2022-07-22 22:26:07,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:26:07,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-22 22:26:07,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:26:07,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-22 22:26:07,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-22 22:26:07,436 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-22 22:26:07,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:26:07,933 INFO L93 Difference]: Finished difference Result 412 states and 487 transitions. [2022-07-22 22:26:07,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-22 22:26:07,934 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-22 22:26:07,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:26:07,935 INFO L225 Difference]: With dead ends: 412 [2022-07-22 22:26:07,935 INFO L226 Difference]: Without dead ends: 223 [2022-07-22 22:26:07,936 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-22 22:26:07,936 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 79 mSDsluCounter, 738 mSDsCounter, 0 mSdLazyCounter, 794 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2022-07-22 22:26:07,936 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.5s Time] [2022-07-22 22:26:07,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2022-07-22 22:26:07,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 214. [2022-07-22 22:26:07,945 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-22 22:26:07,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 250 transitions. [2022-07-22 22:26:07,946 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 250 transitions. Word has length 225 [2022-07-22 22:26:07,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:26:07,946 INFO L495 AbstractCegarLoop]: Abstraction has 214 states and 250 transitions. [2022-07-22 22:26:07,947 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-22 22:26:07,947 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 250 transitions. [2022-07-22 22:26:07,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2022-07-22 22:26:07,948 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:26:07,948 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-22 22:26:07,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-22 22:26:07,949 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:26:07,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:26:07,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1638507119, now seen corresponding path program 1 times [2022-07-22 22:26:07,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:26:07,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775288484] [2022-07-22 22:26:07,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:26:07,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:26:07,986 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-22 22:26:07,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [879270628] [2022-07-22 22:26:07,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:26:07,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:26:07,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:26:07,988 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-22 22:26:07,989 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-22 22:26:08,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:26:08,472 INFO L263 TraceCheckSpWp]: Trace formula consists of 2760 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-22 22:26:08,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:26:08,503 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-22 22:26:08,503 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 22:26:08,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:26:08,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775288484] [2022-07-22 22:26:08,504 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-22 22:26:08,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [879270628] [2022-07-22 22:26:08,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [879270628] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:26:08,504 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:26:08,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 22:26:08,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31565504] [2022-07-22 22:26:08,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:26:08,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 22:26:08,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:26:08,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 22:26:08,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-22 22:26:08,505 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-22 22:26:08,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:26:08,523 INFO L93 Difference]: Finished difference Result 214 states and 250 transitions. [2022-07-22 22:26:08,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 22:26:08,523 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-22 22:26:08,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:26:08,524 INFO L225 Difference]: With dead ends: 214 [2022-07-22 22:26:08,524 INFO L226 Difference]: Without dead ends: 0 [2022-07-22 22:26:08,524 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-22 22:26:08,525 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-22 22:26:08,525 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-22 22:26:08,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-22 22:26:08,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-22 22:26:08,526 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-22 22:26:08,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-22 22:26:08,526 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 225 [2022-07-22 22:26:08,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:26:08,526 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-22 22:26:08,526 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-22 22:26:08,527 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-22 22:26:08,527 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-22 22:26:08,529 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-22 22:26:08,553 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-22 22:26:08,745 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-22 22:26:08,746 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-22 22:26:09,534 INFO L899 garLoopResultBuilder]: For program point L6944-1(lines 6944 6946) no Hoare annotation was computed. [2022-07-22 22:26:09,534 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-22 22:26:09,534 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-22 22:26:09,534 INFO L899 garLoopResultBuilder]: For program point bounded_mallocFINAL(lines 6943 6948) no Hoare annotation was computed. [2022-07-22 22:26:09,534 INFO L899 garLoopResultBuilder]: For program point bounded_mallocEXIT(lines 6943 6948) no Hoare annotation was computed. [2022-07-22 22:26:09,534 INFO L902 garLoopResultBuilder]: At program point L10017-4(line 10017) the Hoare annotation is: true [2022-07-22 22:26:09,534 INFO L899 garLoopResultBuilder]: For program point L10017-5(line 10017) no Hoare annotation was computed. [2022-07-22 22:26:09,534 INFO L899 garLoopResultBuilder]: For program point L10017-7(line 10017) no Hoare annotation was computed. [2022-07-22 22:26:09,534 INFO L899 garLoopResultBuilder]: For program point L10017(line 10017) no Hoare annotation was computed. [2022-07-22 22:26:09,534 INFO L899 garLoopResultBuilder]: For program point L10017-2(line 10017) no Hoare annotation was computed. [2022-07-22 22:26:09,534 INFO L899 garLoopResultBuilder]: For program point L10017-3(line 10017) no Hoare annotation was computed. [2022-07-22 22:26:09,534 INFO L902 garLoopResultBuilder]: At program point aws_hash_table_is_validENTRY(lines 10015 10018) the Hoare annotation is: true [2022-07-22 22:26:09,534 INFO L899 garLoopResultBuilder]: For program point aws_hash_table_is_validEXIT(lines 10015 10018) no Hoare annotation was computed. [2022-07-22 22:26:09,534 INFO L899 garLoopResultBuilder]: For program point aws_hash_table_is_validFINAL(lines 10015 10018) no Hoare annotation was computed. [2022-07-22 22:26:09,534 INFO L899 garLoopResultBuilder]: For program point nondet_boolFINAL(line 261) no Hoare annotation was computed. [2022-07-22 22:26:09,535 INFO L899 garLoopResultBuilder]: For program point nondet_boolEXIT(line 261) no Hoare annotation was computed. [2022-07-22 22:26:09,535 INFO L902 garLoopResultBuilder]: At program point nondet_boolENTRY(line 261) the Hoare annotation is: true [2022-07-22 22:26:09,535 INFO L899 garLoopResultBuilder]: For program point L7130(lines 7130 7134) no Hoare annotation was computed. [2022-07-22 22:26:09,535 INFO L899 garLoopResultBuilder]: For program point aws_mem_releaseEXIT(lines 7122 7135) no Hoare annotation was computed. [2022-07-22 22:26:09,535 INFO L902 garLoopResultBuilder]: At program point L7126(lines 7126 7128) the Hoare annotation is: true [2022-07-22 22:26:09,535 INFO L902 garLoopResultBuilder]: At program point aws_mem_releaseENTRY(lines 7122 7135) the Hoare annotation is: true [2022-07-22 22:26:09,535 INFO L899 garLoopResultBuilder]: For program point L7130-2(lines 7122 7135) no Hoare annotation was computed. [2022-07-22 22:26:09,535 INFO L899 garLoopResultBuilder]: For program point L7123-1(lines 7123 7125) no Hoare annotation was computed. [2022-07-22 22:26:09,535 INFO L902 garLoopResultBuilder]: At program point L7123(lines 7123 7125) the Hoare annotation is: true [2022-07-22 22:26:09,535 INFO L899 garLoopResultBuilder]: For program point L7126-1(lines 7126 7128) no Hoare annotation was computed. [2022-07-22 22:26:09,535 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-22 22:26:09,535 INFO L899 garLoopResultBuilder]: For program point L10135-2(lines 10135 10137) no Hoare annotation was computed. [2022-07-22 22:26:09,535 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-22 22:26:09,535 INFO L899 garLoopResultBuilder]: For program point L10131-1(line 10131) no Hoare annotation was computed. [2022-07-22 22:26:09,535 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-22 22:26:09,535 INFO L899 garLoopResultBuilder]: For program point hash_table_state_required_bytesEXIT(lines 10128 10140) no Hoare annotation was computed. [2022-07-22 22:26:09,535 INFO L899 garLoopResultBuilder]: For program point L10135-1(line 10135) no Hoare annotation was computed. [2022-07-22 22:26:09,535 INFO L899 garLoopResultBuilder]: For program point L10131-2(lines 10131 10133) no Hoare annotation was computed. [2022-07-22 22:26:09,535 INFO L899 garLoopResultBuilder]: For program point hash_table_state_required_bytesFINAL(lines 10128 10140) no Hoare annotation was computed. [2022-07-22 22:26:09,535 INFO L902 garLoopResultBuilder]: At program point memset_override_0_implENTRY(lines 7397 7412) the Hoare annotation is: true [2022-07-22 22:26:09,536 INFO L899 garLoopResultBuilder]: For program point memset_override_0_implFINAL(lines 7397 7412) no Hoare annotation was computed. [2022-07-22 22:26:09,536 INFO L899 garLoopResultBuilder]: For program point L7403-1(line 7403) no Hoare annotation was computed. [2022-07-22 22:26:09,536 INFO L902 garLoopResultBuilder]: At program point L7403(line 7403) the Hoare annotation is: true [2022-07-22 22:26:09,536 INFO L899 garLoopResultBuilder]: For program point L7407-4(lines 7407 7409) no Hoare annotation was computed. [2022-07-22 22:26:09,536 INFO L902 garLoopResultBuilder]: At program point L7407-3(lines 7407 7409) the Hoare annotation is: true [2022-07-22 22:26:09,536 INFO L899 garLoopResultBuilder]: For program point L7407-2(lines 7407 7409) no Hoare annotation was computed. [2022-07-22 22:26:09,536 INFO L899 garLoopResultBuilder]: For program point memset_override_0_implEXIT(lines 7397 7412) no Hoare annotation was computed. [2022-07-22 22:26:09,536 INFO L902 garLoopResultBuilder]: At program point L7398(line 7398) the Hoare annotation is: true [2022-07-22 22:26:09,536 INFO L899 garLoopResultBuilder]: For program point L7400(line 7400) no Hoare annotation was computed. [2022-07-22 22:26:09,536 INFO L902 garLoopResultBuilder]: At program point L7398-1(line 7398) the Hoare annotation is: true [2022-07-22 22:26:09,536 INFO L899 garLoopResultBuilder]: For program point aws_mul_size_checkedEXIT(lines 2586 2594) no Hoare annotation was computed. [2022-07-22 22:26:09,536 INFO L899 garLoopResultBuilder]: For program point L2498-1(lines 2498 2499) no Hoare annotation was computed. [2022-07-22 22:26:09,536 INFO L899 garLoopResultBuilder]: For program point aws_mul_size_checkedFINAL(lines 2586 2594) no Hoare annotation was computed. [2022-07-22 22:26:09,536 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-22 22:26:09,536 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-22 22:26:09,536 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-22 22:26:09,536 INFO L899 garLoopResultBuilder]: For program point L2499-1(line 2499) no Hoare annotation was computed. [2022-07-22 22:26:09,536 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-22 22:26:09,536 INFO L899 garLoopResultBuilder]: For program point nondet_uint64_tEXIT(line 266) no Hoare annotation was computed. [2022-07-22 22:26:09,536 INFO L902 garLoopResultBuilder]: At program point nondet_uint64_tENTRY(line 266) the Hoare annotation is: true [2022-07-22 22:26:09,537 INFO L899 garLoopResultBuilder]: For program point nondet_uint64_tFINAL(line 266) no Hoare annotation was computed. [2022-07-22 22:26:09,537 INFO L899 garLoopResultBuilder]: For program point ##fun~$Pointer$~TO~VOIDEXIT(line -1) no Hoare annotation was computed. [2022-07-22 22:26:09,537 INFO L902 garLoopResultBuilder]: At program point ##fun~$Pointer$~TO~VOIDENTRY(line -1) the Hoare annotation is: true [2022-07-22 22:26:09,537 INFO L899 garLoopResultBuilder]: For program point ##fun~$Pointer$~TO~VOIDFINAL(line -1) no Hoare annotation was computed. [2022-07-22 22:26:09,537 INFO L899 garLoopResultBuilder]: For program point L6852(line 6852) no Hoare annotation was computed. [2022-07-22 22:26:09,537 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-22 22:26:09,537 INFO L899 garLoopResultBuilder]: For program point __CPROVER_overflow_plusFINAL(lines 248 251) no Hoare annotation was computed. [2022-07-22 22:26:09,537 INFO L899 garLoopResultBuilder]: For program point __CPROVER_overflow_plusEXIT(lines 248 251) no Hoare annotation was computed. [2022-07-22 22:26:09,537 INFO L902 garLoopResultBuilder]: At program point hash_table_state_is_validENTRY(lines 10026 10073) the Hoare annotation is: true [2022-07-22 22:26:09,537 INFO L899 garLoopResultBuilder]: For program point L10028(lines 10028 10032) no Hoare annotation was computed. [2022-07-22 22:26:09,537 INFO L899 garLoopResultBuilder]: For program point hash_table_state_is_validEXIT(lines 10026 10073) no Hoare annotation was computed. [2022-07-22 22:26:09,537 INFO L899 garLoopResultBuilder]: For program point hash_table_state_is_validFINAL(lines 10026 10073) no Hoare annotation was computed. [2022-07-22 22:26:09,537 INFO L899 garLoopResultBuilder]: For program point L10054-1(line 10054) no Hoare annotation was computed. [2022-07-22 22:26:09,537 INFO L902 garLoopResultBuilder]: At program point L10054(line 10054) the Hoare annotation is: true [2022-07-22 22:26:09,537 INFO L902 garLoopResultBuilder]: At program point my_memsetENTRY(lines 7414 7416) the Hoare annotation is: true [2022-07-22 22:26:09,537 INFO L899 garLoopResultBuilder]: For program point my_memsetFINAL(lines 7414 7416) no Hoare annotation was computed. [2022-07-22 22:26:09,537 INFO L899 garLoopResultBuilder]: For program point L7415-1(line 7415) no Hoare annotation was computed. [2022-07-22 22:26:09,537 INFO L902 garLoopResultBuilder]: At program point L7415(line 7415) the Hoare annotation is: true [2022-07-22 22:26:09,537 INFO L899 garLoopResultBuilder]: For program point my_memsetEXIT(lines 7414 7416) no Hoare annotation was computed. [2022-07-22 22:26:09,537 INFO L899 garLoopResultBuilder]: For program point L211-2(lines 210 212) no Hoare annotation was computed. [2022-07-22 22:26:09,537 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 210 212) the Hoare annotation is: true [2022-07-22 22:26:09,537 INFO L899 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2022-07-22 22:26:09,538 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 210 212) no Hoare annotation was computed. [2022-07-22 22:26:09,538 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-22 22:26:09,538 INFO L899 garLoopResultBuilder]: For program point aws_raise_errorFINAL(lines 1988 1999) no Hoare annotation was computed. [2022-07-22 22:26:09,538 INFO L899 garLoopResultBuilder]: For program point L7385(lines 7385 7387) no Hoare annotation was computed. [2022-07-22 22:26:09,538 INFO L899 garLoopResultBuilder]: For program point aws_raise_errorEXIT(lines 1988 1999) no Hoare annotation was computed. [2022-07-22 22:26:09,538 INFO L899 garLoopResultBuilder]: For program point can_fail_allocatorFINAL(lines 6950 6952) no Hoare annotation was computed. [2022-07-22 22:26:09,538 INFO L899 garLoopResultBuilder]: For program point can_fail_allocatorEXIT(lines 6950 6952) no Hoare annotation was computed. [2022-07-22 22:26:09,538 INFO L902 garLoopResultBuilder]: At program point can_fail_allocatorENTRY(lines 6950 6952) the Hoare annotation is: true [2022-07-22 22:26:09,538 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-22 22:26:09,538 INFO L899 garLoopResultBuilder]: For program point __CPROVER_overflow_multEXIT(lines 253 256) no Hoare annotation was computed. [2022-07-22 22:26:09,538 INFO L899 garLoopResultBuilder]: For program point __CPROVER_overflow_multFINAL(lines 253 256) no Hoare annotation was computed. [2022-07-22 22:26:09,538 INFO L899 garLoopResultBuilder]: For program point aws_is_power_of_twoFINAL(lines 2626 2631) no Hoare annotation was computed. [2022-07-22 22:26:09,538 INFO L899 garLoopResultBuilder]: For program point aws_is_power_of_twoEXIT(lines 2626 2631) no Hoare annotation was computed. [2022-07-22 22:26:09,538 INFO L902 garLoopResultBuilder]: At program point aws_is_power_of_twoENTRY(lines 2626 2631) the Hoare annotation is: true [2022-07-22 22:26:09,538 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-22 22:26:09,538 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-22 22:26:09,538 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-22 22:26:09,538 INFO L899 garLoopResultBuilder]: For program point L2543-1(line 2543) no Hoare annotation was computed. [2022-07-22 22:26:09,538 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-22 22:26:09,538 INFO L899 garLoopResultBuilder]: For program point L2542-1(lines 2542 2543) no Hoare annotation was computed. [2022-07-22 22:26:09,539 INFO L899 garLoopResultBuilder]: For program point aws_add_size_checkedFINAL(lines 2613 2621) no Hoare annotation was computed. [2022-07-22 22:26:09,539 INFO L899 garLoopResultBuilder]: For program point aws_add_size_checkedEXIT(lines 2613 2621) no Hoare annotation was computed. [2022-07-22 22:26:09,539 INFO L899 garLoopResultBuilder]: For program point L6815-1(line 6815) no Hoare annotation was computed. [2022-07-22 22:26:09,539 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-22 22:26:09,539 INFO L899 garLoopResultBuilder]: For program point L9276(lines 9276 9278) no Hoare annotation was computed. [2022-07-22 22:26:09,539 INFO L895 garLoopResultBuilder]: At program point L9276-2(lines 9276 9278) the Hoare annotation is: false [2022-07-22 22:26:09,539 INFO L899 garLoopResultBuilder]: For program point L6815-3(line 6815) no Hoare annotation was computed. [2022-07-22 22:26:09,539 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-22 22:26:09,539 INFO L899 garLoopResultBuilder]: For program point L6840-1(line 6840) no Hoare annotation was computed. [2022-07-22 22:26:09,539 INFO L895 garLoopResultBuilder]: At program point L6840(line 6840) the Hoare annotation is: false [2022-07-22 22:26:09,539 INFO L899 garLoopResultBuilder]: For program point L9276-3(lines 9276 9278) no Hoare annotation was computed. [2022-07-22 22:26:09,539 INFO L895 garLoopResultBuilder]: At program point L9945(line 9945) the Hoare annotation is: false [2022-07-22 22:26:09,539 INFO L899 garLoopResultBuilder]: For program point L9945-1(line 9945) no Hoare annotation was computed. [2022-07-22 22:26:09,539 INFO L899 garLoopResultBuilder]: For program point L7179-1(line 7179) no Hoare annotation was computed. [2022-07-22 22:26:09,539 INFO L895 garLoopResultBuilder]: At program point L7179(line 7179) the Hoare annotation is: false [2022-07-22 22:26:09,539 INFO L899 garLoopResultBuilder]: For program point L9285(lines 9285 9287) no Hoare annotation was computed. [2022-07-22 22:26:09,539 INFO L895 garLoopResultBuilder]: At program point L9954(line 9954) the Hoare annotation is: false [2022-07-22 22:26:09,539 INFO L899 garLoopResultBuilder]: For program point L6816-1(line 6816) no Hoare annotation was computed. [2022-07-22 22:26:09,540 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-22 22:26:09,540 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-22 22:26:09,540 INFO L899 garLoopResultBuilder]: For program point L9954-1(line 9954) no Hoare annotation was computed. [2022-07-22 22:26:09,540 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-22 22:26:09,540 INFO L899 garLoopResultBuilder]: For program point L6841-1(line 6841) no Hoare annotation was computed. [2022-07-22 22:26:09,540 INFO L895 garLoopResultBuilder]: At program point L6841(line 6841) the Hoare annotation is: false [2022-07-22 22:26:09,540 INFO L899 garLoopResultBuilder]: For program point L9938(line 9938) no Hoare annotation was computed. [2022-07-22 22:26:09,540 INFO L895 garLoopResultBuilder]: At program point L6833(lines 6831 6834) the Hoare annotation is: false [2022-07-22 22:26:09,540 INFO L902 garLoopResultBuilder]: At program point L10161(line 10161) the Hoare annotation is: true [2022-07-22 22:26:09,540 INFO L899 garLoopResultBuilder]: For program point L9938-2(lines 9938 9951) no Hoare annotation was computed. [2022-07-22 22:26:09,540 INFO L899 garLoopResultBuilder]: For program point L7180-1(line 7180) no Hoare annotation was computed. [2022-07-22 22:26:09,540 INFO L899 garLoopResultBuilder]: For program point L235(line 235) no Hoare annotation was computed. [2022-07-22 22:26:09,540 INFO L899 garLoopResultBuilder]: For program point L9938-3(lines 9938 9951) no Hoare annotation was computed. [2022-07-22 22:26:09,540 INFO L895 garLoopResultBuilder]: At program point L7180(line 7180) the Hoare annotation is: false [2022-07-22 22:26:09,540 INFO L899 garLoopResultBuilder]: For program point L6825-3(lines 6825 6827) no Hoare annotation was computed. [2022-07-22 22:26:09,540 INFO L899 garLoopResultBuilder]: For program point L6825-1(lines 6825 6827) no Hoare annotation was computed. [2022-07-22 22:26:09,540 INFO L895 garLoopResultBuilder]: At program point L6825(line 6825) the Hoare annotation is: false [2022-07-22 22:26:09,540 INFO L899 garLoopResultBuilder]: For program point L9278-1(line 9278) no Hoare annotation was computed. [2022-07-22 22:26:09,540 INFO L899 garLoopResultBuilder]: For program point L9947(lines 9947 9949) no Hoare annotation was computed. [2022-07-22 22:26:09,540 INFO L895 garLoopResultBuilder]: At program point L10145(line 10145) the Hoare annotation is: false [2022-07-22 22:26:09,540 INFO L895 garLoopResultBuilder]: At program point L10145-1(line 10145) the Hoare annotation is: false [2022-07-22 22:26:09,541 INFO L899 garLoopResultBuilder]: For program point L10145-2(line 10145) no Hoare annotation was computed. [2022-07-22 22:26:09,541 INFO L895 garLoopResultBuilder]: At program point L9278(line 9278) the Hoare annotation is: false [2022-07-22 22:26:09,541 INFO L899 garLoopResultBuilder]: For program point L6809(lines 6809 6819) no Hoare annotation was computed. [2022-07-22 22:26:09,541 INFO L899 garLoopResultBuilder]: For program point L9939-1(lines 9939 9950) no Hoare annotation was computed. [2022-07-22 22:26:09,541 INFO L895 garLoopResultBuilder]: At program point L10154(line 10154) the Hoare annotation is: false [2022-07-22 22:26:09,541 INFO L895 garLoopResultBuilder]: At program point L9939-3(lines 9939 9950) the Hoare annotation is: false [2022-07-22 22:26:09,541 INFO L895 garLoopResultBuilder]: At program point L9939-4(lines 9939 9950) the Hoare annotation is: false [2022-07-22 22:26:09,541 INFO L895 garLoopResultBuilder]: At program point L9295(lines 9295 9297) the Hoare annotation is: false [2022-07-22 22:26:09,541 INFO L899 garLoopResultBuilder]: For program point L7181-1(line 7181) no Hoare annotation was computed. [2022-07-22 22:26:09,541 INFO L899 garLoopResultBuilder]: For program point L9295-1(lines 9295 9297) no Hoare annotation was computed. [2022-07-22 22:26:09,541 INFO L895 garLoopResultBuilder]: At program point L7181(line 7181) the Hoare annotation is: false [2022-07-22 22:26:09,541 INFO L899 garLoopResultBuilder]: For program point L10154-1(line 10154) no Hoare annotation was computed. [2022-07-22 22:26:09,541 INFO L895 garLoopResultBuilder]: At program point L9948(line 9948) the Hoare annotation is: false [2022-07-22 22:26:09,541 INFO L899 garLoopResultBuilder]: For program point L9948-1(line 9948) no Hoare annotation was computed. [2022-07-22 22:26:09,541 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-22 22:26:09,541 INFO L895 garLoopResultBuilder]: At program point L6843(lines 6837 6844) the Hoare annotation is: false [2022-07-22 22:26:09,541 INFO L899 garLoopResultBuilder]: For program point L6810-1(line 6810) no Hoare annotation was computed. [2022-07-22 22:26:09,541 INFO L895 garLoopResultBuilder]: At program point L9957(line 9957) the Hoare annotation is: false [2022-07-22 22:26:09,541 INFO L895 garLoopResultBuilder]: At program point L9957-1(line 9957) the Hoare annotation is: false [2022-07-22 22:26:09,541 INFO L895 garLoopResultBuilder]: At program point L10147(line 10147) the Hoare annotation is: false [2022-07-22 22:26:09,541 INFO L899 garLoopResultBuilder]: For program point L9957-2(line 9957) no Hoare annotation was computed. [2022-07-22 22:26:09,542 INFO L899 garLoopResultBuilder]: For program point L10147-1(line 10147) no Hoare annotation was computed. [2022-07-22 22:26:09,542 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-22 22:26:09,542 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-22 22:26:09,542 INFO L899 garLoopResultBuilder]: For program point L9941(lines 9941 9943) no Hoare annotation was computed. [2022-07-22 22:26:09,542 INFO L895 garLoopResultBuilder]: At program point L9272(lines 9272 9298) the Hoare annotation is: false [2022-07-22 22:26:09,542 INFO L899 garLoopResultBuilder]: For program point L9933(lines 9933 9958) no Hoare annotation was computed. [2022-07-22 22:26:09,542 INFO L895 garLoopResultBuilder]: At program point L10156(lines 10156 10158) the Hoare annotation is: false [2022-07-22 22:26:09,542 INFO L899 garLoopResultBuilder]: For program point L10156-1(lines 10156 10158) no Hoare annotation was computed. [2022-07-22 22:26:09,542 INFO L899 garLoopResultBuilder]: For program point L7175(lines 7175 7183) no Hoare annotation was computed. [2022-07-22 22:26:09,542 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-22 22:26:09,542 INFO L899 garLoopResultBuilder]: For program point L6812-1(line 6812) no Hoare annotation was computed. [2022-07-22 22:26:09,542 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-22 22:26:09,542 INFO L895 garLoopResultBuilder]: At program point L9273(lines 9273 9275) the Hoare annotation is: false [2022-07-22 22:26:09,542 INFO L899 garLoopResultBuilder]: For program point L9273-1(lines 9273 9275) no Hoare annotation was computed. [2022-07-22 22:26:09,542 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-22 22:26:09,542 INFO L899 garLoopResultBuilder]: For program point L9934-2(line 9934) no Hoare annotation was computed. [2022-07-22 22:26:09,542 INFO L895 garLoopResultBuilder]: At program point L9290(line 9290) the Hoare annotation is: false [2022-07-22 22:26:09,542 INFO L895 garLoopResultBuilder]: At program point L9934(line 9934) the Hoare annotation is: false [2022-07-22 22:26:09,542 INFO L899 garLoopResultBuilder]: For program point L7176(lines 7176 7182) no Hoare annotation was computed. [2022-07-22 22:26:09,543 INFO L899 garLoopResultBuilder]: For program point L9290-1(line 9290) no Hoare annotation was computed. [2022-07-22 22:26:09,543 INFO L899 garLoopResultBuilder]: For program point L6821(lines 6821 6828) no Hoare annotation was computed. [2022-07-22 22:26:09,543 INFO L899 garLoopResultBuilder]: For program point L10141(lines 10141 10160) no Hoare annotation was computed. [2022-07-22 22:26:09,543 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-22 22:26:09,543 INFO L899 garLoopResultBuilder]: For program point L7185(lines 7185 7187) no Hoare annotation was computed. [2022-07-22 22:26:09,543 INFO L895 garLoopResultBuilder]: At program point L6822(line 6822) the Hoare annotation is: false [2022-07-22 22:26:09,543 INFO L899 garLoopResultBuilder]: For program point L6822-3(lines 6822 6824) no Hoare annotation was computed. [2022-07-22 22:26:09,543 INFO L899 garLoopResultBuilder]: For program point L6822-1(lines 6822 6824) no Hoare annotation was computed. [2022-07-22 22:26:09,547 INFO L899 garLoopResultBuilder]: For program point L6839-1(line 6839) no Hoare annotation was computed. [2022-07-22 22:26:09,547 INFO L895 garLoopResultBuilder]: At program point L6839(line 6839) the Hoare annotation is: false [2022-07-22 22:26:09,548 INFO L899 garLoopResultBuilder]: For program point L9944(lines 9944 9946) no Hoare annotation was computed. [2022-07-22 22:26:09,548 INFO L899 garLoopResultBuilder]: For program point L9944-2(lines 9944 9946) no Hoare annotation was computed. [2022-07-22 22:26:09,548 INFO L899 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2022-07-22 22:26:09,548 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 222 224) the Hoare annotation is: true [2022-07-22 22:26:09,548 INFO L899 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2022-07-22 22:26:09,548 INFO L899 garLoopResultBuilder]: For program point L223-3(lines 222 224) no Hoare annotation was computed. [2022-07-22 22:26:09,549 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 222 224) no Hoare annotation was computed. [2022-07-22 22:26:09,549 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2022-07-22 22:26:09,551 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:26:09,552 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-22 22:26:09,561 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1486,QUANTIFIED] [2022-07-22 22:26:09,562 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_67,QUANTIFIED] [2022-07-22 22:26:09,562 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_67,QUANTIFIED] [2022-07-22 22:26:09,568 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1486,QUANTIFIED] [2022-07-22 22:26:09,568 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_67,QUANTIFIED] [2022-07-22 22:26:09,568 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_67,QUANTIFIED] [2022-07-22 22:26:09,569 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1486,QUANTIFIED] [2022-07-22 22:26:09,569 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_67,QUANTIFIED] [2022-07-22 22:26:09,569 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_67,QUANTIFIED] [2022-07-22 22:26:09,570 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1486,QUANTIFIED] [2022-07-22 22:26:09,570 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_67,QUANTIFIED] [2022-07-22 22:26:09,570 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_67,QUANTIFIED] [2022-07-22 22:26:09,571 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.07 10:26:09 BoogieIcfgContainer [2022-07-22 22:26:09,571 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-22 22:26:09,571 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-22 22:26:09,571 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-22 22:26:09,572 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-22 22:26:09,572 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 10:23:21" (3/4) ... [2022-07-22 22:26:09,574 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-22 22:26:09,578 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure bounded_malloc [2022-07-22 22:26:09,578 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_hash_table_is_valid [2022-07-22 22:26:09,578 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure hash_table_state_is_valid [2022-07-22 22:26:09,578 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure my_memset [2022-07-22 22:26:09,578 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_bool [2022-07-22 22:26:09,578 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_mem_release [2022-07-22 22:26:09,578 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure hash_table_state_required_bytes [2022-07-22 22:26:09,578 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2022-07-22 22:26:09,578 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure memset_override_0_impl [2022-07-22 22:26:09,578 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_raise_error [2022-07-22 22:26:09,579 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure can_fail_allocator [2022-07-22 22:26:09,579 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __CPROVER_overflow_mult [2022-07-22 22:26:09,579 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_is_power_of_two [2022-07-22 22:26:09,579 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_add_size_checked [2022-07-22 22:26:09,579 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_mul_size_checked [2022-07-22 22:26:09,579 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_uint64_t [2022-07-22 22:26:09,579 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~$Pointer$~TO~VOID [2022-07-22 22:26:09,579 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2022-07-22 22:26:09,580 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __CPROVER_overflow_plus [2022-07-22 22:26:09,592 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 161 nodes and edges [2022-07-22 22:26:09,594 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 77 nodes and edges [2022-07-22 22:26:09,594 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 28 nodes and edges [2022-07-22 22:26:09,595 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2022-07-22 22:26:09,596 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2022-07-22 22:26:09,596 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-07-22 22:26:09,597 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-22 22:26:09,598 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-22 22:26:09,622 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-22 22:26:09,622 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-22 22:26:09,907 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-22 22:26:09,908 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-22 22:26:09,908 INFO L158 Benchmark]: Toolchain (without parser) took 171914.87ms. Allocated memory was 98.6MB in the beginning and 559.9MB in the end (delta: 461.4MB). Free memory was 70.3MB in the beginning and 331.4MB in the end (delta: -261.1MB). Peak memory consumption was 202.4MB. Max. memory is 16.1GB. [2022-07-22 22:26:09,908 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 98.6MB. Free memory is still 76.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 22:26:09,909 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2351.30ms. Allocated memory was 98.6MB in the beginning and 228.6MB in the end (delta: 130.0MB). Free memory was 70.0MB in the beginning and 119.7MB in the end (delta: -49.7MB). Peak memory consumption was 92.2MB. Max. memory is 16.1GB. [2022-07-22 22:26:09,909 INFO L158 Benchmark]: Boogie Procedure Inliner took 173.53ms. Allocated memory is still 228.6MB. Free memory was 119.7MB in the beginning and 167.5MB in the end (delta: -47.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-22 22:26:09,909 INFO L158 Benchmark]: Boogie Preprocessor took 88.95ms. Allocated memory is still 228.6MB. Free memory was 167.5MB in the beginning and 160.2MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-22 22:26:09,909 INFO L158 Benchmark]: RCFGBuilder took 1064.26ms. Allocated memory is still 228.6MB. Free memory was 160.2MB in the beginning and 150.7MB in the end (delta: 9.5MB). Peak memory consumption was 90.2MB. Max. memory is 16.1GB. [2022-07-22 22:26:09,910 INFO L158 Benchmark]: TraceAbstraction took 167894.79ms. Allocated memory was 228.6MB in the beginning and 559.9MB in the end (delta: 331.4MB). Free memory was 149.6MB in the beginning and 455.2MB in the end (delta: -305.5MB). Peak memory consumption was 322.6MB. Max. memory is 16.1GB. [2022-07-22 22:26:09,910 INFO L158 Benchmark]: Witness Printer took 336.40ms. Allocated memory is still 559.9MB. Free memory was 455.2MB in the beginning and 331.4MB in the end (delta: 123.7MB). Peak memory consumption was 123.7MB. Max. memory is 16.1GB. [2022-07-22 22:26:09,911 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.13ms. Allocated memory is still 98.6MB. Free memory is still 76.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2351.30ms. Allocated memory was 98.6MB in the beginning and 228.6MB in the end (delta: 130.0MB). Free memory was 70.0MB in the beginning and 119.7MB in the end (delta: -49.7MB). Peak memory consumption was 92.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 173.53ms. Allocated memory is still 228.6MB. Free memory was 119.7MB in the beginning and 167.5MB in the end (delta: -47.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 88.95ms. Allocated memory is still 228.6MB. Free memory was 167.5MB in the beginning and 160.2MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1064.26ms. Allocated memory is still 228.6MB. Free memory was 160.2MB in the beginning and 150.7MB in the end (delta: 9.5MB). Peak memory consumption was 90.2MB. Max. memory is 16.1GB. * TraceAbstraction took 167894.79ms. Allocated memory was 228.6MB in the beginning and 559.9MB in the end (delta: 331.4MB). Free memory was 149.6MB in the beginning and 455.2MB in the end (delta: -305.5MB). Peak memory consumption was 322.6MB. Max. memory is 16.1GB. * Witness Printer took 336.40ms. Allocated memory is still 559.9MB. Free memory was 455.2MB in the beginning and 331.4MB in the end (delta: 123.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.8s, OverallIterations: 16, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 9.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2716 SdHoareTripleChecker+Valid, 7.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2577 mSDsluCounter, 13816 SdHoareTripleChecker+Invalid, 6.2s 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, 1210 ImplicationChecksByTransitivity, 4.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.2s 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.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 144.6s SatisfiabilityAnalysisTime, 8.9s 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-22 22:26:09,917 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1486,QUANTIFIED] [2022-07-22 22:26:09,917 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_67,QUANTIFIED] [2022-07-22 22:26:09,917 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_67,QUANTIFIED] [2022-07-22 22:26:09,918 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1486,QUANTIFIED] [2022-07-22 22:26:09,918 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_67,QUANTIFIED] [2022-07-22 22:26:09,918 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-22 22:26:09,918 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1486,QUANTIFIED] [2022-07-22 22:26:09,918 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_67,QUANTIFIED] [2022-07-22 22:26:09,919 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_67,QUANTIFIED] [2022-07-22 22:26:09,919 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1486,QUANTIFIED] [2022-07-22 22:26:09,919 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_67,QUANTIFIED] [2022-07-22 22:26:09,919 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-22 22:26:09,937 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