./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 35987657 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-?-3598765 [2022-07-21 09:41:40,195 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 09:41:40,197 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 09:41:40,236 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 09:41:40,237 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 09:41:40,238 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 09:41:40,242 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 09:41:40,244 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 09:41:40,246 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 09:41:40,250 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 09:41:40,251 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 09:41:40,255 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 09:41:40,255 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 09:41:40,257 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 09:41:40,258 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 09:41:40,261 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 09:41:40,261 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 09:41:40,263 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 09:41:40,264 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 09:41:40,270 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 09:41:40,271 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 09:41:40,272 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 09:41:40,273 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 09:41:40,274 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 09:41:40,276 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 09:41:40,292 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 09:41:40,292 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 09:41:40,292 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 09:41:40,293 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 09:41:40,294 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 09:41:40,295 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 09:41:40,295 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 09:41:40,296 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 09:41:40,297 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 09:41:40,298 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 09:41:40,299 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 09:41:40,299 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 09:41:40,300 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 09:41:40,300 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 09:41:40,300 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 09:41:40,301 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 09:41:40,302 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 09:41:40,307 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-21 09:41:40,337 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 09:41:40,338 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 09:41:40,338 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 09:41:40,338 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 09:41:40,339 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 09:41:40,339 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 09:41:40,340 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 09:41:40,340 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 09:41:40,340 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 09:41:40,341 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 09:41:40,341 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 09:41:40,341 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 09:41:40,341 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 09:41:40,342 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 09:41:40,342 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 09:41:40,342 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 09:41:40,342 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 09:41:40,342 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 09:41:40,343 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 09:41:40,343 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 09:41:40,343 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 09:41:40,343 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 09:41:40,343 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 09:41:40,344 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 09:41:40,344 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 09:41:40,344 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 09:41:40,344 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 09:41:40,344 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 09:41:40,344 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 09:41:40,345 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 09:41:40,345 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-21 09:41:40,638 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 09:41:40,666 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 09:41:40,668 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 09:41:40,669 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 09:41:40,670 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 09:41:40,671 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-21 09:41:40,726 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3beb16d1d/d462dd1c27714903a98712831716cc30/FLAGd95393524 [2022-07-21 09:41:41,401 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 09:41:41,402 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_clean_up_harness.i [2022-07-21 09:41:41,437 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3beb16d1d/d462dd1c27714903a98712831716cc30/FLAGd95393524 [2022-07-21 09:41:41,526 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3beb16d1d/d462dd1c27714903a98712831716cc30 [2022-07-21 09:41:41,528 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 09:41:41,529 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 09:41:41,532 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 09:41:41,532 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 09:41:41,535 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 09:41:41,535 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 09:41:41" (1/1) ... [2022-07-21 09:41:41,536 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@312d61b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:41:41, skipping insertion in model container [2022-07-21 09:41:41,536 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 09:41:41" (1/1) ... [2022-07-21 09:41:41,542 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 09:41:41,651 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 09:41:41,906 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-21 09:41:41,912 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-21 09:41:42,891 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:41:42,895 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:41:42,896 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:41:42,897 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:41:42,898 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:41:42,905 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:41:42,907 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:41:42,910 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:41:42,912 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:41:42,914 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:41:42,915 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:41:42,916 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:41:42,916 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:41:43,246 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-21 09:41:43,247 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-21 09:41:43,248 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-21 09:41:43,255 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-21 09:41:43,258 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-21 09:41:43,258 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-21 09:41:43,259 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-21 09:41:43,260 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-21 09:41:43,261 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-21 09:41:43,265 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-21 09:41:43,413 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-21 09:41:43,628 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:41:43,628 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:41:43,643 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:41:43,645 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:41:43,650 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:41:43,650 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:41:43,666 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:41:43,666 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:41:43,667 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:41:43,668 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:41:43,668 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:41:43,668 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:41:43,669 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:41:43,702 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 09:41:43,737 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 09:41:43,758 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-21 09:41:43,759 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-21 09:41:43,793 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:41:43,794 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:41:43,794 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:41:43,794 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:41:43,795 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:41:43,801 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:41:43,802 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:41:43,803 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:41:43,803 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:41:43,804 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:41:43,804 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:41:43,805 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:41:43,805 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:41:43,849 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-21 09:41:43,850 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-21 09:41:43,850 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-21 09:41:43,851 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-21 09:41:43,851 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-21 09:41:43,851 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-21 09:41:43,854 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-21 09:41:43,854 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-21 09:41:43,854 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-21 09:41:43,855 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-21 09:41:43,874 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-21 09:41:43,966 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:41:43,966 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:41:43,973 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:41:43,973 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:41:43,975 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:41:43,975 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:41:43,985 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:41:43,986 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:41:43,986 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:41:43,986 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:41:43,987 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:41:43,987 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:41:43,988 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-21 09:41:44,001 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 09:41:44,315 INFO L208 MainTranslator]: Completed translation [2022-07-21 09:41:44,315 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:41:44 WrapperNode [2022-07-21 09:41:44,315 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 09:41:44,316 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 09:41:44,316 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 09:41:44,316 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 09:41:44,320 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:41:44" (1/1) ... [2022-07-21 09:41:44,448 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:41:44" (1/1) ... [2022-07-21 09:41:44,514 INFO L137 Inliner]: procedures = 775, calls = 2445, calls flagged for inlining = 71, calls inlined = 16, statements flattened = 721 [2022-07-21 09:41:44,515 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 09:41:44,517 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 09:41:44,517 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 09:41:44,517 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 09:41:44,524 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:41:44" (1/1) ... [2022-07-21 09:41:44,525 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:41:44" (1/1) ... [2022-07-21 09:41:44,537 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:41:44" (1/1) ... [2022-07-21 09:41:44,538 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:41:44" (1/1) ... [2022-07-21 09:41:44,587 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:41:44" (1/1) ... [2022-07-21 09:41:44,591 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:41:44" (1/1) ... [2022-07-21 09:41:44,608 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:41:44" (1/1) ... [2022-07-21 09:41:44,626 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 09:41:44,631 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 09:41:44,631 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 09:41:44,631 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 09:41:44,632 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:41:44" (1/1) ... [2022-07-21 09:41:44,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 09:41:44,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:41:44,683 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-21 09:41:44,708 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-21 09:41:44,736 INFO L130 BoogieDeclarations]: Found specification of procedure memset_override_0_impl [2022-07-21 09:41:44,736 INFO L138 BoogieDeclarations]: Found implementation of procedure memset_override_0_impl [2022-07-21 09:41:44,736 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-07-21 09:41:44,737 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2022-07-21 09:41:44,737 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2022-07-21 09:41:44,737 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-21 09:41:44,738 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2022-07-21 09:41:44,738 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2022-07-21 09:41:44,738 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-21 09:41:44,738 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-21 09:41:44,738 INFO L130 BoogieDeclarations]: Found specification of procedure hash_table_state_is_valid [2022-07-21 09:41:44,738 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_table_state_is_valid [2022-07-21 09:41:44,739 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-21 09:41:44,739 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 09:41:44,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-21 09:41:44,739 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 09:41:44,739 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 09:41:44,739 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2022-07-21 09:41:44,740 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2022-07-21 09:41:44,740 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mul_size_checked [2022-07-21 09:41:44,740 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mul_size_checked [2022-07-21 09:41:44,740 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mem_release [2022-07-21 09:41:44,740 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mem_release [2022-07-21 09:41:44,740 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-21 09:41:44,740 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_plus [2022-07-21 09:41:44,741 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_plus [2022-07-21 09:41:44,741 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-21 09:41:44,741 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-07-21 09:41:44,741 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-07-21 09:41:44,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-21 09:41:44,741 INFO L130 BoogieDeclarations]: Found specification of procedure my_memset [2022-07-21 09:41:44,741 INFO L138 BoogieDeclarations]: Found implementation of procedure my_memset [2022-07-21 09:41:44,741 INFO L130 BoogieDeclarations]: Found specification of procedure aws_is_power_of_two [2022-07-21 09:41:44,742 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_is_power_of_two [2022-07-21 09:41:44,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 09:41:44,742 INFO L130 BoogieDeclarations]: Found specification of procedure hash_table_state_required_bytes [2022-07-21 09:41:44,742 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_table_state_required_bytes [2022-07-21 09:41:44,743 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-07-21 09:41:44,743 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-07-21 09:41:44,743 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-21 09:41:44,743 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-21 09:41:44,743 INFO L130 BoogieDeclarations]: Found specification of procedure aws_hash_table_is_valid [2022-07-21 09:41:44,744 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_hash_table_is_valid [2022-07-21 09:41:44,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-21 09:41:44,747 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2022-07-21 09:41:44,747 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2022-07-21 09:41:44,747 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_mult [2022-07-21 09:41:44,747 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_mult [2022-07-21 09:41:44,748 INFO L130 BoogieDeclarations]: Found specification of procedure aws_add_size_checked [2022-07-21 09:41:44,748 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_add_size_checked [2022-07-21 09:41:44,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 09:41:45,063 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 09:41:45,065 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 09:41:45,901 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 09:41:45,908 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 09:41:45,908 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-21 09:41:45,910 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 09:41:45 BoogieIcfgContainer [2022-07-21 09:41:45,910 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 09:41:45,912 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 09:41:45,912 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 09:41:45,914 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 09:41:45,915 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 09:41:41" (1/3) ... [2022-07-21 09:41:45,915 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f344729 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 09:41:45, skipping insertion in model container [2022-07-21 09:41:45,915 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:41:44" (2/3) ... [2022-07-21 09:41:45,916 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f344729 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 09:41:45, skipping insertion in model container [2022-07-21 09:41:45,916 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 09:41:45" (3/3) ... [2022-07-21 09:41:45,917 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_hash_table_clean_up_harness.i [2022-07-21 09:41:45,928 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 09:41:45,929 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-21 09:41:45,986 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 09:41:45,996 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@1a1e24c, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3ed27312 [2022-07-21 09:41:45,996 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-21 09:41:46,001 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-21 09:41:46,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-07-21 09:41:46,015 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:41:46,016 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-21 09:41:46,016 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:41:46,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:41:46,021 INFO L85 PathProgramCache]: Analyzing trace with hash -623915720, now seen corresponding path program 1 times [2022-07-21 09:41:46,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:41:46,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666955603] [2022-07-21 09:41:46,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:41:46,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:41:46,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:46,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:41:46,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:46,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 09:41:46,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:46,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 09:41:46,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:46,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 09:41:46,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:46,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 09:41:46,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:41:46,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666955603] [2022-07-21 09:41:46,641 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2022-07-21 09:41:46,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1532832699] [2022-07-21 09:41:46,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:41:46,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:41:46,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:41:46,644 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-21 09:41:46,645 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-21 09:41:47,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:47,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 2338 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-21 09:41:47,157 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:41:47,178 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-21 09:41:47,178 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 09:41:47,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1532832699] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:41:47,179 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:41:47,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 09:41:47,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86660455] [2022-07-21 09:41:47,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:41:47,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-21 09:41:47,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:41:47,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-21 09:41:47,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 09:41:47,208 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-21 09:41:47,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:41:47,244 INFO L93 Difference]: Finished difference Result 383 states and 508 transitions. [2022-07-21 09:41:47,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-21 09:41:47,246 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-21 09:41:47,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:41:47,253 INFO L225 Difference]: With dead ends: 383 [2022-07-21 09:41:47,253 INFO L226 Difference]: Without dead ends: 187 [2022-07-21 09:41:47,257 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-21 09:41:47,264 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-21 09:41:47,265 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-21 09:41:47,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2022-07-21 09:41:47,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2022-07-21 09:41:47,305 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-21 09:41:47,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 233 transitions. [2022-07-21 09:41:47,310 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 233 transitions. Word has length 134 [2022-07-21 09:41:47,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:41:47,311 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 233 transitions. [2022-07-21 09:41:47,311 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-21 09:41:47,312 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 233 transitions. [2022-07-21 09:41:47,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-07-21 09:41:47,314 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:41:47,314 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-21 09:41:47,345 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-21 09:41:47,539 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-21 09:41:47,540 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:41:47,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:41:47,540 INFO L85 PathProgramCache]: Analyzing trace with hash -428434944, now seen corresponding path program 1 times [2022-07-21 09:41:47,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:41:47,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373274419] [2022-07-21 09:41:47,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:41:47,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:41:47,659 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-21 09:41:47,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1668400230] [2022-07-21 09:41:47,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:41:47,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:41:47,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:41:47,662 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-21 09:41:47,663 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-21 09:41:48,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:48,135 INFO L263 TraceCheckSpWp]: Trace formula consists of 2338 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-21 09:41:48,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:41:48,179 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-21 09:41:48,179 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 09:41:48,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:41:48,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373274419] [2022-07-21 09:41:48,180 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-21 09:41:48,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1668400230] [2022-07-21 09:41:48,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1668400230] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:41:48,181 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:41:48,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 09:41:48,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430381491] [2022-07-21 09:41:48,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:41:48,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 09:41:48,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:41:48,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 09:41:48,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 09:41:48,183 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-21 09:41:48,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:41:48,231 INFO L93 Difference]: Finished difference Result 337 states and 421 transitions. [2022-07-21 09:41:48,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 09:41:48,232 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-21 09:41:48,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:41:48,234 INFO L225 Difference]: With dead ends: 337 [2022-07-21 09:41:48,234 INFO L226 Difference]: Without dead ends: 192 [2022-07-21 09:41:48,235 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-21 09:41:48,238 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-21 09:41:48,239 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-21 09:41:48,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2022-07-21 09:41:48,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2022-07-21 09:41:48,259 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-21 09:41:48,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 238 transitions. [2022-07-21 09:41:48,263 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 238 transitions. Word has length 134 [2022-07-21 09:41:48,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:41:48,265 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 238 transitions. [2022-07-21 09:41:48,265 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-21 09:41:48,265 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 238 transitions. [2022-07-21 09:41:48,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-07-21 09:41:48,273 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:41:48,273 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-21 09:41:48,303 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-21 09:41:48,499 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-21 09:41:48,499 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:41:48,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:41:48,500 INFO L85 PathProgramCache]: Analyzing trace with hash -447704184, now seen corresponding path program 1 times [2022-07-21 09:41:48,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:41:48,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333964860] [2022-07-21 09:41:48,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:41:48,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:41:48,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:48,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:41:48,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:48,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 09:41:48,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:48,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 09:41:48,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:48,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 09:41:48,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:48,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 09:41:48,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:48,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:41:48,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:48,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:41:48,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:48,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 09:41:48,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:48,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-21 09:41:48,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:48,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-21 09:41:48,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:48,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:41:48,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:49,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-21 09:41:49,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:49,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-21 09:41:49,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:49,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-21 09:41:49,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:49,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-21 09:41:49,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:49,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-21 09:41:49,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:49,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 09:41:49,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:49,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-21 09:41:49,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:49,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-21 09:41:49,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:49,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-21 09:41:49,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:49,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-21 09:41:49,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:49,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-21 09:41:49,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:49,171 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-21 09:41:49,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:41:49,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333964860] [2022-07-21 09:41:49,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333964860] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:41:49,172 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:41:49,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-21 09:41:49,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633054742] [2022-07-21 09:41:49,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:41:49,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-21 09:41:49,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:41:49,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-21 09:41:49,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2022-07-21 09:41:49,175 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-21 09:41:50,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:41:50,319 INFO L93 Difference]: Finished difference Result 348 states and 437 transitions. [2022-07-21 09:41:50,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-21 09:41:50,319 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-21 09:41:50,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:41:50,322 INFO L225 Difference]: With dead ends: 348 [2022-07-21 09:41:50,322 INFO L226 Difference]: Without dead ends: 217 [2022-07-21 09:41:50,323 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-21 09:41:50,324 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 170 mSDsluCounter, 777 mSDsCounter, 0 mSdLazyCounter, 1051 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 974 SdHoareTripleChecker+Invalid, 1132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 1051 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-21 09:41:50,324 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 974 Invalid, 1132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 1051 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-21 09:41:50,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2022-07-21 09:41:50,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 197. [2022-07-21 09:41:50,345 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-21 09:41:50,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 246 transitions. [2022-07-21 09:41:50,348 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 246 transitions. Word has length 140 [2022-07-21 09:41:50,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:41:50,348 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 246 transitions. [2022-07-21 09:41:50,348 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-21 09:41:50,349 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 246 transitions. [2022-07-21 09:41:50,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-07-21 09:41:50,353 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:41:50,353 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-21 09:41:50,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-21 09:41:50,353 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:41:50,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:41:50,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1286400266, now seen corresponding path program 1 times [2022-07-21 09:41:50,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:41:50,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863242806] [2022-07-21 09:41:50,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:41:50,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:41:50,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:50,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:41:50,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:50,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 09:41:50,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:50,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 09:41:50,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:50,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 09:41:50,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:50,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 09:41:50,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:50,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:41:50,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:50,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:41:50,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:50,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 09:41:50,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:50,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-21 09:41:50,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:50,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-21 09:41:50,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:50,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:41:50,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:50,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-21 09:41:50,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:50,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-21 09:41:50,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:50,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-21 09:41:50,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:50,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-21 09:41:50,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:50,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-21 09:41:50,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:50,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 09:41:50,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:50,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-21 09:41:50,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:50,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-21 09:41:50,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:50,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-21 09:41:50,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:50,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-21 09:41:50,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:50,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-21 09:41:50,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:50,823 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-21 09:41:50,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:41:50,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863242806] [2022-07-21 09:41:50,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863242806] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:41:50,824 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:41:50,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 09:41:50,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303598846] [2022-07-21 09:41:50,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:41:50,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 09:41:50,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:41:50,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 09:41:50,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-21 09:41:50,827 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-21 09:41:51,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:41:51,371 INFO L93 Difference]: Finished difference Result 355 states and 449 transitions. [2022-07-21 09:41:51,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 09:41:51,372 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-21 09:41:51,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:41:51,374 INFO L225 Difference]: With dead ends: 355 [2022-07-21 09:41:51,374 INFO L226 Difference]: Without dead ends: 219 [2022-07-21 09:41:51,375 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-21 09:41:51,375 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-21 09:41:51,376 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-21 09:41:51,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2022-07-21 09:41:51,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 199. [2022-07-21 09:41:51,390 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-21 09:41:51,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 249 transitions. [2022-07-21 09:41:51,391 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 249 transitions. Word has length 140 [2022-07-21 09:41:51,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:41:51,391 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 249 transitions. [2022-07-21 09:41:51,392 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-21 09:41:51,392 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 249 transitions. [2022-07-21 09:41:51,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-07-21 09:41:51,393 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:41:51,393 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-21 09:41:51,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-21 09:41:51,393 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:41:51,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:41:51,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1325960714, now seen corresponding path program 1 times [2022-07-21 09:41:51,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:41:51,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524764311] [2022-07-21 09:41:51,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:41:51,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:41:51,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:51,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:41:51,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:51,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 09:41:51,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:51,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 09:41:51,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:51,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 09:41:51,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:51,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 09:41:51,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:51,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:41:51,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:51,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:41:51,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:51,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 09:41:51,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:51,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-21 09:41:51,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:51,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-21 09:41:51,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:51,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:41:51,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:51,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-21 09:41:51,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:51,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 09:41:51,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:51,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-21 09:41:51,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:51,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-21 09:41:51,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:51,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-21 09:41:51,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:51,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 09:41:51,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:51,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-21 09:41:51,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:51,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-21 09:41:51,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:51,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-21 09:41:51,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:51,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-21 09:41:51,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:51,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-21 09:41:51,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:51,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-21 09:41:51,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:51,776 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-21 09:41:51,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:41:51,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524764311] [2022-07-21 09:41:51,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524764311] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:41:51,777 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:41:51,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-21 09:41:51,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885406955] [2022-07-21 09:41:51,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:41:51,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-21 09:41:51,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:41:51,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-21 09:41:51,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-21 09:41:51,779 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-21 09:41:52,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:41:52,562 INFO L93 Difference]: Finished difference Result 357 states and 457 transitions. [2022-07-21 09:41:52,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-21 09:41:52,563 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-21 09:41:52,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:41:52,565 INFO L225 Difference]: With dead ends: 357 [2022-07-21 09:41:52,565 INFO L226 Difference]: Without dead ends: 217 [2022-07-21 09:41:52,566 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-21 09:41:52,566 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-21 09:41:52,567 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-21 09:41:52,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2022-07-21 09:41:52,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 199. [2022-07-21 09:41:52,579 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-21 09:41:52,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 248 transitions. [2022-07-21 09:41:52,580 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 248 transitions. Word has length 146 [2022-07-21 09:41:52,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:41:52,580 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 248 transitions. [2022-07-21 09:41:52,581 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-21 09:41:52,581 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 248 transitions. [2022-07-21 09:41:52,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-07-21 09:41:52,582 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:41:52,583 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-21 09:41:52,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-21 09:41:52,583 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:41:52,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:41:52,583 INFO L85 PathProgramCache]: Analyzing trace with hash -133220748, now seen corresponding path program 1 times [2022-07-21 09:41:52,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:41:52,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233466863] [2022-07-21 09:41:52,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:41:52,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:41:52,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:52,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:41:52,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:52,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 09:41:52,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:52,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 09:41:52,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:52,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 09:41:52,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:52,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 09:41:52,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:52,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:41:52,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:52,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:41:52,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:52,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 09:41:52,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:52,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-21 09:41:52,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:52,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-21 09:41:52,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:52,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:41:52,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:52,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-21 09:41:52,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:52,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 09:41:52,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:52,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:41:52,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:52,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-21 09:41:52,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:52,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-21 09:41:52,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:52,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-21 09:41:52,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:52,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-21 09:41:52,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:53,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-21 09:41:53,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:53,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-21 09:41:53,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:53,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-21 09:41:53,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:53,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-21 09:41:53,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:53,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-21 09:41:53,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:53,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-21 09:41:53,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:53,055 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-21 09:41:53,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:41:53,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233466863] [2022-07-21 09:41:53,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233466863] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:41:53,056 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:41:53,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-21 09:41:53,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691610199] [2022-07-21 09:41:53,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:41:53,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-21 09:41:53,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:41:53,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-21 09:41:53,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-07-21 09:41:53,058 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-21 09:41:53,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:41:53,955 INFO L93 Difference]: Finished difference Result 232 states and 287 transitions. [2022-07-21 09:41:53,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-21 09:41:53,956 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-21 09:41:53,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:41:53,958 INFO L225 Difference]: With dead ends: 232 [2022-07-21 09:41:53,958 INFO L226 Difference]: Without dead ends: 230 [2022-07-21 09:41:53,958 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2022-07-21 09:41:53,959 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 220 mSDsluCounter, 657 mSDsCounter, 0 mSdLazyCounter, 1008 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 844 SdHoareTripleChecker+Invalid, 1166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 1008 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-21 09:41:53,959 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 844 Invalid, 1166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 1008 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-21 09:41:53,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2022-07-21 09:41:53,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 203. [2022-07-21 09:41:53,970 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-21 09:41:53,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 251 transitions. [2022-07-21 09:41:53,972 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 251 transitions. Word has length 151 [2022-07-21 09:41:53,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:41:53,972 INFO L495 AbstractCegarLoop]: Abstraction has 203 states and 251 transitions. [2022-07-21 09:41:53,973 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-21 09:41:53,973 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 251 transitions. [2022-07-21 09:41:53,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-07-21 09:41:53,975 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:41:53,975 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-21 09:41:53,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-21 09:41:53,975 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:41:53,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:41:53,976 INFO L85 PathProgramCache]: Analyzing trace with hash -777949396, now seen corresponding path program 1 times [2022-07-21 09:41:53,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:41:53,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653209842] [2022-07-21 09:41:53,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:41:53,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:41:54,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:54,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:41:54,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:54,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 09:41:54,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:54,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 09:41:54,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:54,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 09:41:54,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:54,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 09:41:54,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:54,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:41:54,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:54,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:41:54,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:54,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 09:41:54,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:54,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-21 09:41:54,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:54,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-21 09:41:54,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:54,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:41:54,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:54,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-21 09:41:54,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:54,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 09:41:54,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:54,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:41:54,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:54,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-21 09:41:54,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:54,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-21 09:41:54,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:54,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-21 09:41:54,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:54,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-21 09:41:54,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:54,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-21 09:41:54,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:54,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-21 09:41:54,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:54,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-21 09:41:54,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:54,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-21 09:41:54,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:54,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-21 09:41:54,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:54,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-21 09:41:54,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:54,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-21 09:41:55,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:55,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-21 09:41:55,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:55,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-21 09:41:55,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:55,025 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-21 09:41:55,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:41:55,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653209842] [2022-07-21 09:41:55,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653209842] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:41:55,025 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:41:55,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-07-21 09:41:55,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605744697] [2022-07-21 09:41:55,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:41:55,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-21 09:41:55,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:41:55,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-21 09:41:55,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2022-07-21 09:41:55,028 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-21 09:41:57,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:41:57,025 INFO L93 Difference]: Finished difference Result 259 states and 314 transitions. [2022-07-21 09:41:57,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-21 09:41:57,026 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-21 09:41:57,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:41:57,028 INFO L225 Difference]: With dead ends: 259 [2022-07-21 09:41:57,029 INFO L226 Difference]: Without dead ends: 233 [2022-07-21 09:41:57,029 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=161, Invalid=1099, Unknown=0, NotChecked=0, Total=1260 [2022-07-21 09:41:57,030 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 370 mSDsluCounter, 813 mSDsCounter, 0 mSdLazyCounter, 2530 mSolverCounterSat, 255 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s 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.6s IncrementalHoareTripleChecker+Time [2022-07-21 09:41:57,030 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.6s Time] [2022-07-21 09:41:57,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2022-07-21 09:41:57,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 203. [2022-07-21 09:41:57,047 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-21 09:41:57,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 250 transitions. [2022-07-21 09:41:57,048 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 250 transitions. Word has length 169 [2022-07-21 09:41:57,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:41:57,049 INFO L495 AbstractCegarLoop]: Abstraction has 203 states and 250 transitions. [2022-07-21 09:41:57,049 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-21 09:41:57,049 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 250 transitions. [2022-07-21 09:41:57,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-07-21 09:41:57,051 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:41:57,051 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-21 09:41:57,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-21 09:41:57,052 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:41:57,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:41:57,052 INFO L85 PathProgramCache]: Analyzing trace with hash 442702791, now seen corresponding path program 1 times [2022-07-21 09:41:57,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:41:57,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319145589] [2022-07-21 09:41:57,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:41:57,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:41:57,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:57,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:41:57,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:57,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 09:41:57,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:57,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 09:41:57,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:57,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 09:41:57,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:57,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 09:41:57,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:57,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:41:57,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:57,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:41:57,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:57,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 09:41:57,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:57,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-21 09:41:57,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:57,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-21 09:41:57,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:57,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:41:57,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:57,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-21 09:41:57,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:57,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 09:41:57,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:57,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:41:57,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:57,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-21 09:41:57,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:57,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-21 09:41:57,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:57,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-21 09:41:57,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:57,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-21 09:41:57,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:57,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-21 09:41:57,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:57,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-21 09:41:57,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:57,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-21 09:41:57,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:57,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-21 09:41:57,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:57,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-21 09:41:57,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:57,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-21 09:41:57,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:57,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-21 09:41:57,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:57,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-21 09:41:57,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:57,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-21 09:41:57,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:57,409 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-21 09:41:57,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:41:57,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319145589] [2022-07-21 09:41:57,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319145589] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:41:57,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:41:57,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 09:41:57,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603230232] [2022-07-21 09:41:57,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:41:57,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 09:41:57,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:41:57,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 09:41:57,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-21 09:41:57,412 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-21 09:41:57,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:41:57,751 INFO L93 Difference]: Finished difference Result 307 states and 371 transitions. [2022-07-21 09:41:57,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 09:41:57,752 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-21 09:41:57,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:41:57,754 INFO L225 Difference]: With dead ends: 307 [2022-07-21 09:41:57,754 INFO L226 Difference]: Without dead ends: 221 [2022-07-21 09:41:57,754 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-21 09:41:57,755 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 133 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 09:41:57,755 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-21 09:41:57,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2022-07-21 09:41:57,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 204. [2022-07-21 09:41:57,770 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-21 09:41:57,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 251 transitions. [2022-07-21 09:41:57,771 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 251 transitions. Word has length 176 [2022-07-21 09:41:57,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:41:57,773 INFO L495 AbstractCegarLoop]: Abstraction has 204 states and 251 transitions. [2022-07-21 09:41:57,773 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-21 09:41:57,773 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 251 transitions. [2022-07-21 09:41:57,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-07-21 09:41:57,775 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:41:57,776 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-21 09:41:57,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-21 09:41:57,776 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:41:57,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:41:57,777 INFO L85 PathProgramCache]: Analyzing trace with hash -578365563, now seen corresponding path program 1 times [2022-07-21 09:41:57,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:41:57,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023186877] [2022-07-21 09:41:57,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:41:57,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:41:57,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:57,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:41:57,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:57,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 09:41:57,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:57,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 09:41:57,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:57,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 09:41:57,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:57,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 09:41:57,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:57,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:41:57,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:58,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:41:58,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:58,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 09:41:58,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:58,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-21 09:41:58,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:58,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-21 09:41:58,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:58,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:41:58,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:58,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-21 09:41:58,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:58,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 09:41:58,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:58,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:41:58,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:58,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-21 09:41:58,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:58,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-21 09:41:58,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:58,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-21 09:41:58,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:58,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-21 09:41:58,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:58,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-21 09:41:58,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:58,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-21 09:41:58,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:58,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-21 09:41:58,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:58,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-21 09:41:58,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:58,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-21 09:41:58,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:58,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-21 09:41:58,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:58,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-21 09:41:58,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:58,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-21 09:41:58,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:58,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-21 09:41:58,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:58,155 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-21 09:41:58,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:41:58,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023186877] [2022-07-21 09:41:58,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023186877] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:41:58,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:41:58,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 09:41:58,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709323075] [2022-07-21 09:41:58,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:41:58,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 09:41:58,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:41:58,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 09:41:58,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-21 09:41:58,158 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-21 09:41:58,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:41:58,741 INFO L93 Difference]: Finished difference Result 331 states and 405 transitions. [2022-07-21 09:41:58,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 09:41:58,742 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-21 09:41:58,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:41:58,743 INFO L225 Difference]: With dead ends: 331 [2022-07-21 09:41:58,743 INFO L226 Difference]: Without dead ends: 221 [2022-07-21 09:41:58,744 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-21 09:41:58,744 INFO L413 NwaCegarLoop]: 202 mSDtfsCounter, 93 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 642 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-21 09:41:58,745 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-21 09:41:58,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2022-07-21 09:41:58,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 204. [2022-07-21 09:41:58,769 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-21 09:41:58,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 250 transitions. [2022-07-21 09:41:58,770 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 250 transitions. Word has length 176 [2022-07-21 09:41:58,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:41:58,773 INFO L495 AbstractCegarLoop]: Abstraction has 204 states and 250 transitions. [2022-07-21 09:41:58,774 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-21 09:41:58,774 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 250 transitions. [2022-07-21 09:41:58,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2022-07-21 09:41:58,776 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:41:58,777 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-21 09:41:58,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-21 09:41:58,777 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:41:58,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:41:58,777 INFO L85 PathProgramCache]: Analyzing trace with hash -361857032, now seen corresponding path program 1 times [2022-07-21 09:41:58,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:41:58,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005385238] [2022-07-21 09:41:58,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:41:58,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:41:58,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:58,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:41:58,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:58,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 09:41:58,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:58,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 09:41:58,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:58,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 09:41:58,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:58,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 09:41:58,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:58,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:41:58,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:58,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:41:58,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:58,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 09:41:58,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:58,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-21 09:41:58,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:58,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-21 09:41:59,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:59,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:41:59,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:59,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-21 09:41:59,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:59,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 09:41:59,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:59,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:41:59,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:59,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-21 09:41:59,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:59,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-21 09:41:59,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:59,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-21 09:41:59,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:59,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-21 09:41:59,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:59,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-21 09:41:59,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:59,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-21 09:41:59,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:59,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-21 09:41:59,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:59,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-21 09:41:59,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:59,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-21 09:41:59,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:59,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-21 09:41:59,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:59,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-21 09:41:59,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:59,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-21 09:41:59,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:59,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-21 09:41:59,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:59,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-21 09:41:59,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:59,175 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-21 09:41:59,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:41:59,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005385238] [2022-07-21 09:41:59,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005385238] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:41:59,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [469438589] [2022-07-21 09:41:59,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:41:59,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:41:59,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:41:59,178 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-21 09:41:59,192 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-21 09:41:59,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:41:59,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 2530 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-21 09:41:59,677 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:41:59,868 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-21 09:41:59,868 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 09:42:00,277 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-21 09:42:00,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [469438589] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 09:42:00,278 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 09:42:00,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 9] total 24 [2022-07-21 09:42:00,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089628463] [2022-07-21 09:42:00,279 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 09:42:00,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-21 09:42:00,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:42:00,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-21 09:42:00,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=498, Unknown=0, NotChecked=0, Total=552 [2022-07-21 09:42:00,282 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-21 09:42:02,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:42:02,119 INFO L93 Difference]: Finished difference Result 342 states and 420 transitions. [2022-07-21 09:42:02,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-21 09:42:02,120 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-21 09:42:02,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:42:02,122 INFO L225 Difference]: With dead ends: 342 [2022-07-21 09:42:02,122 INFO L226 Difference]: Without dead ends: 230 [2022-07-21 09:42:02,123 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-21 09:42:02,123 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 504 mSDsluCounter, 1266 mSDsCounter, 0 mSdLazyCounter, 2193 mSolverCounterSat, 385 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s 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.3s IncrementalHoareTripleChecker+Time [2022-07-21 09:42:02,123 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.3s Time] [2022-07-21 09:42:02,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2022-07-21 09:42:02,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 210. [2022-07-21 09:42:02,139 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-21 09:42:02,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 257 transitions. [2022-07-21 09:42:02,140 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 257 transitions. Word has length 185 [2022-07-21 09:42:02,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:42:02,141 INFO L495 AbstractCegarLoop]: Abstraction has 210 states and 257 transitions. [2022-07-21 09:42:02,141 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-21 09:42:02,141 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 257 transitions. [2022-07-21 09:42:02,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2022-07-21 09:42:02,143 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:42:02,143 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-21 09:42:02,170 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-21 09:42:02,363 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-21 09:42:02,364 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:42:02,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:42:02,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1707074820, now seen corresponding path program 1 times [2022-07-21 09:42:02,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:42:02,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779002584] [2022-07-21 09:42:02,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:42:02,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:42:02,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:02,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:42:02,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:02,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 09:42:02,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:02,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 09:42:02,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:02,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 09:42:02,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:02,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 09:42:02,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:02,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:42:02,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:02,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:42:02,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:02,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 09:42:02,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:02,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-21 09:42:02,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:02,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-21 09:42:02,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:02,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:42:02,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:02,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-21 09:42:02,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:02,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 09:42:02,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:02,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:42:02,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:02,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-21 09:42:02,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:02,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-21 09:42:02,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:02,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-21 09:42:02,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:02,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-21 09:42:02,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:02,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-21 09:42:02,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:02,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-21 09:42:03,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:03,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-21 09:42:03,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:03,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-21 09:42:03,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:03,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-21 09:42:03,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:03,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-21 09:42:03,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:03,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-21 09:42:03,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:03,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-21 09:42:03,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:03,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 09:42:03,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:03,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:42:03,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:03,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-21 09:42:03,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:03,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-07-21 09:42:03,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:03,142 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-21 09:42:03,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:42:03,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779002584] [2022-07-21 09:42:03,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779002584] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:42:03,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1997060981] [2022-07-21 09:42:03,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:42:03,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:42:03,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:42:03,148 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-21 09:42:03,149 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-21 09:42:03,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:03,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 2579 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-21 09:42:03,650 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:42:03,831 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-21 09:42:03,831 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 09:42:03,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1997060981] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:42:03,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 09:42:03,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [13] total 18 [2022-07-21 09:42:03,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834371218] [2022-07-21 09:42:03,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:42:03,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 09:42:03,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:42:03,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 09:42:03,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2022-07-21 09:42:03,833 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-21 09:42:04,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:42:04,038 INFO L93 Difference]: Finished difference Result 327 states and 397 transitions. [2022-07-21 09:42:04,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 09:42:04,038 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-21 09:42:04,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:42:04,040 INFO L225 Difference]: With dead ends: 327 [2022-07-21 09:42:04,040 INFO L226 Difference]: Without dead ends: 210 [2022-07-21 09:42:04,041 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-21 09:42:04,041 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-21 09:42:04,041 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-21 09:42:04,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2022-07-21 09:42:04,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 207. [2022-07-21 09:42:04,058 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-21 09:42:04,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 252 transitions. [2022-07-21 09:42:04,062 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 252 transitions. Word has length 196 [2022-07-21 09:42:04,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:42:04,062 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 252 transitions. [2022-07-21 09:42:04,062 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-21 09:42:04,063 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 252 transitions. [2022-07-21 09:42:04,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2022-07-21 09:42:04,064 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:42:04,065 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-21 09:42:04,097 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-21 09:42:04,287 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-21 09:42:04,287 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:42:04,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:42:04,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1755111832, now seen corresponding path program 1 times [2022-07-21 09:42:04,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:42:04,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440637297] [2022-07-21 09:42:04,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:42:04,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:42:04,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:04,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:42:04,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:04,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 09:42:04,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:04,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 09:42:04,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:04,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 09:42:04,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:04,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 09:42:04,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:04,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:42:04,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:04,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:42:04,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:04,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 09:42:04,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:04,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-21 09:42:04,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:04,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-21 09:42:04,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:04,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:42:04,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:04,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-21 09:42:04,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:04,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 09:42:04,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:04,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:42:04,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:04,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-21 09:42:04,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:04,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-21 09:42:04,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:04,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-21 09:42:04,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:04,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-21 09:42:04,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:04,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-21 09:42:04,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:04,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-21 09:42:04,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:04,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-21 09:42:04,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:04,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-21 09:42:04,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:04,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-21 09:42:04,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:04,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-21 09:42:04,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:04,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 09:42:04,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:04,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:42:04,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:04,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-21 09:42:04,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:04,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-21 09:42:04,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:04,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 09:42:04,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:04,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:42:04,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:04,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-07-21 09:42:04,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:04,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2022-07-21 09:42:04,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:04,873 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-21 09:42:04,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:42:04,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440637297] [2022-07-21 09:42:04,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440637297] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:42:04,874 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:42:04,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-21 09:42:04,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049771936] [2022-07-21 09:42:04,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:42:04,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-21 09:42:04,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:42:04,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-21 09:42:04,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-07-21 09:42:04,876 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-21 09:42:05,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:42:05,605 INFO L93 Difference]: Finished difference Result 230 states and 278 transitions. [2022-07-21 09:42:05,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-21 09:42:05,606 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-21 09:42:05,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:42:05,607 INFO L225 Difference]: With dead ends: 230 [2022-07-21 09:42:05,607 INFO L226 Difference]: Without dead ends: 228 [2022-07-21 09:42:05,608 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2022-07-21 09:42:05,608 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 122 mSDsluCounter, 901 mSDsCounter, 0 mSdLazyCounter, 872 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2022-07-21 09:42:05,609 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.6s Time] [2022-07-21 09:42:05,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2022-07-21 09:42:05,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 211. [2022-07-21 09:42:05,623 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-21 09:42:05,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 255 transitions. [2022-07-21 09:42:05,624 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 255 transitions. Word has length 207 [2022-07-21 09:42:05,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:42:05,625 INFO L495 AbstractCegarLoop]: Abstraction has 211 states and 255 transitions. [2022-07-21 09:42:05,625 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-21 09:42:05,625 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 255 transitions. [2022-07-21 09:42:05,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2022-07-21 09:42:05,627 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:42:05,628 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-21 09:42:05,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-21 09:42:05,628 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:42:05,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:42:05,628 INFO L85 PathProgramCache]: Analyzing trace with hash 2124808202, now seen corresponding path program 1 times [2022-07-21 09:42:05,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:42:05,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657557804] [2022-07-21 09:42:05,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:42:05,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:42:06,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:06,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:42:06,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:06,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 09:42:06,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:06,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 09:42:06,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:06,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 09:42:06,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:06,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 09:42:06,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:06,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:42:06,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:06,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:42:06,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:06,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 09:42:06,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:06,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-21 09:42:06,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:06,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-21 09:42:06,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:06,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:42:06,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:06,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-21 09:42:06,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:06,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 09:42:06,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:06,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:42:06,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:06,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-21 09:42:06,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:06,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-21 09:42:06,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:06,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-21 09:42:06,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:06,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-21 09:42:06,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:06,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-21 09:42:06,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:06,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-21 09:42:06,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:06,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-21 09:42:06,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:06,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-21 09:42:06,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:06,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-21 09:42:06,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:06,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-21 09:42:06,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:06,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 09:42:06,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:06,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:42:06,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:06,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-21 09:42:06,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:06,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-21 09:42:06,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:06,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 09:42:06,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:06,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:42:06,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:06,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-07-21 09:42:06,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:06,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2022-07-21 09:42:06,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:06,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2022-07-21 09:42:06,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:06,708 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-21 09:42:06,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:42:06,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657557804] [2022-07-21 09:42:06,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657557804] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:42:06,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2106252619] [2022-07-21 09:42:06,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:42:06,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:42:06,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:42:06,711 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-21 09:42:06,741 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-21 09:42:07,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:42:07,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 2651 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-21 09:42:07,216 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:42:07,292 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-21 09:42:07,292 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 09:42:07,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2106252619] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:42:07,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 09:42:07,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 13 [2022-07-21 09:42:07,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361170667] [2022-07-21 09:42:07,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:42:07,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 09:42:07,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:42:07,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 09:42:07,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2022-07-21 09:42:07,296 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-21 09:42:07,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:42:07,560 INFO L93 Difference]: Finished difference Result 375 states and 454 transitions. [2022-07-21 09:42:07,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 09:42:07,567 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-21 09:42:07,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:42:07,569 INFO L225 Difference]: With dead ends: 375 [2022-07-21 09:42:07,569 INFO L226 Difference]: Without dead ends: 211 [2022-07-21 09:42:07,570 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-21 09:42:07,570 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 241 mSDsluCounter, 680 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 861 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 09:42:07,570 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-21 09:42:07,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2022-07-21 09:42:07,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 206. [2022-07-21 09:42:07,582 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-21 09:42:07,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 248 transitions. [2022-07-21 09:42:07,583 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 248 transitions. Word has length 213 [2022-07-21 09:42:07,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:42:07,584 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 248 transitions. [2022-07-21 09:42:07,584 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-21 09:42:07,584 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 248 transitions. [2022-07-21 09:42:07,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2022-07-21 09:42:07,586 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:42:07,587 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-21 09:42:07,618 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-21 09:42:07,800 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-21 09:42:07,800 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:42:07,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:42:07,801 INFO L85 PathProgramCache]: Analyzing trace with hash -2025906859, now seen corresponding path program 1 times [2022-07-21 09:42:07,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:42:07,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289430364] [2022-07-21 09:42:07,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:42:07,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:42:07,880 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-21 09:42:07,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [845341055] [2022-07-21 09:42:07,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:42:07,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:42:07,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:42:07,882 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-21 09:42:07,911 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-21 09:44:02,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:44:02,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 2756 conjuncts, 403 conjunts are in the unsatisfiable core [2022-07-21 09:44:02,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:44:02,147 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-21 09:44:02,448 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-21 09:44:02,448 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-21 09:44:02,501 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-21 09:44:02,637 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-21 09:44:02,763 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-21 09:44:02,910 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-21 09:44:03,238 INFO L356 Elim1Store]: treesize reduction 183, result has 22.1 percent of original size [2022-07-21 09:44:03,239 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-21 09:44:05,076 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-21 09:44:05,625 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-21 09:44:05,625 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 09:44:05,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:44:05,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289430364] [2022-07-21 09:44:05,987 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-21 09:44:05,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [845341055] [2022-07-21 09:44:05,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [845341055] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:44:05,987 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-07-21 09:44:05,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2022-07-21 09:44:05,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849540691] [2022-07-21 09:44:05,988 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-07-21 09:44:05,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-07-21 09:44:05,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:44:05,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-07-21 09:44:05,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1210, Unknown=0, NotChecked=0, Total=1332 [2022-07-21 09:44:05,989 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-21 09:44:06,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:44:06,584 INFO L93 Difference]: Finished difference Result 409 states and 485 transitions. [2022-07-21 09:44:06,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-07-21 09:44:06,585 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-21 09:44:06,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:44:06,587 INFO L225 Difference]: With dead ends: 409 [2022-07-21 09:44:06,587 INFO L226 Difference]: Without dead ends: 232 [2022-07-21 09:44:06,588 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 287 SyntacticMatches, 5 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 456 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=135, Invalid=1347, Unknown=0, NotChecked=0, Total=1482 [2022-07-21 09:44:06,588 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 23 mSDsluCounter, 1735 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 1945 SdHoareTripleChecker+Invalid, 2132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1663 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-21 09:44:06,588 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 1945 Invalid, 2132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 409 Invalid, 0 Unknown, 1663 Unchecked, 0.5s Time] [2022-07-21 09:44:06,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2022-07-21 09:44:06,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 225. [2022-07-21 09:44:06,602 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-21 09:44:06,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 266 transitions. [2022-07-21 09:44:06,604 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 266 transitions. Word has length 219 [2022-07-21 09:44:06,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:44:06,604 INFO L495 AbstractCegarLoop]: Abstraction has 225 states and 266 transitions. [2022-07-21 09:44:06,604 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-21 09:44:06,605 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 266 transitions. [2022-07-21 09:44:06,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2022-07-21 09:44:06,607 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:44:06,607 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-21 09:44:06,683 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-21 09:44:06,832 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-21 09:44:06,832 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:44:06,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:44:06,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1719785267, now seen corresponding path program 1 times [2022-07-21 09:44:06,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:44:06,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208432728] [2022-07-21 09:44:06,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:44:06,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:44:06,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:44:07,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:44:07,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:44:07,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 09:44:07,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:44:07,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 09:44:07,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:44:07,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 09:44:07,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:44:07,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 09:44:07,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:44:07,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:44:07,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:44:07,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:44:07,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:44:07,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 09:44:07,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:44:07,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-21 09:44:07,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:44:07,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:44:07,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:44:07,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-21 09:44:07,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:44:07,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-21 09:44:07,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:44:07,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:44:07,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:44:07,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-21 09:44:07,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:44:07,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 09:44:07,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:44:07,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:44:07,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:44:07,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-21 09:44:07,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:44:07,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-21 09:44:07,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:44:07,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-21 09:44:07,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:44:07,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-21 09:44:07,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:44:07,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-21 09:44:07,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:44:07,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-21 09:44:07,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:44:07,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-21 09:44:07,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:44:07,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-21 09:44:07,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:44:07,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-21 09:44:07,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:44:07,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-21 09:44:07,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:44:07,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 09:44:07,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:44:07,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:44:07,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:44:07,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-21 09:44:07,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:44:07,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-07-21 09:44:07,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:44:07,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 09:44:07,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:44:07,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:44:07,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:44:07,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-07-21 09:44:07,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:44:07,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2022-07-21 09:44:07,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:44:07,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2022-07-21 09:44:07,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:44:07,373 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-21 09:44:07,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:44:07,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208432728] [2022-07-21 09:44:07,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208432728] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:44:07,373 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:44:07,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-21 09:44:07,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600865330] [2022-07-21 09:44:07,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:44:07,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-21 09:44:07,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:44:07,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-21 09:44:07,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-21 09:44:07,376 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-21 09:44:07,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:44:07,997 INFO L93 Difference]: Finished difference Result 412 states and 487 transitions. [2022-07-21 09:44:07,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-21 09:44:07,998 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-21 09:44:07,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:44:07,999 INFO L225 Difference]: With dead ends: 412 [2022-07-21 09:44:07,999 INFO L226 Difference]: Without dead ends: 223 [2022-07-21 09:44:08,000 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-21 09:44:08,001 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 79 mSDsluCounter, 738 mSDsCounter, 0 mSdLazyCounter, 794 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 943 SdHoareTripleChecker+Invalid, 856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 794 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-21 09:44:08,001 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 943 Invalid, 856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 794 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-21 09:44:08,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2022-07-21 09:44:08,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 214. [2022-07-21 09:44:08,015 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-21 09:44:08,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 250 transitions. [2022-07-21 09:44:08,016 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 250 transitions. Word has length 225 [2022-07-21 09:44:08,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:44:08,017 INFO L495 AbstractCegarLoop]: Abstraction has 214 states and 250 transitions. [2022-07-21 09:44:08,017 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-21 09:44:08,017 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 250 transitions. [2022-07-21 09:44:08,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2022-07-21 09:44:08,018 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:44:08,019 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-21 09:44:08,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-21 09:44:08,019 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:44:08,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:44:08,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1638507119, now seen corresponding path program 1 times [2022-07-21 09:44:08,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:44:08,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257212539] [2022-07-21 09:44:08,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:44:08,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:44:08,071 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-21 09:44:08,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [452702192] [2022-07-21 09:44:08,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:44:08,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:44:08,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:44:08,074 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-21 09:44:08,103 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-21 09:44:08,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:44:08,637 INFO L263 TraceCheckSpWp]: Trace formula consists of 2760 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-21 09:44:08,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:44:08,675 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-21 09:44:08,675 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 09:44:08,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:44:08,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257212539] [2022-07-21 09:44:08,676 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-21 09:44:08,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [452702192] [2022-07-21 09:44:08,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [452702192] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:44:08,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:44:08,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 09:44:08,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040503325] [2022-07-21 09:44:08,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:44:08,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 09:44:08,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:44:08,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 09:44:08,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-21 09:44:08,678 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-21 09:44:08,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:44:08,698 INFO L93 Difference]: Finished difference Result 214 states and 250 transitions. [2022-07-21 09:44:08,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 09:44:08,699 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-21 09:44:08,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:44:08,699 INFO L225 Difference]: With dead ends: 214 [2022-07-21 09:44:08,699 INFO L226 Difference]: Without dead ends: 0 [2022-07-21 09:44:08,700 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-21 09:44:08,700 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-21 09:44:08,701 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-21 09:44:08,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-21 09:44:08,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-21 09:44:08,701 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-21 09:44:08,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-21 09:44:08,702 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 225 [2022-07-21 09:44:08,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:44:08,702 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-21 09:44:08,702 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-21 09:44:08,702 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-21 09:44:08,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-21 09:44:08,705 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-21 09:44:08,734 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-21 09:44:08,919 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-21 09:44:08,921 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-21 09:44:09,832 INFO L899 garLoopResultBuilder]: For program point L6944-1(lines 6944 6946) no Hoare annotation was computed. [2022-07-21 09:44:09,832 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-21 09:44:09,832 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-21 09:44:09,832 INFO L899 garLoopResultBuilder]: For program point bounded_mallocFINAL(lines 6943 6948) no Hoare annotation was computed. [2022-07-21 09:44:09,832 INFO L899 garLoopResultBuilder]: For program point bounded_mallocEXIT(lines 6943 6948) no Hoare annotation was computed. [2022-07-21 09:44:09,832 INFO L902 garLoopResultBuilder]: At program point L10017-4(line 10017) the Hoare annotation is: true [2022-07-21 09:44:09,832 INFO L899 garLoopResultBuilder]: For program point L10017-5(line 10017) no Hoare annotation was computed. [2022-07-21 09:44:09,832 INFO L899 garLoopResultBuilder]: For program point L10017-7(line 10017) no Hoare annotation was computed. [2022-07-21 09:44:09,833 INFO L899 garLoopResultBuilder]: For program point L10017(line 10017) no Hoare annotation was computed. [2022-07-21 09:44:09,833 INFO L899 garLoopResultBuilder]: For program point L10017-2(line 10017) no Hoare annotation was computed. [2022-07-21 09:44:09,833 INFO L899 garLoopResultBuilder]: For program point L10017-3(line 10017) no Hoare annotation was computed. [2022-07-21 09:44:09,833 INFO L902 garLoopResultBuilder]: At program point aws_hash_table_is_validENTRY(lines 10015 10018) the Hoare annotation is: true [2022-07-21 09:44:09,833 INFO L899 garLoopResultBuilder]: For program point aws_hash_table_is_validEXIT(lines 10015 10018) no Hoare annotation was computed. [2022-07-21 09:44:09,833 INFO L899 garLoopResultBuilder]: For program point aws_hash_table_is_validFINAL(lines 10015 10018) no Hoare annotation was computed. [2022-07-21 09:44:09,833 INFO L899 garLoopResultBuilder]: For program point nondet_boolFINAL(line 261) no Hoare annotation was computed. [2022-07-21 09:44:09,833 INFO L899 garLoopResultBuilder]: For program point nondet_boolEXIT(line 261) no Hoare annotation was computed. [2022-07-21 09:44:09,833 INFO L902 garLoopResultBuilder]: At program point nondet_boolENTRY(line 261) the Hoare annotation is: true [2022-07-21 09:44:09,833 INFO L899 garLoopResultBuilder]: For program point L7130(lines 7130 7134) no Hoare annotation was computed. [2022-07-21 09:44:09,833 INFO L899 garLoopResultBuilder]: For program point aws_mem_releaseEXIT(lines 7122 7135) no Hoare annotation was computed. [2022-07-21 09:44:09,833 INFO L902 garLoopResultBuilder]: At program point L7126(lines 7126 7128) the Hoare annotation is: true [2022-07-21 09:44:09,833 INFO L902 garLoopResultBuilder]: At program point aws_mem_releaseENTRY(lines 7122 7135) the Hoare annotation is: true [2022-07-21 09:44:09,833 INFO L899 garLoopResultBuilder]: For program point L7130-2(lines 7122 7135) no Hoare annotation was computed. [2022-07-21 09:44:09,833 INFO L899 garLoopResultBuilder]: For program point L7123-1(lines 7123 7125) no Hoare annotation was computed. [2022-07-21 09:44:09,834 INFO L902 garLoopResultBuilder]: At program point L7123(lines 7123 7125) the Hoare annotation is: true [2022-07-21 09:44:09,834 INFO L899 garLoopResultBuilder]: For program point L7126-1(lines 7126 7128) no Hoare annotation was computed. [2022-07-21 09:44:09,834 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-21 09:44:09,834 INFO L899 garLoopResultBuilder]: For program point L10135-2(lines 10135 10137) no Hoare annotation was computed. [2022-07-21 09:44:09,834 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-21 09:44:09,834 INFO L899 garLoopResultBuilder]: For program point L10131-1(line 10131) no Hoare annotation was computed. [2022-07-21 09:44:09,834 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-21 09:44:09,834 INFO L899 garLoopResultBuilder]: For program point hash_table_state_required_bytesEXIT(lines 10128 10140) no Hoare annotation was computed. [2022-07-21 09:44:09,834 INFO L899 garLoopResultBuilder]: For program point L10135-1(line 10135) no Hoare annotation was computed. [2022-07-21 09:44:09,834 INFO L899 garLoopResultBuilder]: For program point L10131-2(lines 10131 10133) no Hoare annotation was computed. [2022-07-21 09:44:09,834 INFO L899 garLoopResultBuilder]: For program point hash_table_state_required_bytesFINAL(lines 10128 10140) no Hoare annotation was computed. [2022-07-21 09:44:09,834 INFO L902 garLoopResultBuilder]: At program point memset_override_0_implENTRY(lines 7397 7412) the Hoare annotation is: true [2022-07-21 09:44:09,834 INFO L899 garLoopResultBuilder]: For program point memset_override_0_implFINAL(lines 7397 7412) no Hoare annotation was computed. [2022-07-21 09:44:09,835 INFO L899 garLoopResultBuilder]: For program point L7403-1(line 7403) no Hoare annotation was computed. [2022-07-21 09:44:09,835 INFO L902 garLoopResultBuilder]: At program point L7403(line 7403) the Hoare annotation is: true [2022-07-21 09:44:09,835 INFO L899 garLoopResultBuilder]: For program point L7407-4(lines 7407 7409) no Hoare annotation was computed. [2022-07-21 09:44:09,835 INFO L902 garLoopResultBuilder]: At program point L7407-3(lines 7407 7409) the Hoare annotation is: true [2022-07-21 09:44:09,835 INFO L899 garLoopResultBuilder]: For program point L7407-2(lines 7407 7409) no Hoare annotation was computed. [2022-07-21 09:44:09,835 INFO L899 garLoopResultBuilder]: For program point memset_override_0_implEXIT(lines 7397 7412) no Hoare annotation was computed. [2022-07-21 09:44:09,835 INFO L902 garLoopResultBuilder]: At program point L7398(line 7398) the Hoare annotation is: true [2022-07-21 09:44:09,835 INFO L899 garLoopResultBuilder]: For program point L7400(line 7400) no Hoare annotation was computed. [2022-07-21 09:44:09,835 INFO L902 garLoopResultBuilder]: At program point L7398-1(line 7398) the Hoare annotation is: true [2022-07-21 09:44:09,835 INFO L899 garLoopResultBuilder]: For program point aws_mul_size_checkedEXIT(lines 2586 2594) no Hoare annotation was computed. [2022-07-21 09:44:09,835 INFO L899 garLoopResultBuilder]: For program point L2498-1(lines 2498 2499) no Hoare annotation was computed. [2022-07-21 09:44:09,835 INFO L899 garLoopResultBuilder]: For program point aws_mul_size_checkedFINAL(lines 2586 2594) no Hoare annotation was computed. [2022-07-21 09:44:09,835 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-21 09:44:09,835 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-21 09:44:09,836 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-21 09:44:09,836 INFO L899 garLoopResultBuilder]: For program point L2499-1(line 2499) no Hoare annotation was computed. [2022-07-21 09:44:09,836 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-21 09:44:09,836 INFO L899 garLoopResultBuilder]: For program point nondet_uint64_tEXIT(line 266) no Hoare annotation was computed. [2022-07-21 09:44:09,836 INFO L902 garLoopResultBuilder]: At program point nondet_uint64_tENTRY(line 266) the Hoare annotation is: true [2022-07-21 09:44:09,836 INFO L899 garLoopResultBuilder]: For program point nondet_uint64_tFINAL(line 266) no Hoare annotation was computed. [2022-07-21 09:44:09,836 INFO L899 garLoopResultBuilder]: For program point ##fun~$Pointer$~TO~VOIDEXIT(line -1) no Hoare annotation was computed. [2022-07-21 09:44:09,836 INFO L902 garLoopResultBuilder]: At program point ##fun~$Pointer$~TO~VOIDENTRY(line -1) the Hoare annotation is: true [2022-07-21 09:44:09,837 INFO L899 garLoopResultBuilder]: For program point ##fun~$Pointer$~TO~VOIDFINAL(line -1) no Hoare annotation was computed. [2022-07-21 09:44:09,837 INFO L899 garLoopResultBuilder]: For program point L6852(line 6852) no Hoare annotation was computed. [2022-07-21 09:44:09,838 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-21 09:44:09,838 INFO L899 garLoopResultBuilder]: For program point __CPROVER_overflow_plusFINAL(lines 248 251) no Hoare annotation was computed. [2022-07-21 09:44:09,838 INFO L899 garLoopResultBuilder]: For program point __CPROVER_overflow_plusEXIT(lines 248 251) no Hoare annotation was computed. [2022-07-21 09:44:09,838 INFO L902 garLoopResultBuilder]: At program point hash_table_state_is_validENTRY(lines 10026 10073) the Hoare annotation is: true [2022-07-21 09:44:09,838 INFO L899 garLoopResultBuilder]: For program point L10028(lines 10028 10032) no Hoare annotation was computed. [2022-07-21 09:44:09,838 INFO L899 garLoopResultBuilder]: For program point hash_table_state_is_validEXIT(lines 10026 10073) no Hoare annotation was computed. [2022-07-21 09:44:09,838 INFO L899 garLoopResultBuilder]: For program point hash_table_state_is_validFINAL(lines 10026 10073) no Hoare annotation was computed. [2022-07-21 09:44:09,839 INFO L899 garLoopResultBuilder]: For program point L10054-1(line 10054) no Hoare annotation was computed. [2022-07-21 09:44:09,839 INFO L902 garLoopResultBuilder]: At program point L10054(line 10054) the Hoare annotation is: true [2022-07-21 09:44:09,839 INFO L902 garLoopResultBuilder]: At program point my_memsetENTRY(lines 7414 7416) the Hoare annotation is: true [2022-07-21 09:44:09,839 INFO L899 garLoopResultBuilder]: For program point my_memsetFINAL(lines 7414 7416) no Hoare annotation was computed. [2022-07-21 09:44:09,839 INFO L899 garLoopResultBuilder]: For program point L7415-1(line 7415) no Hoare annotation was computed. [2022-07-21 09:44:09,839 INFO L902 garLoopResultBuilder]: At program point L7415(line 7415) the Hoare annotation is: true [2022-07-21 09:44:09,839 INFO L899 garLoopResultBuilder]: For program point my_memsetEXIT(lines 7414 7416) no Hoare annotation was computed. [2022-07-21 09:44:09,839 INFO L899 garLoopResultBuilder]: For program point L211-2(lines 210 212) no Hoare annotation was computed. [2022-07-21 09:44:09,840 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 210 212) the Hoare annotation is: true [2022-07-21 09:44:09,840 INFO L899 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2022-07-21 09:44:09,840 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 210 212) no Hoare annotation was computed. [2022-07-21 09:44:09,840 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-21 09:44:09,840 INFO L899 garLoopResultBuilder]: For program point aws_raise_errorFINAL(lines 1988 1999) no Hoare annotation was computed. [2022-07-21 09:44:09,840 INFO L899 garLoopResultBuilder]: For program point L7385(lines 7385 7387) no Hoare annotation was computed. [2022-07-21 09:44:09,840 INFO L899 garLoopResultBuilder]: For program point aws_raise_errorEXIT(lines 1988 1999) no Hoare annotation was computed. [2022-07-21 09:44:09,841 INFO L899 garLoopResultBuilder]: For program point can_fail_allocatorFINAL(lines 6950 6952) no Hoare annotation was computed. [2022-07-21 09:44:09,841 INFO L899 garLoopResultBuilder]: For program point can_fail_allocatorEXIT(lines 6950 6952) no Hoare annotation was computed. [2022-07-21 09:44:09,841 INFO L902 garLoopResultBuilder]: At program point can_fail_allocatorENTRY(lines 6950 6952) the Hoare annotation is: true [2022-07-21 09:44:09,841 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-21 09:44:09,841 INFO L899 garLoopResultBuilder]: For program point __CPROVER_overflow_multEXIT(lines 253 256) no Hoare annotation was computed. [2022-07-21 09:44:09,841 INFO L899 garLoopResultBuilder]: For program point __CPROVER_overflow_multFINAL(lines 253 256) no Hoare annotation was computed. [2022-07-21 09:44:09,841 INFO L899 garLoopResultBuilder]: For program point aws_is_power_of_twoFINAL(lines 2626 2631) no Hoare annotation was computed. [2022-07-21 09:44:09,842 INFO L899 garLoopResultBuilder]: For program point aws_is_power_of_twoEXIT(lines 2626 2631) no Hoare annotation was computed. [2022-07-21 09:44:09,842 INFO L902 garLoopResultBuilder]: At program point aws_is_power_of_twoENTRY(lines 2626 2631) the Hoare annotation is: true [2022-07-21 09:44:09,842 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-21 09:44:09,842 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-21 09:44:09,842 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-21 09:44:09,842 INFO L899 garLoopResultBuilder]: For program point L2543-1(line 2543) no Hoare annotation was computed. [2022-07-21 09:44:09,842 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-21 09:44:09,843 INFO L899 garLoopResultBuilder]: For program point L2542-1(lines 2542 2543) no Hoare annotation was computed. [2022-07-21 09:44:09,843 INFO L899 garLoopResultBuilder]: For program point aws_add_size_checkedFINAL(lines 2613 2621) no Hoare annotation was computed. [2022-07-21 09:44:09,843 INFO L899 garLoopResultBuilder]: For program point aws_add_size_checkedEXIT(lines 2613 2621) no Hoare annotation was computed. [2022-07-21 09:44:09,843 INFO L899 garLoopResultBuilder]: For program point L6815-1(line 6815) no Hoare annotation was computed. [2022-07-21 09:44:09,843 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-21 09:44:09,843 INFO L899 garLoopResultBuilder]: For program point L9276(lines 9276 9278) no Hoare annotation was computed. [2022-07-21 09:44:09,843 INFO L895 garLoopResultBuilder]: At program point L9276-2(lines 9276 9278) the Hoare annotation is: false [2022-07-21 09:44:09,844 INFO L899 garLoopResultBuilder]: For program point L6815-3(line 6815) no Hoare annotation was computed. [2022-07-21 09:44:09,844 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-21 09:44:09,844 INFO L899 garLoopResultBuilder]: For program point L6840-1(line 6840) no Hoare annotation was computed. [2022-07-21 09:44:09,844 INFO L895 garLoopResultBuilder]: At program point L6840(line 6840) the Hoare annotation is: false [2022-07-21 09:44:09,844 INFO L899 garLoopResultBuilder]: For program point L9276-3(lines 9276 9278) no Hoare annotation was computed. [2022-07-21 09:44:09,844 INFO L895 garLoopResultBuilder]: At program point L9945(line 9945) the Hoare annotation is: false [2022-07-21 09:44:09,844 INFO L899 garLoopResultBuilder]: For program point L9945-1(line 9945) no Hoare annotation was computed. [2022-07-21 09:44:09,844 INFO L899 garLoopResultBuilder]: For program point L7179-1(line 7179) no Hoare annotation was computed. [2022-07-21 09:44:09,845 INFO L895 garLoopResultBuilder]: At program point L7179(line 7179) the Hoare annotation is: false [2022-07-21 09:44:09,845 INFO L899 garLoopResultBuilder]: For program point L9285(lines 9285 9287) no Hoare annotation was computed. [2022-07-21 09:44:09,845 INFO L895 garLoopResultBuilder]: At program point L9954(line 9954) the Hoare annotation is: false [2022-07-21 09:44:09,845 INFO L899 garLoopResultBuilder]: For program point L6816-1(line 6816) no Hoare annotation was computed. [2022-07-21 09:44:09,845 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-21 09:44:09,845 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-21 09:44:09,845 INFO L899 garLoopResultBuilder]: For program point L9954-1(line 9954) no Hoare annotation was computed. [2022-07-21 09:44:09,846 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-21 09:44:09,846 INFO L899 garLoopResultBuilder]: For program point L6841-1(line 6841) no Hoare annotation was computed. [2022-07-21 09:44:09,846 INFO L895 garLoopResultBuilder]: At program point L6841(line 6841) the Hoare annotation is: false [2022-07-21 09:44:09,846 INFO L899 garLoopResultBuilder]: For program point L9938(line 9938) no Hoare annotation was computed. [2022-07-21 09:44:09,846 INFO L895 garLoopResultBuilder]: At program point L6833(lines 6831 6834) the Hoare annotation is: false [2022-07-21 09:44:09,846 INFO L902 garLoopResultBuilder]: At program point L10161(line 10161) the Hoare annotation is: true [2022-07-21 09:44:09,846 INFO L899 garLoopResultBuilder]: For program point L9938-2(lines 9938 9951) no Hoare annotation was computed. [2022-07-21 09:44:09,847 INFO L899 garLoopResultBuilder]: For program point L7180-1(line 7180) no Hoare annotation was computed. [2022-07-21 09:44:09,847 INFO L899 garLoopResultBuilder]: For program point L235(line 235) no Hoare annotation was computed. [2022-07-21 09:44:09,847 INFO L899 garLoopResultBuilder]: For program point L9938-3(lines 9938 9951) no Hoare annotation was computed. [2022-07-21 09:44:09,847 INFO L895 garLoopResultBuilder]: At program point L7180(line 7180) the Hoare annotation is: false [2022-07-21 09:44:09,847 INFO L899 garLoopResultBuilder]: For program point L6825-3(lines 6825 6827) no Hoare annotation was computed. [2022-07-21 09:44:09,847 INFO L899 garLoopResultBuilder]: For program point L6825-1(lines 6825 6827) no Hoare annotation was computed. [2022-07-21 09:44:09,847 INFO L895 garLoopResultBuilder]: At program point L6825(line 6825) the Hoare annotation is: false [2022-07-21 09:44:09,847 INFO L899 garLoopResultBuilder]: For program point L9278-1(line 9278) no Hoare annotation was computed. [2022-07-21 09:44:09,848 INFO L899 garLoopResultBuilder]: For program point L9947(lines 9947 9949) no Hoare annotation was computed. [2022-07-21 09:44:09,848 INFO L895 garLoopResultBuilder]: At program point L10145(line 10145) the Hoare annotation is: false [2022-07-21 09:44:09,848 INFO L895 garLoopResultBuilder]: At program point L10145-1(line 10145) the Hoare annotation is: false [2022-07-21 09:44:09,848 INFO L899 garLoopResultBuilder]: For program point L10145-2(line 10145) no Hoare annotation was computed. [2022-07-21 09:44:09,848 INFO L895 garLoopResultBuilder]: At program point L9278(line 9278) the Hoare annotation is: false [2022-07-21 09:44:09,848 INFO L899 garLoopResultBuilder]: For program point L6809(lines 6809 6819) no Hoare annotation was computed. [2022-07-21 09:44:09,848 INFO L899 garLoopResultBuilder]: For program point L9939-1(lines 9939 9950) no Hoare annotation was computed. [2022-07-21 09:44:09,848 INFO L895 garLoopResultBuilder]: At program point L10154(line 10154) the Hoare annotation is: false [2022-07-21 09:44:09,849 INFO L895 garLoopResultBuilder]: At program point L9939-3(lines 9939 9950) the Hoare annotation is: false [2022-07-21 09:44:09,849 INFO L895 garLoopResultBuilder]: At program point L9939-4(lines 9939 9950) the Hoare annotation is: false [2022-07-21 09:44:09,849 INFO L895 garLoopResultBuilder]: At program point L9295(lines 9295 9297) the Hoare annotation is: false [2022-07-21 09:44:09,849 INFO L899 garLoopResultBuilder]: For program point L7181-1(line 7181) no Hoare annotation was computed. [2022-07-21 09:44:09,849 INFO L899 garLoopResultBuilder]: For program point L9295-1(lines 9295 9297) no Hoare annotation was computed. [2022-07-21 09:44:09,849 INFO L895 garLoopResultBuilder]: At program point L7181(line 7181) the Hoare annotation is: false [2022-07-21 09:44:09,849 INFO L899 garLoopResultBuilder]: For program point L10154-1(line 10154) no Hoare annotation was computed. [2022-07-21 09:44:09,850 INFO L895 garLoopResultBuilder]: At program point L9948(line 9948) the Hoare annotation is: false [2022-07-21 09:44:09,850 INFO L899 garLoopResultBuilder]: For program point L9948-1(line 9948) no Hoare annotation was computed. [2022-07-21 09:44:09,850 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-21 09:44:09,850 INFO L895 garLoopResultBuilder]: At program point L6843(lines 6837 6844) the Hoare annotation is: false [2022-07-21 09:44:09,850 INFO L899 garLoopResultBuilder]: For program point L6810-1(line 6810) no Hoare annotation was computed. [2022-07-21 09:44:09,850 INFO L895 garLoopResultBuilder]: At program point L9957(line 9957) the Hoare annotation is: false [2022-07-21 09:44:09,850 INFO L895 garLoopResultBuilder]: At program point L9957-1(line 9957) the Hoare annotation is: false [2022-07-21 09:44:09,851 INFO L895 garLoopResultBuilder]: At program point L10147(line 10147) the Hoare annotation is: false [2022-07-21 09:44:09,851 INFO L899 garLoopResultBuilder]: For program point L9957-2(line 9957) no Hoare annotation was computed. [2022-07-21 09:44:09,851 INFO L899 garLoopResultBuilder]: For program point L10147-1(line 10147) no Hoare annotation was computed. [2022-07-21 09:44:09,851 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-21 09:44:09,851 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-21 09:44:09,851 INFO L899 garLoopResultBuilder]: For program point L9941(lines 9941 9943) no Hoare annotation was computed. [2022-07-21 09:44:09,851 INFO L895 garLoopResultBuilder]: At program point L9272(lines 9272 9298) the Hoare annotation is: false [2022-07-21 09:44:09,852 INFO L899 garLoopResultBuilder]: For program point L9933(lines 9933 9958) no Hoare annotation was computed. [2022-07-21 09:44:09,852 INFO L895 garLoopResultBuilder]: At program point L10156(lines 10156 10158) the Hoare annotation is: false [2022-07-21 09:44:09,852 INFO L899 garLoopResultBuilder]: For program point L10156-1(lines 10156 10158) no Hoare annotation was computed. [2022-07-21 09:44:09,852 INFO L899 garLoopResultBuilder]: For program point L7175(lines 7175 7183) no Hoare annotation was computed. [2022-07-21 09:44:09,852 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-21 09:44:09,852 INFO L899 garLoopResultBuilder]: For program point L6812-1(line 6812) no Hoare annotation was computed. [2022-07-21 09:44:09,852 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-21 09:44:09,853 INFO L895 garLoopResultBuilder]: At program point L9273(lines 9273 9275) the Hoare annotation is: false [2022-07-21 09:44:09,853 INFO L899 garLoopResultBuilder]: For program point L9273-1(lines 9273 9275) no Hoare annotation was computed. [2022-07-21 09:44:09,853 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-21 09:44:09,853 INFO L899 garLoopResultBuilder]: For program point L9934-2(line 9934) no Hoare annotation was computed. [2022-07-21 09:44:09,853 INFO L895 garLoopResultBuilder]: At program point L9290(line 9290) the Hoare annotation is: false [2022-07-21 09:44:09,853 INFO L895 garLoopResultBuilder]: At program point L9934(line 9934) the Hoare annotation is: false [2022-07-21 09:44:09,853 INFO L899 garLoopResultBuilder]: For program point L7176(lines 7176 7182) no Hoare annotation was computed. [2022-07-21 09:44:09,854 INFO L899 garLoopResultBuilder]: For program point L9290-1(line 9290) no Hoare annotation was computed. [2022-07-21 09:44:09,854 INFO L899 garLoopResultBuilder]: For program point L6821(lines 6821 6828) no Hoare annotation was computed. [2022-07-21 09:44:09,854 INFO L899 garLoopResultBuilder]: For program point L10141(lines 10141 10160) no Hoare annotation was computed. [2022-07-21 09:44:09,854 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-21 09:44:09,854 INFO L899 garLoopResultBuilder]: For program point L7185(lines 7185 7187) no Hoare annotation was computed. [2022-07-21 09:44:09,854 INFO L895 garLoopResultBuilder]: At program point L6822(line 6822) the Hoare annotation is: false [2022-07-21 09:44:09,854 INFO L899 garLoopResultBuilder]: For program point L6822-3(lines 6822 6824) no Hoare annotation was computed. [2022-07-21 09:44:09,854 INFO L899 garLoopResultBuilder]: For program point L6822-1(lines 6822 6824) no Hoare annotation was computed. [2022-07-21 09:44:09,855 INFO L899 garLoopResultBuilder]: For program point L6839-1(line 6839) no Hoare annotation was computed. [2022-07-21 09:44:09,855 INFO L895 garLoopResultBuilder]: At program point L6839(line 6839) the Hoare annotation is: false [2022-07-21 09:44:09,855 INFO L899 garLoopResultBuilder]: For program point L9944(lines 9944 9946) no Hoare annotation was computed. [2022-07-21 09:44:09,855 INFO L899 garLoopResultBuilder]: For program point L9944-2(lines 9944 9946) no Hoare annotation was computed. [2022-07-21 09:44:09,855 INFO L899 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2022-07-21 09:44:09,855 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 222 224) the Hoare annotation is: true [2022-07-21 09:44:09,855 INFO L899 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2022-07-21 09:44:09,855 INFO L899 garLoopResultBuilder]: For program point L223-3(lines 222 224) no Hoare annotation was computed. [2022-07-21 09:44:09,856 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 222 224) no Hoare annotation was computed. [2022-07-21 09:44:09,856 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2022-07-21 09:44:09,858 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:44:09,860 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-21 09:44:09,869 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1486,QUANTIFIED] [2022-07-21 09:44:09,869 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_67,QUANTIFIED] [2022-07-21 09:44:09,870 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_67,QUANTIFIED] [2022-07-21 09:44:09,872 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1486,QUANTIFIED] [2022-07-21 09:44:09,872 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_67,QUANTIFIED] [2022-07-21 09:44:09,872 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_67,QUANTIFIED] [2022-07-21 09:44:09,873 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1486,QUANTIFIED] [2022-07-21 09:44:09,873 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_67,QUANTIFIED] [2022-07-21 09:44:09,874 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_67,QUANTIFIED] [2022-07-21 09:44:09,874 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1486,QUANTIFIED] [2022-07-21 09:44:09,874 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_67,QUANTIFIED] [2022-07-21 09:44:09,875 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_67,QUANTIFIED] [2022-07-21 09:44:09,876 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.07 09:44:09 BoogieIcfgContainer [2022-07-21 09:44:09,876 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-21 09:44:09,876 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-21 09:44:09,876 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-21 09:44:09,877 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-21 09:44:09,877 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 09:41:45" (3/4) ... [2022-07-21 09:44:09,879 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-21 09:44:09,884 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure bounded_malloc [2022-07-21 09:44:09,884 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_hash_table_is_valid [2022-07-21 09:44:09,884 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure hash_table_state_is_valid [2022-07-21 09:44:09,884 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure my_memset [2022-07-21 09:44:09,884 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_bool [2022-07-21 09:44:09,884 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_mem_release [2022-07-21 09:44:09,885 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure hash_table_state_required_bytes [2022-07-21 09:44:09,885 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2022-07-21 09:44:09,885 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure memset_override_0_impl [2022-07-21 09:44:09,885 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_raise_error [2022-07-21 09:44:09,885 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure can_fail_allocator [2022-07-21 09:44:09,885 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __CPROVER_overflow_mult [2022-07-21 09:44:09,885 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_is_power_of_two [2022-07-21 09:44:09,885 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_add_size_checked [2022-07-21 09:44:09,885 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_mul_size_checked [2022-07-21 09:44:09,886 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_uint64_t [2022-07-21 09:44:09,886 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~$Pointer$~TO~VOID [2022-07-21 09:44:09,886 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2022-07-21 09:44:09,886 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __CPROVER_overflow_plus [2022-07-21 09:44:09,897 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 161 nodes and edges [2022-07-21 09:44:09,898 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 77 nodes and edges [2022-07-21 09:44:09,899 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 28 nodes and edges [2022-07-21 09:44:09,900 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2022-07-21 09:44:09,901 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2022-07-21 09:44:09,902 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-07-21 09:44:09,902 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-21 09:44:09,903 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-21 09:44:09,928 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-21 09:44:09,928 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-21 09:44:10,278 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-21 09:44:10,278 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-21 09:44:10,279 INFO L158 Benchmark]: Toolchain (without parser) took 148749.58ms. Allocated memory was 71.3MB in the beginning and 419.4MB in the end (delta: 348.1MB). Free memory was 42.9MB in the beginning and 346.0MB in the end (delta: -303.1MB). Peak memory consumption was 290.0MB. Max. memory is 16.1GB. [2022-07-21 09:44:10,279 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 71.3MB. Free memory was 51.4MB in the beginning and 51.4MB in the end (delta: 32.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 09:44:10,280 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2783.74ms. Allocated memory was 71.3MB in the beginning and 111.1MB in the end (delta: 39.8MB). Free memory was 42.8MB in the beginning and 51.4MB in the end (delta: -8.6MB). Peak memory consumption was 53.5MB. Max. memory is 16.1GB. [2022-07-21 09:44:10,280 INFO L158 Benchmark]: Boogie Procedure Inliner took 199.86ms. Allocated memory is still 111.1MB. Free memory was 51.4MB in the beginning and 39.9MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-21 09:44:10,280 INFO L158 Benchmark]: Boogie Preprocessor took 113.09ms. Allocated memory is still 111.1MB. Free memory was 39.9MB in the beginning and 54.6MB in the end (delta: -14.7MB). Peak memory consumption was 7.4MB. Max. memory is 16.1GB. [2022-07-21 09:44:10,280 INFO L158 Benchmark]: RCFGBuilder took 1279.58ms. Allocated memory was 111.1MB in the beginning and 146.8MB in the end (delta: 35.7MB). Free memory was 54.6MB in the beginning and 69.4MB in the end (delta: -14.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2022-07-21 09:44:10,281 INFO L158 Benchmark]: TraceAbstraction took 143963.68ms. Allocated memory was 146.8MB in the beginning and 419.4MB in the end (delta: 272.6MB). Free memory was 68.4MB in the beginning and 210.7MB in the end (delta: -142.3MB). Peak memory consumption was 129.3MB. Max. memory is 16.1GB. [2022-07-21 09:44:10,281 INFO L158 Benchmark]: Witness Printer took 402.09ms. Allocated memory is still 419.4MB. Free memory was 210.7MB in the beginning and 346.0MB in the end (delta: -135.3MB). Peak memory consumption was 111.1MB. Max. memory is 16.1GB. [2022-07-21 09:44:10,282 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.18ms. Allocated memory is still 71.3MB. Free memory was 51.4MB in the beginning and 51.4MB in the end (delta: 32.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2783.74ms. Allocated memory was 71.3MB in the beginning and 111.1MB in the end (delta: 39.8MB). Free memory was 42.8MB in the beginning and 51.4MB in the end (delta: -8.6MB). Peak memory consumption was 53.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 199.86ms. Allocated memory is still 111.1MB. Free memory was 51.4MB in the beginning and 39.9MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 113.09ms. Allocated memory is still 111.1MB. Free memory was 39.9MB in the beginning and 54.6MB in the end (delta: -14.7MB). Peak memory consumption was 7.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1279.58ms. Allocated memory was 111.1MB in the beginning and 146.8MB in the end (delta: 35.7MB). Free memory was 54.6MB in the beginning and 69.4MB in the end (delta: -14.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * TraceAbstraction took 143963.68ms. Allocated memory was 146.8MB in the beginning and 419.4MB in the end (delta: 272.6MB). Free memory was 68.4MB in the beginning and 210.7MB in the end (delta: -142.3MB). Peak memory consumption was 129.3MB. Max. memory is 16.1GB. * Witness Printer took 402.09ms. Allocated memory is still 419.4MB. Free memory was 210.7MB in the beginning and 346.0MB in the end (delta: -135.3MB). Peak memory consumption was 111.1MB. 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: 143.9s, OverallIterations: 16, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 10.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2716 SdHoareTripleChecker+Valid, 8.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2577 mSDsluCounter, 13816 SdHoareTripleChecker+Invalid, 7.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, 5.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=225occurred in iteration=14, InterpolantAutomatonStates: 202, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 16 MinimizatonAttempts, 210 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 75 LocationsWithAnnotation, 648 PreInvPairs, 675 NumberOfFragments, 900 HoareAnnotationTreeSize, 648 FomulaSimplifications, 498 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 75 FomulaSimplificationsInter, 1261 FormulaSimplificationTreeSizeReductionInter, 0.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 117.2s SatisfiabilityAnalysisTime, 10.6s 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-21 09:44:10,290 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1486,QUANTIFIED] [2022-07-21 09:44:10,290 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_67,QUANTIFIED] [2022-07-21 09:44:10,291 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_67,QUANTIFIED] [2022-07-21 09:44:10,291 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1486,QUANTIFIED] [2022-07-21 09:44:10,291 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_67,QUANTIFIED] [2022-07-21 09:44:10,292 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-21 09:44:10,292 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1486,QUANTIFIED] [2022-07-21 09:44:10,292 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_67,QUANTIFIED] [2022-07-21 09:44:10,293 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_67,QUANTIFIED] [2022-07-21 09:44:10,293 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1486,QUANTIFIED] [2022-07-21 09:44:10,293 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_67,QUANTIFIED] [2022-07-21 09:44:10,293 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-21 09:44:10,319 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