./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_hash_iter_done_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version bfd0d9ac 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_iter_done_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 03b17f77ffc9b60dd6edfa1d1cf71f248568a9cd6bbbccab8c3e61d5773c4168 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-bfd0d9a [2021-11-01 10:17:28,872 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-01 10:17:28,873 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-01 10:17:28,915 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-01 10:17:28,917 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-01 10:17:28,918 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-01 10:17:28,920 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-01 10:17:28,924 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-01 10:17:28,926 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-01 10:17:28,928 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-01 10:17:28,928 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-01 10:17:28,929 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-01 10:17:28,931 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-01 10:17:28,933 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-01 10:17:28,935 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-01 10:17:28,936 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-01 10:17:28,939 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-01 10:17:28,944 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-01 10:17:28,945 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-01 10:17:28,946 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-01 10:17:28,950 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-01 10:17:28,952 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-01 10:17:28,952 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-01 10:17:28,954 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-01 10:17:28,956 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-01 10:17:28,959 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-01 10:17:28,960 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-01 10:17:28,961 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-01 10:17:28,961 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-01 10:17:28,963 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-01 10:17:28,964 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-01 10:17:28,964 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-01 10:17:28,965 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-01 10:17:28,966 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-01 10:17:28,967 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-01 10:17:28,967 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-01 10:17:28,968 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-01 10:17:28,968 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-01 10:17:28,968 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-01 10:17:28,969 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-01 10:17:28,969 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-01 10:17:28,970 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-01 10:17:28,993 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-01 10:17:28,994 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-01 10:17:28,994 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-01 10:17:28,994 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-01 10:17:28,995 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-01 10:17:28,995 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-01 10:17:28,996 INFO L138 SettingsManager]: * Use SBE=true [2021-11-01 10:17:28,996 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-01 10:17:28,996 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-01 10:17:28,996 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-01 10:17:28,997 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-01 10:17:28,997 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-01 10:17:28,998 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-01 10:17:28,998 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-01 10:17:28,998 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-01 10:17:28,998 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-01 10:17:28,998 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-01 10:17:28,998 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-01 10:17:28,999 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-01 10:17:28,999 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-01 10:17:28,999 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-01 10:17:28,999 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-01 10:17:28,999 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-01 10:17:28,999 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-01 10:17:29,000 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-01 10:17:29,000 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-01 10:17:29,000 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-01 10:17:29,001 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-01 10:17:29,001 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-01 10:17:29,002 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 -> 03b17f77ffc9b60dd6edfa1d1cf71f248568a9cd6bbbccab8c3e61d5773c4168 [2021-11-01 10:17:29,204 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-01 10:17:29,225 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-01 10:17:29,227 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-01 10:17:29,229 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-01 10:17:29,230 INFO L275 PluginConnector]: CDTParser initialized [2021-11-01 10:17:29,231 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_hash_iter_done_harness.i [2021-11-01 10:17:29,284 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/688e7da3b/ddf9b61547dd425f82053695be95e4e7/FLAGbb2804c39 [2021-11-01 10:17:29,969 INFO L306 CDTParser]: Found 1 translation units. [2021-11-01 10:17:29,971 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_iter_done_harness.i [2021-11-01 10:17:30,015 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/688e7da3b/ddf9b61547dd425f82053695be95e4e7/FLAGbb2804c39 [2021-11-01 10:17:30,106 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/688e7da3b/ddf9b61547dd425f82053695be95e4e7 [2021-11-01 10:17:30,108 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-01 10:17:30,109 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-01 10:17:30,111 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-01 10:17:30,111 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-01 10:17:30,114 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-01 10:17:30,114 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.11 10:17:30" (1/1) ... [2021-11-01 10:17:30,115 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5588cee3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 10:17:30, skipping insertion in model container [2021-11-01 10:17:30,115 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.11 10:17:30" (1/1) ... [2021-11-01 10:17:30,121 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-01 10:17:30,211 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-01 10:17:30,512 WARN L228 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_iter_done_harness.i[4492,4505] [2021-11-01 10:17:30,519 WARN L228 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_iter_done_harness.i[4552,4565] [2021-11-01 10:17:30,550 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-01 10:17:30,556 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-01 10:17:31,298 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:17:31,305 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:17:31,305 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:17:31,306 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:17:31,307 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:17:31,319 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:17:31,320 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:17:31,321 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:17:31,322 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:17:31,323 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:17:31,323 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:17:31,324 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:17:31,324 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:17:31,572 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-01 10:17:31,573 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-01 10:17:31,573 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-01 10:17:31,574 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-01 10:17:31,575 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-01 10:17:31,575 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-01 10:17:31,575 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-01 10:17:31,576 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-01 10:17:31,576 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-01 10:17:31,577 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-01 10:17:31,696 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-01 10:17:31,956 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:17:31,958 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:17:31,987 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:17:31,988 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:17:31,994 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:17:31,995 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:17:32,011 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:17:32,012 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:17:32,014 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:17:32,014 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:17:32,015 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:17:32,015 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:17:32,015 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:17:32,054 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-01 10:17:32,092 INFO L203 MainTranslator]: Completed pre-run [2021-11-01 10:17:32,111 WARN L228 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_iter_done_harness.i[4492,4505] [2021-11-01 10:17:32,112 WARN L228 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_iter_done_harness.i[4552,4565] [2021-11-01 10:17:32,113 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-01 10:17:32,114 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-01 10:17:32,148 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:17:32,149 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:17:32,149 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:17:32,149 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:17:32,149 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:17:32,156 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:17:32,157 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:17:32,158 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:17:32,160 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:17:32,162 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:17:32,162 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:17:32,163 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:17:32,163 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:17:32,186 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-01 10:17:32,186 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-01 10:17:32,187 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-01 10:17:32,188 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-01 10:17:32,188 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-01 10:17:32,189 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-01 10:17:32,189 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-01 10:17:32,189 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-01 10:17:32,189 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-01 10:17:32,190 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-01 10:17:32,216 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-01 10:17:32,313 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:17:32,314 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:17:32,318 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:17:32,318 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:17:32,320 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:17:32,320 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:17:32,330 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:17:32,331 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:17:32,332 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:17:32,332 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:17:32,332 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:17:32,333 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:17:32,333 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-01 10:17:32,346 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-01 10:17:32,504 INFO L208 MainTranslator]: Completed translation [2021-11-01 10:17:32,504 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 10:17:32 WrapperNode [2021-11-01 10:17:32,504 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-01 10:17:32,505 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-01 10:17:32,506 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-01 10:17:32,506 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-01 10:17:32,511 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 10:17:32" (1/1) ... [2021-11-01 10:17:32,592 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 10:17:32" (1/1) ... [2021-11-01 10:17:32,652 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-01 10:17:32,653 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-01 10:17:32,653 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-01 10:17:32,653 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-01 10:17:32,660 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 10:17:32" (1/1) ... [2021-11-01 10:17:32,660 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 10:17:32" (1/1) ... [2021-11-01 10:17:32,673 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 10:17:32" (1/1) ... [2021-11-01 10:17:32,674 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 10:17:32" (1/1) ... [2021-11-01 10:17:32,726 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 10:17:32" (1/1) ... [2021-11-01 10:17:32,742 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 10:17:32" (1/1) ... [2021-11-01 10:17:32,756 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 10:17:32" (1/1) ... [2021-11-01 10:17:32,769 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-01 10:17:32,770 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-01 10:17:32,770 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-01 10:17:32,770 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-01 10:17:32,772 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 10:17:32" (1/1) ... [2021-11-01 10:17:32,777 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-01 10:17:32,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-01 10:17:32,797 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) [2021-11-01 10:17:32,815 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 [2021-11-01 10:17:32,832 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2021-11-01 10:17:32,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-01 10:17:32,833 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-01 10:17:32,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-01 10:17:32,833 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-01 10:17:32,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-01 10:17:32,833 INFO L130 BoogieDeclarations]: Found specification of procedure __builtin_uaddl_overflow [2021-11-01 10:17:32,834 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-01 10:17:32,834 INFO L130 BoogieDeclarations]: Found specification of procedure __builtin_umull_overflow [2021-11-01 10:17:32,834 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-01 10:17:32,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-01 10:17:32,834 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-01 10:17:32,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-01 10:17:32,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-01 10:17:36,953 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-01 10:17:36,957 INFO L299 CfgBuilder]: Removed 150 assume(true) statements. [2021-11-01 10:17:36,962 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.11 10:17:36 BoogieIcfgContainer [2021-11-01 10:17:36,962 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-01 10:17:36,964 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-01 10:17:36,965 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-01 10:17:36,967 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-01 10:17:36,968 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.11 10:17:30" (1/3) ... [2021-11-01 10:17:36,969 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55cbd5a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.11 10:17:36, skipping insertion in model container [2021-11-01 10:17:36,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 10:17:32" (2/3) ... [2021-11-01 10:17:36,972 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55cbd5a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.11 10:17:36, skipping insertion in model container [2021-11-01 10:17:36,972 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.11 10:17:36" (3/3) ... [2021-11-01 10:17:36,973 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_hash_iter_done_harness.i [2021-11-01 10:17:36,978 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-01 10:17:36,978 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2021-11-01 10:17:37,023 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-01 10:17:37,029 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-01 10:17:37,029 INFO L340 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2021-11-01 10:17:37,043 INFO L276 IsEmpty]: Start isEmpty. Operand has 206 states, 197 states have (on average 1.4720812182741116) internal successors, (290), 205 states have internal predecessors, (290), 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) [2021-11-01 10:17:37,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-11-01 10:17:37,049 INFO L506 BasicCegarLoop]: Found error trace [2021-11-01 10:17:37,050 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-01 10:17:37,050 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-11-01 10:17:37,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-01 10:17:37,054 INFO L85 PathProgramCache]: Analyzing trace with hash -11255452, now seen corresponding path program 1 times [2021-11-01 10:17:37,060 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-01 10:17:37,061 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940966102] [2021-11-01 10:17:37,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-01 10:17:37,062 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-01 10:17:37,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-01 10:17:37,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-01 10:17:37,527 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-01 10:17:37,527 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940966102] [2021-11-01 10:17:37,528 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940966102] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-01 10:17:37,528 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-01 10:17:37,528 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-01 10:17:37,530 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806814000] [2021-11-01 10:17:37,536 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-01 10:17:37,537 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-01 10:17:37,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-01 10:17:37,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-01 10:17:37,560 INFO L87 Difference]: Start difference. First operand has 206 states, 197 states have (on average 1.4720812182741116) internal successors, (290), 205 states have internal predecessors, (290), 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) Second operand has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 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) [2021-11-01 10:17:39,633 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-01 10:17:40,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-01 10:17:40,849 INFO L93 Difference]: Finished difference Result 408 states and 575 transitions. [2021-11-01 10:17:40,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-01 10:17:40,852 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 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) Word has length 58 [2021-11-01 10:17:40,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-01 10:17:40,859 INFO L225 Difference]: With dead ends: 408 [2021-11-01 10:17:40,859 INFO L226 Difference]: Without dead ends: 200 [2021-11-01 10:17:40,864 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.03ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-01 10:17:40,873 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2936.58ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.64ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3212.33ms IncrementalHoareTripleChecker+Time [2021-11-01 10:17:40,882 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 271 Unknown, 0 Unchecked, 4.64ms Time], IncrementalHoareTripleChecker [0 Valid, 270 Invalid, 1 Unknown, 0 Unchecked, 3212.33ms Time] [2021-11-01 10:17:40,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2021-11-01 10:17:40,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2021-11-01 10:17:40,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 192 states have (on average 1.3802083333333333) internal successors, (265), 199 states have internal predecessors, (265), 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) [2021-11-01 10:17:40,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 265 transitions. [2021-11-01 10:17:40,925 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 265 transitions. Word has length 58 [2021-11-01 10:17:40,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-01 10:17:40,925 INFO L470 AbstractCegarLoop]: Abstraction has 200 states and 265 transitions. [2021-11-01 10:17:40,925 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 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) [2021-11-01 10:17:40,925 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 265 transitions. [2021-11-01 10:17:40,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-11-01 10:17:40,927 INFO L506 BasicCegarLoop]: Found error trace [2021-11-01 10:17:40,927 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-01 10:17:40,927 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-01 10:17:40,927 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-11-01 10:17:40,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-01 10:17:40,928 INFO L85 PathProgramCache]: Analyzing trace with hash 502328866, now seen corresponding path program 1 times [2021-11-01 10:17:40,928 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-01 10:17:40,928 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352003571] [2021-11-01 10:17:40,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-01 10:17:40,929 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-01 10:17:41,026 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-01 10:17:41,026 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1619968928] [2021-11-01 10:17:41,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-01 10:17:41,026 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-01 10:17:41,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-01 10:17:41,059 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) [2021-11-01 10:17:41,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-01 10:17:41,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-01 10:17:41,763 INFO L263 TraceCheckSpWp]: Trace formula consists of 2572 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-01 10:17:41,769 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-01 10:17:42,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-01 10:17:42,226 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-01 10:17:42,226 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-01 10:17:42,226 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352003571] [2021-11-01 10:17:42,226 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-01 10:17:42,226 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1619968928] [2021-11-01 10:17:42,226 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1619968928] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-01 10:17:42,226 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-01 10:17:42,227 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-01 10:17:42,227 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770665638] [2021-11-01 10:17:42,228 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-01 10:17:42,228 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-01 10:17:42,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-01 10:17:42,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-01 10:17:42,228 INFO L87 Difference]: Start difference. First operand 200 states and 265 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 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) [2021-11-01 10:17:44,269 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-01 10:17:46,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-01 10:17:46,012 INFO L93 Difference]: Finished difference Result 337 states and 447 transitions. [2021-11-01 10:17:46,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-01 10:17:46,013 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 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) Word has length 58 [2021-11-01 10:17:46,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-01 10:17:46,016 INFO L225 Difference]: With dead ends: 337 [2021-11-01 10:17:46,016 INFO L226 Difference]: Without dead ends: 200 [2021-11-01 10:17:46,017 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 139.59ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-01 10:17:46,017 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 618 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3289.41ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 618 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 14.05ms SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3649.63ms IncrementalHoareTripleChecker+Time [2021-11-01 10:17:46,018 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [618 Valid, 0 Invalid, 399 Unknown, 0 Unchecked, 14.05ms Time], IncrementalHoareTripleChecker [6 Valid, 392 Invalid, 1 Unknown, 0 Unchecked, 3649.63ms Time] [2021-11-01 10:17:46,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2021-11-01 10:17:46,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2021-11-01 10:17:46,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 192 states have (on average 1.3645833333333333) internal successors, (262), 199 states have internal predecessors, (262), 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) [2021-11-01 10:17:46,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 262 transitions. [2021-11-01 10:17:46,029 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 262 transitions. Word has length 58 [2021-11-01 10:17:46,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-01 10:17:46,029 INFO L470 AbstractCegarLoop]: Abstraction has 200 states and 262 transitions. [2021-11-01 10:17:46,029 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 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) [2021-11-01 10:17:46,029 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 262 transitions. [2021-11-01 10:17:46,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-11-01 10:17:46,030 INFO L506 BasicCegarLoop]: Found error trace [2021-11-01 10:17:46,031 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-01 10:17:46,061 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-11-01 10:17:46,243 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-01 10:17:46,244 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-11-01 10:17:46,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-01 10:17:46,244 INFO L85 PathProgramCache]: Analyzing trace with hash -509107726, now seen corresponding path program 1 times [2021-11-01 10:17:46,245 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-01 10:17:46,245 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401998773] [2021-11-01 10:17:46,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-01 10:17:46,245 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-01 10:17:46,301 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-01 10:17:46,303 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1928605303] [2021-11-01 10:17:46,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-01 10:17:46,304 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-01 10:17:46,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-01 10:17:46,305 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) [2021-11-01 10:17:46,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-01 10:17:47,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-01 10:17:47,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 2582 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-01 10:17:47,064 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-01 10:17:47,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-01 10:17:47,357 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-01 10:17:47,357 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-01 10:17:47,357 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401998773] [2021-11-01 10:17:47,357 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-01 10:17:47,357 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1928605303] [2021-11-01 10:17:47,357 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1928605303] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-01 10:17:47,357 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-01 10:17:47,357 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-01 10:17:47,357 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320469800] [2021-11-01 10:17:47,358 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-01 10:17:47,358 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-01 10:17:47,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-01 10:17:47,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-01 10:17:47,358 INFO L87 Difference]: Start difference. First operand 200 states and 262 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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) [2021-11-01 10:17:49,399 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-01 10:17:54,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-01 10:17:54,726 INFO L93 Difference]: Finished difference Result 562 states and 742 transitions. [2021-11-01 10:17:54,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-01 10:17:54,727 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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) Word has length 60 [2021-11-01 10:17:54,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-01 10:17:54,728 INFO L225 Difference]: With dead ends: 562 [2021-11-01 10:17:54,728 INFO L226 Difference]: Without dead ends: 384 [2021-11-01 10:17:54,729 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 118.74ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-01 10:17:54,730 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 476 mSDsluCounter, 976 mSDsCounter, 0 mSdLazyCounter, 1480 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6602.14ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 476 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 25.37ms SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1480 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7176.28ms IncrementalHoareTripleChecker+Time [2021-11-01 10:17:54,730 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [476 Valid, 0 Invalid, 1489 Unknown, 0 Unchecked, 25.37ms Time], IncrementalHoareTripleChecker [8 Valid, 1480 Invalid, 1 Unknown, 0 Unchecked, 7176.28ms Time] [2021-11-01 10:17:54,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2021-11-01 10:17:54,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 206. [2021-11-01 10:17:54,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 198 states have (on average 1.3535353535353536) internal successors, (268), 205 states have internal predecessors, (268), 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) [2021-11-01 10:17:54,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 268 transitions. [2021-11-01 10:17:54,750 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 268 transitions. Word has length 60 [2021-11-01 10:17:54,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-01 10:17:54,750 INFO L470 AbstractCegarLoop]: Abstraction has 206 states and 268 transitions. [2021-11-01 10:17:54,750 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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) [2021-11-01 10:17:54,750 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 268 transitions. [2021-11-01 10:17:54,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-11-01 10:17:54,756 INFO L506 BasicCegarLoop]: Found error trace [2021-11-01 10:17:54,756 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-01 10:17:54,784 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-01 10:17:54,967 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2021-11-01 10:17:54,968 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-11-01 10:17:54,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-01 10:17:54,971 INFO L85 PathProgramCache]: Analyzing trace with hash -119228470, now seen corresponding path program 1 times [2021-11-01 10:17:54,971 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-01 10:17:54,972 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681194693] [2021-11-01 10:17:54,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-01 10:17:54,972 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-01 10:17:55,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-01 10:17:55,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-01 10:17:55,503 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-01 10:17:55,504 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681194693] [2021-11-01 10:17:55,504 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681194693] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-01 10:17:55,504 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-01 10:17:55,504 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-01 10:17:55,504 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309015219] [2021-11-01 10:17:55,504 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-01 10:17:55,505 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-01 10:17:55,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-01 10:17:55,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-11-01 10:17:55,505 INFO L87 Difference]: Start difference. First operand 206 states and 268 transitions. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 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) [2021-11-01 10:17:57,548 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-01 10:18:02,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-01 10:18:02,734 INFO L93 Difference]: Finished difference Result 577 states and 750 transitions. [2021-11-01 10:18:02,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-01 10:18:02,734 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 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) Word has length 64 [2021-11-01 10:18:02,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-01 10:18:02,736 INFO L225 Difference]: With dead ends: 577 [2021-11-01 10:18:02,736 INFO L226 Difference]: Without dead ends: 409 [2021-11-01 10:18:02,737 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 536.84ms TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2021-11-01 10:18:02,737 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 885 mSDsluCounter, 861 mSDsCounter, 0 mSdLazyCounter, 1335 mSolverCounterSat, 31 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6199.38ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 885 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 47.69ms SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1335 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6728.85ms IncrementalHoareTripleChecker+Time [2021-11-01 10:18:02,737 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [885 Valid, 0 Invalid, 1367 Unknown, 0 Unchecked, 47.69ms Time], IncrementalHoareTripleChecker [31 Valid, 1335 Invalid, 1 Unknown, 0 Unchecked, 6728.85ms Time] [2021-11-01 10:18:02,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2021-11-01 10:18:02,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 308. [2021-11-01 10:18:02,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 300 states have (on average 1.3866666666666667) internal successors, (416), 307 states have internal predecessors, (416), 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) [2021-11-01 10:18:02,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 416 transitions. [2021-11-01 10:18:02,777 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 416 transitions. Word has length 64 [2021-11-01 10:18:02,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-01 10:18:02,778 INFO L470 AbstractCegarLoop]: Abstraction has 308 states and 416 transitions. [2021-11-01 10:18:02,778 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 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) [2021-11-01 10:18:02,779 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 416 transitions. [2021-11-01 10:18:02,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-11-01 10:18:02,781 INFO L506 BasicCegarLoop]: Found error trace [2021-11-01 10:18:02,781 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-01 10:18:02,781 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-01 10:18:02,782 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-11-01 10:18:02,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-01 10:18:02,783 INFO L85 PathProgramCache]: Analyzing trace with hash 128918024, now seen corresponding path program 1 times [2021-11-01 10:18:02,783 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-01 10:18:02,783 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891815090] [2021-11-01 10:18:02,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-01 10:18:02,783 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-01 10:18:02,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-01 10:18:03,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-01 10:18:03,016 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-01 10:18:03,016 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891815090] [2021-11-01 10:18:03,016 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891815090] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-01 10:18:03,016 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-01 10:18:03,016 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-01 10:18:03,017 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82125912] [2021-11-01 10:18:03,017 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-01 10:18:03,017 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-01 10:18:03,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-01 10:18:03,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-01 10:18:03,017 INFO L87 Difference]: Start difference. First operand 308 states and 416 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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) [2021-11-01 10:18:05,236 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-01 10:18:07,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-01 10:18:07,276 INFO L93 Difference]: Finished difference Result 579 states and 789 transitions. [2021-11-01 10:18:07,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-01 10:18:07,277 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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) Word has length 64 [2021-11-01 10:18:07,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-01 10:18:07,278 INFO L225 Difference]: With dead ends: 579 [2021-11-01 10:18:07,278 INFO L226 Difference]: Without dead ends: 306 [2021-11-01 10:18:07,279 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 56.08ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-01 10:18:07,282 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 236 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3782.76ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.87ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4179.48ms IncrementalHoareTripleChecker+Time [2021-11-01 10:18:07,282 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [236 Valid, 0 Invalid, 519 Unknown, 0 Unchecked, 6.87ms Time], IncrementalHoareTripleChecker [4 Valid, 514 Invalid, 1 Unknown, 0 Unchecked, 4179.48ms Time] [2021-11-01 10:18:07,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2021-11-01 10:18:07,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 306. [2021-11-01 10:18:07,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 298 states have (on average 1.3758389261744965) internal successors, (410), 305 states have internal predecessors, (410), 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) [2021-11-01 10:18:07,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 410 transitions. [2021-11-01 10:18:07,303 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 410 transitions. Word has length 64 [2021-11-01 10:18:07,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-01 10:18:07,304 INFO L470 AbstractCegarLoop]: Abstraction has 306 states and 410 transitions. [2021-11-01 10:18:07,306 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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) [2021-11-01 10:18:07,307 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 410 transitions. [2021-11-01 10:18:07,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-11-01 10:18:07,308 INFO L506 BasicCegarLoop]: Found error trace [2021-11-01 10:18:07,308 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-01 10:18:07,308 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-01 10:18:07,309 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-11-01 10:18:07,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-01 10:18:07,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1145717007, now seen corresponding path program 1 times [2021-11-01 10:18:07,309 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-01 10:18:07,310 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552984859] [2021-11-01 10:18:07,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-01 10:18:07,310 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-01 10:18:07,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-01 10:18:07,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-01 10:18:07,658 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-01 10:18:07,658 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552984859] [2021-11-01 10:18:07,658 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552984859] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-01 10:18:07,658 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-01 10:18:07,658 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-01 10:18:07,658 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045135621] [2021-11-01 10:18:07,659 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-01 10:18:07,659 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-01 10:18:07,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-01 10:18:07,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-01 10:18:07,659 INFO L87 Difference]: Start difference. First operand 306 states and 410 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 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) [2021-11-01 10:18:09,720 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-01 10:18:12,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-01 10:18:12,488 INFO L93 Difference]: Finished difference Result 583 states and 786 transitions. [2021-11-01 10:18:12,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-01 10:18:12,489 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 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) Word has length 66 [2021-11-01 10:18:12,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-01 10:18:12,490 INFO L225 Difference]: With dead ends: 583 [2021-11-01 10:18:12,490 INFO L226 Difference]: Without dead ends: 314 [2021-11-01 10:18:12,491 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 323.93ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-01 10:18:12,491 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 260 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 719 mSolverCounterSat, 38 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4116.86ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 9.62ms SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 719 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4542.74ms IncrementalHoareTripleChecker+Time [2021-11-01 10:18:12,491 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [260 Valid, 0 Invalid, 758 Unknown, 0 Unchecked, 9.62ms Time], IncrementalHoareTripleChecker [38 Valid, 719 Invalid, 1 Unknown, 0 Unchecked, 4542.74ms Time] [2021-11-01 10:18:12,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2021-11-01 10:18:12,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 306. [2021-11-01 10:18:12,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 298 states have (on average 1.3456375838926173) internal successors, (401), 305 states have internal predecessors, (401), 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) [2021-11-01 10:18:12,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 401 transitions. [2021-11-01 10:18:12,502 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 401 transitions. Word has length 66 [2021-11-01 10:18:12,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-01 10:18:12,502 INFO L470 AbstractCegarLoop]: Abstraction has 306 states and 401 transitions. [2021-11-01 10:18:12,503 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 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) [2021-11-01 10:18:12,503 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 401 transitions. [2021-11-01 10:18:12,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-11-01 10:18:12,504 INFO L506 BasicCegarLoop]: Found error trace [2021-11-01 10:18:12,504 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-01 10:18:12,504 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-01 10:18:12,506 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-11-01 10:18:12,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-01 10:18:12,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1996384766, now seen corresponding path program 1 times [2021-11-01 10:18:12,507 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-01 10:18:12,507 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595250598] [2021-11-01 10:18:12,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-01 10:18:12,508 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-01 10:18:12,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-01 10:18:12,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-01 10:18:12,903 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-01 10:18:12,903 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595250598] [2021-11-01 10:18:12,903 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595250598] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-01 10:18:12,903 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-01 10:18:12,903 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-01 10:18:12,903 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107842011] [2021-11-01 10:18:12,904 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-01 10:18:12,904 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-01 10:18:12,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-01 10:18:12,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-01 10:18:12,904 INFO L87 Difference]: Start difference. First operand 306 states and 401 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 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) [2021-11-01 10:18:15,265 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.36s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-01 10:18:19,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-01 10:18:19,731 INFO L93 Difference]: Finished difference Result 571 states and 739 transitions. [2021-11-01 10:18:19,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-01 10:18:19,731 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 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) Word has length 67 [2021-11-01 10:18:19,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-01 10:18:19,734 INFO L225 Difference]: With dead ends: 571 [2021-11-01 10:18:19,734 INFO L226 Difference]: Without dead ends: 331 [2021-11-01 10:18:19,735 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 223.92ms TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-11-01 10:18:19,735 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 446 mSDsluCounter, 643 mSDsCounter, 0 mSdLazyCounter, 1208 mSolverCounterSat, 14 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6024.64ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 16.23ms SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1208 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6616.94ms IncrementalHoareTripleChecker+Time [2021-11-01 10:18:19,735 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [446 Valid, 0 Invalid, 1223 Unknown, 0 Unchecked, 16.23ms Time], IncrementalHoareTripleChecker [14 Valid, 1208 Invalid, 1 Unknown, 0 Unchecked, 6616.94ms Time] [2021-11-01 10:18:19,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2021-11-01 10:18:19,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 306. [2021-11-01 10:18:19,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 298 states have (on average 1.3355704697986577) internal successors, (398), 305 states have internal predecessors, (398), 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) [2021-11-01 10:18:19,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 398 transitions. [2021-11-01 10:18:19,746 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 398 transitions. Word has length 67 [2021-11-01 10:18:19,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-01 10:18:19,746 INFO L470 AbstractCegarLoop]: Abstraction has 306 states and 398 transitions. [2021-11-01 10:18:19,747 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 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) [2021-11-01 10:18:19,747 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 398 transitions. [2021-11-01 10:18:19,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-11-01 10:18:19,747 INFO L506 BasicCegarLoop]: Found error trace [2021-11-01 10:18:19,748 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-01 10:18:19,748 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-01 10:18:19,748 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-11-01 10:18:19,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-01 10:18:19,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1974209867, now seen corresponding path program 1 times [2021-11-01 10:18:19,749 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-01 10:18:19,749 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993532255] [2021-11-01 10:18:19,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-01 10:18:19,749 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-01 10:18:19,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-01 10:18:20,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-01 10:18:20,528 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-01 10:18:20,528 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993532255] [2021-11-01 10:18:20,528 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993532255] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-01 10:18:20,528 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-01 10:18:20,528 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-01 10:18:20,529 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172012069] [2021-11-01 10:18:20,529 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-01 10:18:20,529 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-01 10:18:20,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-01 10:18:20,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-11-01 10:18:20,529 INFO L87 Difference]: Start difference. First operand 306 states and 398 transitions. Second operand has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 states have internal predecessors, (76), 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) [2021-11-01 10:18:22,831 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.30s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-01 10:18:33,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-01 10:18:33,919 INFO L93 Difference]: Finished difference Result 963 states and 1198 transitions. [2021-11-01 10:18:33,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-11-01 10:18:33,920 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 states have internal predecessors, (76), 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) Word has length 76 [2021-11-01 10:18:33,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-01 10:18:33,922 INFO L225 Difference]: With dead ends: 963 [2021-11-01 10:18:33,922 INFO L226 Difference]: Without dead ends: 847 [2021-11-01 10:18:33,923 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 2241.70ms TimeCoverageRelationStatistics Valid=303, Invalid=887, Unknown=0, NotChecked=0, Total=1190 [2021-11-01 10:18:33,924 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 2449 mSDsluCounter, 1645 mSDsCounter, 0 mSdLazyCounter, 2571 mSolverCounterSat, 91 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10211.53ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 2449 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 36.01ms SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 2571 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11267.28ms IncrementalHoareTripleChecker+Time [2021-11-01 10:18:33,924 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2449 Valid, 0 Invalid, 2663 Unknown, 0 Unchecked, 36.01ms Time], IncrementalHoareTripleChecker [91 Valid, 2571 Invalid, 1 Unknown, 0 Unchecked, 11267.28ms Time] [2021-11-01 10:18:33,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2021-11-01 10:18:33,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 355. [2021-11-01 10:18:33,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 347 states have (on average 1.3285302593659942) internal successors, (461), 354 states have internal predecessors, (461), 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) [2021-11-01 10:18:33,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 461 transitions. [2021-11-01 10:18:33,939 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 461 transitions. Word has length 76 [2021-11-01 10:18:33,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-01 10:18:33,940 INFO L470 AbstractCegarLoop]: Abstraction has 355 states and 461 transitions. [2021-11-01 10:18:33,940 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 states have internal predecessors, (76), 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) [2021-11-01 10:18:33,940 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 461 transitions. [2021-11-01 10:18:33,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-11-01 10:18:33,940 INFO L506 BasicCegarLoop]: Found error trace [2021-11-01 10:18:33,940 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-01 10:18:33,940 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-01 10:18:33,941 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-11-01 10:18:33,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-01 10:18:33,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1317329973, now seen corresponding path program 1 times [2021-11-01 10:18:33,941 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-01 10:18:33,941 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106961873] [2021-11-01 10:18:33,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-01 10:18:33,942 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-01 10:18:34,003 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-01 10:18:34,004 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1990699981] [2021-11-01 10:18:34,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-01 10:18:34,004 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-01 10:18:34,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-01 10:18:34,006 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) [2021-11-01 10:18:34,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-01 10:18:34,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-01 10:18:34,660 INFO L263 TraceCheckSpWp]: Trace formula consists of 2733 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-01 10:18:34,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-01 10:18:34,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-01 10:18:34,881 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-01 10:18:34,881 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-01 10:18:34,881 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106961873] [2021-11-01 10:18:34,881 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-01 10:18:34,881 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1990699981] [2021-11-01 10:18:34,881 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1990699981] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-01 10:18:34,881 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-01 10:18:34,881 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-01 10:18:34,881 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539670448] [2021-11-01 10:18:34,882 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-01 10:18:34,882 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-01 10:18:34,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-01 10:18:34,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-01 10:18:34,882 INFO L87 Difference]: Start difference. First operand 355 states and 461 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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) [2021-11-01 10:18:36,960 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-01 10:18:41,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-01 10:18:41,480 INFO L93 Difference]: Finished difference Result 996 states and 1301 transitions. [2021-11-01 10:18:41,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-01 10:18:41,481 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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) Word has length 76 [2021-11-01 10:18:41,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-01 10:18:41,483 INFO L225 Difference]: With dead ends: 996 [2021-11-01 10:18:41,483 INFO L226 Difference]: Without dead ends: 666 [2021-11-01 10:18:41,483 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 109.37ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-01 10:18:41,484 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 438 mSDsluCounter, 830 mSDsCounter, 0 mSdLazyCounter, 1208 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5773.07ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 14.37ms SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1208 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6434.43ms IncrementalHoareTripleChecker+Time [2021-11-01 10:18:41,484 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [438 Valid, 0 Invalid, 1217 Unknown, 0 Unchecked, 14.37ms Time], IncrementalHoareTripleChecker [8 Valid, 1208 Invalid, 1 Unknown, 0 Unchecked, 6434.43ms Time] [2021-11-01 10:18:41,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2021-11-01 10:18:41,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 364. [2021-11-01 10:18:41,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 356 states have (on average 1.3202247191011236) internal successors, (470), 363 states have internal predecessors, (470), 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) [2021-11-01 10:18:41,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 470 transitions. [2021-11-01 10:18:41,499 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 470 transitions. Word has length 76 [2021-11-01 10:18:41,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-01 10:18:41,500 INFO L470 AbstractCegarLoop]: Abstraction has 364 states and 470 transitions. [2021-11-01 10:18:41,500 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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) [2021-11-01 10:18:41,500 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 470 transitions. [2021-11-01 10:18:41,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-11-01 10:18:41,501 INFO L506 BasicCegarLoop]: Found error trace [2021-11-01 10:18:41,501 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-01 10:18:41,524 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-11-01 10:18:41,714 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-01 10:18:41,714 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-11-01 10:18:41,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-01 10:18:41,715 INFO L85 PathProgramCache]: Analyzing trace with hash -2134978423, now seen corresponding path program 1 times [2021-11-01 10:18:41,715 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-01 10:18:41,715 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035866744] [2021-11-01 10:18:41,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-01 10:18:41,716 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-01 10:18:41,799 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-01 10:18:41,799 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [17431893] [2021-11-01 10:18:41,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-01 10:18:41,799 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-01 10:18:41,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-01 10:18:41,801 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) [2021-11-01 10:18:41,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-01 10:18:42,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-01 10:18:42,496 INFO L263 TraceCheckSpWp]: Trace formula consists of 2734 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-01 10:18:42,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-01 10:18:42,781 INFO L388 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 10 treesize of output 4 [2021-11-01 10:18:42,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-01 10:18:42,835 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-01 10:18:42,835 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-01 10:18:42,835 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035866744] [2021-11-01 10:18:42,835 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-01 10:18:42,835 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [17431893] [2021-11-01 10:18:42,835 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [17431893] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-01 10:18:42,835 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-01 10:18:42,835 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-01 10:18:42,835 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830543799] [2021-11-01 10:18:42,836 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-01 10:18:42,836 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-01 10:18:42,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-01 10:18:42,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-01 10:18:42,836 INFO L87 Difference]: Start difference. First operand 364 states and 470 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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) [2021-11-01 10:18:45,572 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.74s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-01 10:18:49,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-01 10:18:49,351 INFO L93 Difference]: Finished difference Result 656 states and 858 transitions. [2021-11-01 10:18:49,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-01 10:18:49,352 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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) Word has length 76 [2021-11-01 10:18:49,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-01 10:18:49,354 INFO L225 Difference]: With dead ends: 656 [2021-11-01 10:18:49,355 INFO L226 Difference]: Without dead ends: 514 [2021-11-01 10:18:49,355 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 139.34ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-01 10:18:49,356 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 108 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 1007 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5793.14ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 8.76ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1007 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6404.17ms IncrementalHoareTripleChecker+Time [2021-11-01 10:18:49,357 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [108 Valid, 0 Invalid, 1009 Unknown, 0 Unchecked, 8.76ms Time], IncrementalHoareTripleChecker [1 Valid, 1007 Invalid, 1 Unknown, 0 Unchecked, 6404.17ms Time] [2021-11-01 10:18:49,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2021-11-01 10:18:49,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 372. [2021-11-01 10:18:49,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 364 states have (on average 1.3131868131868132) internal successors, (478), 371 states have internal predecessors, (478), 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) [2021-11-01 10:18:49,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 478 transitions. [2021-11-01 10:18:49,372 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 478 transitions. Word has length 76 [2021-11-01 10:18:49,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-01 10:18:49,372 INFO L470 AbstractCegarLoop]: Abstraction has 372 states and 478 transitions. [2021-11-01 10:18:49,372 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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) [2021-11-01 10:18:49,372 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 478 transitions. [2021-11-01 10:18:49,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-11-01 10:18:49,373 INFO L506 BasicCegarLoop]: Found error trace [2021-11-01 10:18:49,373 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-01 10:18:49,411 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-01 10:18:49,597 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-01 10:18:49,598 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-11-01 10:18:49,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-01 10:18:49,598 INFO L85 PathProgramCache]: Analyzing trace with hash -2134918841, now seen corresponding path program 1 times [2021-11-01 10:18:49,598 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-01 10:18:49,598 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604008379] [2021-11-01 10:18:49,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-01 10:18:49,598 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-01 10:18:49,677 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-01 10:18:49,677 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1236191739] [2021-11-01 10:18:49,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-01 10:18:49,677 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-01 10:18:49,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-01 10:18:49,704 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) [2021-11-01 10:18:49,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-01 10:18:50,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-01 10:18:50,453 INFO L263 TraceCheckSpWp]: Trace formula consists of 2737 conjuncts, 15 conjunts are in the unsatisfiable core [2021-11-01 10:18:50,456 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-01 10:18:50,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-01 10:18:50,804 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-01 10:18:50,804 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-01 10:18:50,804 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604008379] [2021-11-01 10:18:50,804 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-01 10:18:50,804 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1236191739] [2021-11-01 10:18:50,804 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1236191739] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-01 10:18:50,804 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-01 10:18:50,804 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-01 10:18:50,804 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803457904] [2021-11-01 10:18:50,804 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-01 10:18:50,804 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-01 10:18:50,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-01 10:18:50,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-01 10:18:50,805 INFO L87 Difference]: Start difference. First operand 372 states and 478 transitions. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 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) [2021-11-01 10:18:53,628 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.82s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-01 10:18:58,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-01 10:18:58,714 INFO L93 Difference]: Finished difference Result 767 states and 971 transitions. [2021-11-01 10:18:58,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-01 10:18:58,715 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 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) Word has length 76 [2021-11-01 10:18:58,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-01 10:18:58,716 INFO L225 Difference]: With dead ends: 767 [2021-11-01 10:18:58,716 INFO L226 Difference]: Without dead ends: 431 [2021-11-01 10:18:58,717 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 273.05ms TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2021-11-01 10:18:58,717 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 83 mSDsluCounter, 1142 mSDsCounter, 0 mSdLazyCounter, 1589 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6981.32ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 12.61ms SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1589 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7675.14ms IncrementalHoareTripleChecker+Time [2021-11-01 10:18:58,718 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 0 Invalid, 1633 Unknown, 0 Unchecked, 12.61ms Time], IncrementalHoareTripleChecker [43 Valid, 1589 Invalid, 1 Unknown, 0 Unchecked, 7675.14ms Time] [2021-11-01 10:18:58,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2021-11-01 10:18:58,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 329. [2021-11-01 10:18:58,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 321 states have (on average 1.2710280373831775) internal successors, (408), 328 states have internal predecessors, (408), 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) [2021-11-01 10:18:58,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 408 transitions. [2021-11-01 10:18:58,731 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 408 transitions. Word has length 76 [2021-11-01 10:18:58,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-01 10:18:58,731 INFO L470 AbstractCegarLoop]: Abstraction has 329 states and 408 transitions. [2021-11-01 10:18:58,731 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 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) [2021-11-01 10:18:58,731 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 408 transitions. [2021-11-01 10:18:58,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-11-01 10:18:58,732 INFO L506 BasicCegarLoop]: Found error trace [2021-11-01 10:18:58,732 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-01 10:18:58,755 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2021-11-01 10:18:58,943 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-11-01 10:18:58,944 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-11-01 10:18:58,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-01 10:18:58,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1036608948, now seen corresponding path program 1 times [2021-11-01 10:18:58,944 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-01 10:18:58,944 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100775765] [2021-11-01 10:18:58,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-01 10:18:58,944 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-01 10:18:59,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-01 10:19:00,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-01 10:19:00,146 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-01 10:19:00,146 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100775765] [2021-11-01 10:19:00,146 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100775765] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-01 10:19:00,146 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-01 10:19:00,146 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-01 10:19:00,146 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478025038] [2021-11-01 10:19:00,146 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-01 10:19:00,146 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-01 10:19:00,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-01 10:19:00,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-01 10:19:00,147 INFO L87 Difference]: Start difference. First operand 329 states and 408 transitions. Second operand has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 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) [2021-11-01 10:19:02,188 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-01 10:19:06,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-01 10:19:06,996 INFO L93 Difference]: Finished difference Result 489 states and 617 transitions. [2021-11-01 10:19:06,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-01 10:19:06,997 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 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) Word has length 89 [2021-11-01 10:19:06,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-01 10:19:06,999 INFO L225 Difference]: With dead ends: 489 [2021-11-01 10:19:06,999 INFO L226 Difference]: Without dead ends: 487 [2021-11-01 10:19:06,999 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 634.60ms TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2021-11-01 10:19:07,000 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 317 mSDsluCounter, 726 mSDsCounter, 0 mSdLazyCounter, 1200 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5771.63ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 10.54ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1200 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6337.46ms IncrementalHoareTripleChecker+Time [2021-11-01 10:19:07,000 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [317 Valid, 0 Invalid, 1205 Unknown, 0 Unchecked, 10.54ms Time], IncrementalHoareTripleChecker [4 Valid, 1200 Invalid, 1 Unknown, 0 Unchecked, 6337.46ms Time] [2021-11-01 10:19:07,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2021-11-01 10:19:07,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 333. [2021-11-01 10:19:07,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 325 states have (on average 1.2676923076923077) internal successors, (412), 332 states have internal predecessors, (412), 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) [2021-11-01 10:19:07,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 412 transitions. [2021-11-01 10:19:07,014 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 412 transitions. Word has length 89 [2021-11-01 10:19:07,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-01 10:19:07,014 INFO L470 AbstractCegarLoop]: Abstraction has 333 states and 412 transitions. [2021-11-01 10:19:07,014 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 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) [2021-11-01 10:19:07,014 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 412 transitions. [2021-11-01 10:19:07,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-11-01 10:19:07,015 INFO L506 BasicCegarLoop]: Found error trace [2021-11-01 10:19:07,015 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-01 10:19:07,016 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-01 10:19:07,016 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-11-01 10:19:07,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-01 10:19:07,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1845955574, now seen corresponding path program 1 times [2021-11-01 10:19:07,016 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-01 10:19:07,016 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192140746] [2021-11-01 10:19:07,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-01 10:19:07,017 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-01 10:19:07,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-01 10:19:07,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-01 10:19:07,304 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-01 10:19:07,304 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192140746] [2021-11-01 10:19:07,305 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192140746] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-01 10:19:07,305 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-01 10:19:07,305 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-01 10:19:07,305 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26873699] [2021-11-01 10:19:07,305 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-01 10:19:07,305 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-01 10:19:07,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-01 10:19:07,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-01 10:19:07,306 INFO L87 Difference]: Start difference. First operand 333 states and 412 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 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) [2021-11-01 10:19:09,819 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.51s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-01 10:19:13,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-01 10:19:13,232 INFO L93 Difference]: Finished difference Result 633 states and 804 transitions. [2021-11-01 10:19:13,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-01 10:19:13,233 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 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) Word has length 89 [2021-11-01 10:19:13,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-01 10:19:13,235 INFO L225 Difference]: With dead ends: 633 [2021-11-01 10:19:13,235 INFO L226 Difference]: Without dead ends: 479 [2021-11-01 10:19:13,235 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 95.75ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-01 10:19:13,235 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 212 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 918 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5215.25ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.48ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 918 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5835.96ms IncrementalHoareTripleChecker+Time [2021-11-01 10:19:13,236 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [212 Valid, 0 Invalid, 921 Unknown, 0 Unchecked, 6.48ms Time], IncrementalHoareTripleChecker [2 Valid, 918 Invalid, 1 Unknown, 0 Unchecked, 5835.96ms Time] [2021-11-01 10:19:13,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2021-11-01 10:19:13,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 327. [2021-11-01 10:19:13,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 320 states have (on average 1.259375) internal successors, (403), 326 states have internal predecessors, (403), 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) [2021-11-01 10:19:13,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 403 transitions. [2021-11-01 10:19:13,248 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 403 transitions. Word has length 89 [2021-11-01 10:19:13,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-01 10:19:13,249 INFO L470 AbstractCegarLoop]: Abstraction has 327 states and 403 transitions. [2021-11-01 10:19:13,249 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 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) [2021-11-01 10:19:13,249 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 403 transitions. [2021-11-01 10:19:13,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-11-01 10:19:13,249 INFO L506 BasicCegarLoop]: Found error trace [2021-11-01 10:19:13,249 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-01 10:19:13,249 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-01 10:19:13,250 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-11-01 10:19:13,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-01 10:19:13,250 INFO L85 PathProgramCache]: Analyzing trace with hash -251077002, now seen corresponding path program 1 times [2021-11-01 10:19:13,250 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-01 10:19:13,250 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186870062] [2021-11-01 10:19:13,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-01 10:19:13,250 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-01 10:19:13,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-01 10:19:14,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-01 10:19:14,141 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-01 10:19:14,141 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186870062] [2021-11-01 10:19:14,141 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186870062] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-01 10:19:14,141 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-01 10:19:14,141 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-01 10:19:14,142 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624570350] [2021-11-01 10:19:14,142 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-01 10:19:14,142 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-01 10:19:14,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-01 10:19:14,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-01 10:19:14,142 INFO L87 Difference]: Start difference. First operand 327 states and 403 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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) [2021-11-01 10:19:16,184 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-01 10:19:18,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-01 10:19:18,915 INFO L93 Difference]: Finished difference Result 630 states and 778 transitions. [2021-11-01 10:19:18,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-01 10:19:18,916 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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) Word has length 91 [2021-11-01 10:19:18,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-01 10:19:18,916 INFO L225 Difference]: With dead ends: 630 [2021-11-01 10:19:18,917 INFO L226 Difference]: Without dead ends: 327 [2021-11-01 10:19:18,917 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 92.09ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-01 10:19:18,917 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 2 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 710 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4221.58ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.31ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 710 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4689.57ms IncrementalHoareTripleChecker+Time [2021-11-01 10:19:18,918 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 0 Invalid, 716 Unknown, 0 Unchecked, 4.31ms Time], IncrementalHoareTripleChecker [5 Valid, 710 Invalid, 1 Unknown, 0 Unchecked, 4689.57ms Time] [2021-11-01 10:19:18,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2021-11-01 10:19:18,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 318. [2021-11-01 10:19:18,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 311 states have (on average 1.2508038585209003) internal successors, (389), 317 states have internal predecessors, (389), 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) [2021-11-01 10:19:18,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 389 transitions. [2021-11-01 10:19:18,929 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 389 transitions. Word has length 91 [2021-11-01 10:19:18,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-01 10:19:18,929 INFO L470 AbstractCegarLoop]: Abstraction has 318 states and 389 transitions. [2021-11-01 10:19:18,929 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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) [2021-11-01 10:19:18,929 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 389 transitions. [2021-11-01 10:19:18,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-11-01 10:19:18,930 INFO L506 BasicCegarLoop]: Found error trace [2021-11-01 10:19:18,930 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-01 10:19:18,930 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-01 10:19:18,930 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-11-01 10:19:18,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-01 10:19:18,931 INFO L85 PathProgramCache]: Analyzing trace with hash 486940505, now seen corresponding path program 1 times [2021-11-01 10:19:18,931 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-01 10:19:18,931 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457492218] [2021-11-01 10:19:18,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-01 10:19:18,931 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-01 10:19:18,984 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-01 10:19:18,984 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [894200915] [2021-11-01 10:19:18,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-01 10:19:18,985 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-01 10:19:18,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-01 10:19:18,986 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) [2021-11-01 10:19:18,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-01 10:19:19,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-01 10:19:19,725 INFO L263 TraceCheckSpWp]: Trace formula consists of 2956 conjuncts, 76 conjunts are in the unsatisfiable core [2021-11-01 10:19:19,730 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-01 10:19:21,069 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 29 [2021-11-01 10:19:21,079 INFO L388 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 26 treesize of output 22 [2021-11-01 10:19:21,114 INFO L388 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 11 treesize of output 7 [2021-11-01 10:19:21,404 INFO L388 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 44 treesize of output 36 [2021-11-01 10:19:21,413 INFO L388 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 33 treesize of output 21 [2021-11-01 10:19:22,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-01 10:19:22,249 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-01 10:19:22,249 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-01 10:19:22,249 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457492218] [2021-11-01 10:19:22,249 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-01 10:19:22,249 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [894200915] [2021-11-01 10:19:22,249 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [894200915] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-01 10:19:22,249 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-01 10:19:22,249 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-01 10:19:22,249 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006103088] [2021-11-01 10:19:22,250 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-01 10:19:22,250 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-01 10:19:22,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-01 10:19:22,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2021-11-01 10:19:22,250 INFO L87 Difference]: Start difference. First operand 318 states and 389 transitions. Second operand has 14 states, 14 states have (on average 6.928571428571429) internal successors, (97), 14 states have internal predecessors, (97), 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) [2021-11-01 10:19:24,298 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-01 10:19:29,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-01 10:19:29,477 INFO L93 Difference]: Finished difference Result 318 states and 389 transitions. [2021-11-01 10:19:29,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-01 10:19:29,478 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.928571428571429) internal successors, (97), 14 states have internal predecessors, (97), 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) Word has length 97 [2021-11-01 10:19:29,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-01 10:19:29,478 INFO L225 Difference]: With dead ends: 318 [2021-11-01 10:19:29,478 INFO L226 Difference]: Without dead ends: 0 [2021-11-01 10:19:29,478 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 4574.21ms TimeCoverageRelationStatistics Valid=189, Invalid=461, Unknown=0, NotChecked=0, Total=650 [2021-11-01 10:19:29,479 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 88 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 21 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3186.84ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.88ms SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3530.73ms IncrementalHoareTripleChecker+Time [2021-11-01 10:19:29,479 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 0 Invalid, 375 Unknown, 0 Unchecked, 3.88ms Time], IncrementalHoareTripleChecker [21 Valid, 353 Invalid, 1 Unknown, 0 Unchecked, 3530.73ms Time] [2021-11-01 10:19:29,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-11-01 10:19:29,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-11-01 10:19:29,479 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) [2021-11-01 10:19:29,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-11-01 10:19:29,480 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 97 [2021-11-01 10:19:29,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-01 10:19:29,480 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-01 10:19:29,480 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.928571428571429) internal successors, (97), 14 states have internal predecessors, (97), 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) [2021-11-01 10:19:29,480 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-11-01 10:19:29,480 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-11-01 10:19:29,482 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (7 of 8 remaining) [2021-11-01 10:19:29,482 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (6 of 8 remaining) [2021-11-01 10:19:29,482 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (5 of 8 remaining) [2021-11-01 10:19:29,482 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (4 of 8 remaining) [2021-11-01 10:19:29,482 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (3 of 8 remaining) [2021-11-01 10:19:29,483 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (2 of 8 remaining) [2021-11-01 10:19:29,483 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (1 of 8 remaining) [2021-11-01 10:19:29,483 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (0 of 8 remaining) [2021-11-01 10:19:29,506 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-01 10:19:29,691 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-11-01 10:19:29,693 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-11-01 10:19:29,697 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 10:19:29,709 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 10:19:29,710 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 10:19:29,711 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 10:19:29,717 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 10:19:29,731 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 10:19:29,732 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 10:19:29,733 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 10:19:29,733 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 10:19:29,733 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 10:19:29,734 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 10:19:29,734 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 10:19:29,735 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 10:19:29,749 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 10:19:29,751 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 10:19:29,751 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 10:19:29,752 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 10:19:29,757 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 10:19:29,758 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 10:19:29,758 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 10:19:29,765 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 10:19:29,765 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 10:19:29,767 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 10:19:29,767 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 10:19:29,774 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 10:19:29,775 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 10:19:29,776 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 10:19:29,777 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 10:19:29,778 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 10:19:29,779 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 10:19:29,779 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 10:19:29,779 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 10:19:29,792 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 10:19:29,793 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 10:19:29,793 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 10:19:29,796 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 10:19:29,797 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 10:19:29,802 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 10:19:29,803 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 10:19:29,803 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 10:19:29,805 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 10:19:29,805 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 10:19:29,806 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 10:19:29,806 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 10:19:29,812 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 10:19:29,813 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-01 10:19:34,162 INFO L854 garLoopResultBuilder]: At program point L10044(lines 9999 10046) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_hash_iter_done_harness_~#map~0.base|) |ULTIMATE.start_aws_hash_iter_done_harness_~#map~0.offset|))) (and |ULTIMATE.start_aws_hash_table_is_valid_#t~short1475| |ULTIMATE.start_aws_hash_table_is_valid_#t~short1478| (= |ULTIMATE.start_bounded_malloc_#res.offset| 0) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (= ULTIMATE.start_hash_table_state_is_valid_~map.offset 0) (< (+ |ULTIMATE.start_bounded_malloc_#res.base| 1) |ULTIMATE.start_aws_hash_iter_done_harness_~#map~0.base|) (= |ULTIMATE.start_hash_table_state_is_valid_#res| 0) (= |ULTIMATE.start_aws_hash_iter_done_harness_~#map~0.base| ULTIMATE.start_aws_hash_table_is_valid_~map.base) (<= (+ (select (select |#memory_int| ULTIMATE.start_hash_table_state_is_valid_~map.base) 40) 1) 0) (= ULTIMATE.start_hash_table_state_is_valid_~size_at_least_two~0 0) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_iter_done_harness_~#map~0.base|) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 1) 0) (or (= ULTIMATE.start_assume_abort_if_not_~cond 1) (= ULTIMATE.start_assume_abort_if_not_~cond 0)) (= |ULTIMATE.start_aws_hash_iter_done_harness_~#map~0.offset| ULTIMATE.start_aws_hash_table_is_valid_~map.offset) (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_aws_hash_table_is_valid_~map.base) 0)) (= |ULTIMATE.start_aws_hash_iter_done_harness_~#map~0.offset| 0) (= |ULTIMATE.start_aws_hash_iter_done_harness_~#map~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base) (not (= .cse0 0)) (not (= ULTIMATE.start_hash_table_state_is_valid_~map.base 0)) (< (+ .cse0 1) |ULTIMATE.start_aws_hash_iter_done_harness_~#map~0.base|) (<= (+ (select (select |#memory_int| .cse0) 40) 1) 0) (= |ULTIMATE.start_aws_hash_iter_done_harness_~#map~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 1) 0) (< 0 |#StackHeapBarrier|))) [2021-11-01 10:19:34,163 INFO L854 garLoopResultBuilder]: At program point L10044-1(lines 9999 10046) the Hoare annotation is: false [2021-11-01 10:19:34,163 INFO L854 garLoopResultBuilder]: At program point L10044-2(lines 9999 10046) the Hoare annotation is: false [2021-11-01 10:19:34,163 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-01 10:19:34,163 INFO L854 garLoopResultBuilder]: At program point L10044-3(lines 9999 10046) the Hoare annotation is: false [2021-11-01 10:19:34,163 INFO L854 garLoopResultBuilder]: At program point L10044-4(lines 9999 10046) the Hoare annotation is: false [2021-11-01 10:19:34,163 INFO L854 garLoopResultBuilder]: At program point L10044-5(lines 9999 10046) the Hoare annotation is: false [2021-11-01 10:19:34,163 INFO L858 garLoopResultBuilder]: For program point L10079-2(line 10079) no Hoare annotation was computed. [2021-11-01 10:19:34,163 INFO L858 garLoopResultBuilder]: For program point L10079-3(line 10079) no Hoare annotation was computed. [2021-11-01 10:19:34,163 INFO L854 garLoopResultBuilder]: At program point L10112(lines 10101 10113) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_aws_hash_iter_done_harness_~#map~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base)) (.cse1 (= |ULTIMATE.start_aws_hash_iter_done_harness_~#map~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset)) (.cse2 (< 0 |#StackHeapBarrier|))) (or (and (<= (+ |ULTIMATE.start_hash_table_state_required_bytes_#res| 1) 0) .cse0 (not (= |ULTIMATE.start_aws_hash_iter_done_harness_~#map~0.base| 0)) .cse1 .cse2) (and (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_iter_done_harness_~#map~0.base|) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 1) 0) (= |ULTIMATE.start_aws_hash_iter_done_harness_~#map~0.offset| 0) .cse0 .cse1 (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 1) 0) .cse2))) [2021-11-01 10:19:34,163 INFO L858 garLoopResultBuilder]: For program point L10079(line 10079) no Hoare annotation was computed. [2021-11-01 10:19:34,163 INFO L854 garLoopResultBuilder]: At program point L10112-1(lines 10101 10113) the Hoare annotation is: (and (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (or (not (= ULTIMATE.start_hash_table_state_is_valid_~map.offset 0)) (not (= ULTIMATE.start_hash_table_state_is_valid_~map.base 0))) (<= (+ |ULTIMATE.start_hash_table_state_required_bytes_#res| 1) 0) (= |ULTIMATE.start_aws_hash_iter_done_harness_~#map~0.base| ULTIMATE.start_aws_hash_table_is_valid_~map.base) (< 1 |ULTIMATE.start_aws_hash_iter_done_harness_~#iter~2.base|) (= |ULTIMATE.start_aws_hash_iter_done_harness_~#map~0.offset| ULTIMATE.start_aws_hash_table_is_valid_~map.offset) (< 1 ULTIMATE.start_aws_hash_iter_is_valid_~iter.base) (= |ULTIMATE.start_aws_hash_iter_done_harness_~#map~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base) (not (= |ULTIMATE.start_aws_hash_iter_done_harness_~#map~0.base| 0)) (= |ULTIMATE.start_aws_hash_iter_done_harness_~#map~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (< 0 |#StackHeapBarrier|)) [2021-11-01 10:19:34,163 INFO L858 garLoopResultBuilder]: For program point L10079-1(line 10079) no Hoare annotation was computed. [2021-11-01 10:19:34,163 INFO L858 garLoopResultBuilder]: For program point L6809(lines 6809 6819) no Hoare annotation was computed. [2021-11-01 10:19:34,163 INFO L858 garLoopResultBuilder]: For program point L9848(line 9848) no Hoare annotation was computed. [2021-11-01 10:19:34,163 INFO L858 garLoopResultBuilder]: For program point L9848-2(line 9848) no Hoare annotation was computed. [2021-11-01 10:19:34,163 INFO L858 garLoopResultBuilder]: For program point L10114(lines 10114 10139) no Hoare annotation was computed. [2021-11-01 10:19:34,164 INFO L858 garLoopResultBuilder]: For program point L7274(lines 7274 7278) no Hoare annotation was computed. [2021-11-01 10:19:34,164 INFO L858 garLoopResultBuilder]: For program point L10082(lines 10082 10083) no Hoare annotation was computed. [2021-11-01 10:19:34,164 INFO L858 garLoopResultBuilder]: For program point L10082-6(lines 10082 10083) no Hoare annotation was computed. [2021-11-01 10:19:34,164 INFO L858 garLoopResultBuilder]: For program point L10082-8(lines 10082 10083) no Hoare annotation was computed. [2021-11-01 10:19:34,164 INFO L858 garLoopResultBuilder]: For program point L10082-2(lines 10082 10083) no Hoare annotation was computed. [2021-11-01 10:19:34,164 INFO L858 garLoopResultBuilder]: For program point L10082-4(lines 10082 10083) no Hoare annotation was computed. [2021-11-01 10:19:34,164 INFO L854 garLoopResultBuilder]: At program point L2617-1(lines 2613 2621) the Hoare annotation is: false [2021-11-01 10:19:34,164 INFO L854 garLoopResultBuilder]: At program point L2617(lines 2613 2621) the Hoare annotation is: (and (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_iter_done_harness_~#map~0.base|) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 1) 0) (= |ULTIMATE.start_aws_hash_iter_done_harness_~#map~0.offset| 0) (= |ULTIMATE.start_aws_hash_iter_done_harness_~#map~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base) (= |ULTIMATE.start_aws_hash_iter_done_harness_~#map~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 1) 0) (< 0 |#StackHeapBarrier|)) [2021-11-01 10:19:34,164 INFO L858 garLoopResultBuilder]: For program point L10082-14(lines 10082 10083) no Hoare annotation was computed. [2021-11-01 10:19:34,164 INFO L858 garLoopResultBuilder]: For program point L10082-10(lines 10082 10083) no Hoare annotation was computed. [2021-11-01 10:19:34,164 INFO L858 garLoopResultBuilder]: For program point L10082-12(lines 10082 10083) no Hoare annotation was computed. [2021-11-01 10:19:34,164 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-01 10:19:34,164 INFO L858 garLoopResultBuilder]: For program point L10085(line 10085) no Hoare annotation was computed. [2021-11-01 10:19:34,164 INFO L858 garLoopResultBuilder]: For program point L10085-1(line 10085) no Hoare annotation was computed. [2021-11-01 10:19:34,164 INFO L858 garLoopResultBuilder]: For program point L10085-2(line 10085) no Hoare annotation was computed. [2021-11-01 10:19:34,164 INFO L858 garLoopResultBuilder]: For program point L10085-3(line 10085) no Hoare annotation was computed. [2021-11-01 10:19:34,164 INFO L854 garLoopResultBuilder]: At program point L6947(lines 6943 6948) the Hoare annotation is: (and (= |ULTIMATE.start_bounded_malloc_#res.offset| 0) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (< (+ |ULTIMATE.start_bounded_malloc_#res.base| 1) |ULTIMATE.start_aws_hash_iter_done_harness_~#map~0.base|) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_iter_done_harness_~#map~0.base|) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 1) 0) (or (= ULTIMATE.start_assume_abort_if_not_~cond 1) (= ULTIMATE.start_assume_abort_if_not_~cond 0)) (= |ULTIMATE.start_aws_hash_iter_done_harness_~#map~0.offset| 0) (= |ULTIMATE.start_aws_hash_iter_done_harness_~#map~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base) (= |ULTIMATE.start_aws_hash_iter_done_harness_~#map~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 1) 0) (< 0 |#StackHeapBarrier|)) [2021-11-01 10:19:34,164 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-01 10:19:34,164 INFO L854 garLoopResultBuilder]: At program point L9855(lines 9833 9856) the Hoare annotation is: false [2021-11-01 10:19:34,164 INFO L858 garLoopResultBuilder]: For program point L210(lines 210 212) no Hoare annotation was computed. [2021-11-01 10:19:34,165 INFO L858 garLoopResultBuilder]: For program point L210-1(lines 210 212) no Hoare annotation was computed. [2021-11-01 10:19:34,165 INFO L858 garLoopResultBuilder]: For program point L210-2(lines 210 212) no Hoare annotation was computed. [2021-11-01 10:19:34,165 INFO L858 garLoopResultBuilder]: For program point L210-3(lines 210 212) no Hoare annotation was computed. [2021-11-01 10:19:34,165 INFO L858 garLoopResultBuilder]: For program point L210-4(lines 210 212) no Hoare annotation was computed. [2021-11-01 10:19:34,165 INFO L858 garLoopResultBuilder]: For program point L210-5(lines 210 212) no Hoare annotation was computed. [2021-11-01 10:19:34,165 INFO L858 garLoopResultBuilder]: For program point L210-6(lines 210 212) no Hoare annotation was computed. [2021-11-01 10:19:34,165 INFO L858 garLoopResultBuilder]: For program point L210-7(lines 210 212) no Hoare annotation was computed. [2021-11-01 10:19:34,165 INFO L858 garLoopResultBuilder]: For program point L210-8(lines 210 212) no Hoare annotation was computed. [2021-11-01 10:19:34,165 INFO L858 garLoopResultBuilder]: For program point L10087-2(line 10087) no Hoare annotation was computed. [2021-11-01 10:19:34,165 INFO L858 garLoopResultBuilder]: For program point L10054-1(lines 10054 10058) no Hoare annotation was computed. [2021-11-01 10:19:34,165 INFO L858 garLoopResultBuilder]: For program point L210-9(lines 210 212) no Hoare annotation was computed. [2021-11-01 10:19:34,165 INFO L858 garLoopResultBuilder]: For program point L210-10(lines 210 212) no Hoare annotation was computed. [2021-11-01 10:19:34,165 INFO L858 garLoopResultBuilder]: For program point L10054-2(lines 10054 10058) no Hoare annotation was computed. [2021-11-01 10:19:34,165 INFO L858 garLoopResultBuilder]: For program point L10087-4(line 10087) no Hoare annotation was computed. [2021-11-01 10:19:34,165 INFO L858 garLoopResultBuilder]: For program point L10054-3(lines 10054 10058) no Hoare annotation was computed. [2021-11-01 10:19:34,165 INFO L858 garLoopResultBuilder]: For program point L10087(line 10087) no Hoare annotation was computed. [2021-11-01 10:19:34,165 INFO L858 garLoopResultBuilder]: For program point L10054(lines 10054 10058) no Hoare annotation was computed. [2021-11-01 10:19:34,165 INFO L858 garLoopResultBuilder]: For program point L10087-10(line 10087) no Hoare annotation was computed. [2021-11-01 10:19:34,165 INFO L858 garLoopResultBuilder]: For program point L10087-12(line 10087) no Hoare annotation was computed. [2021-11-01 10:19:34,165 INFO L858 garLoopResultBuilder]: For program point L10087-6(line 10087) no Hoare annotation was computed. [2021-11-01 10:19:34,165 INFO L858 garLoopResultBuilder]: For program point L10087-8(line 10087) no Hoare annotation was computed. [2021-11-01 10:19:34,165 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-01 10:19:34,166 INFO L858 garLoopResultBuilder]: For program point L10087-14(line 10087) no Hoare annotation was computed. [2021-11-01 10:19:34,166 INFO L858 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2021-11-01 10:19:34,166 INFO L858 garLoopResultBuilder]: For program point L211-2(line 211) no Hoare annotation was computed. [2021-11-01 10:19:34,166 INFO L858 garLoopResultBuilder]: For program point L211-4(line 211) no Hoare annotation was computed. [2021-11-01 10:19:34,166 INFO L858 garLoopResultBuilder]: For program point L211-6(line 211) no Hoare annotation was computed. [2021-11-01 10:19:34,166 INFO L858 garLoopResultBuilder]: For program point L211-8(line 211) no Hoare annotation was computed. [2021-11-01 10:19:34,166 INFO L858 garLoopResultBuilder]: For program point L211-10(line 211) no Hoare annotation was computed. [2021-11-01 10:19:34,166 INFO L858 garLoopResultBuilder]: For program point L211-12(line 211) no Hoare annotation was computed. [2021-11-01 10:19:34,166 INFO L858 garLoopResultBuilder]: For program point L211-14(line 211) no Hoare annotation was computed. [2021-11-01 10:19:34,166 INFO L858 garLoopResultBuilder]: For program point L211-16(line 211) no Hoare annotation was computed. [2021-11-01 10:19:34,166 INFO L858 garLoopResultBuilder]: For program point L211-18(line 211) no Hoare annotation was computed. [2021-11-01 10:19:34,166 INFO L854 garLoopResultBuilder]: At program point L2590(lines 2586 2594) the Hoare annotation is: (and (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_iter_done_harness_~#map~0.base|) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 1) 0) (= |ULTIMATE.start_aws_hash_iter_done_harness_~#map~0.offset| 0) (= |ULTIMATE.start_aws_hash_iter_done_harness_~#map~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base) (= |ULTIMATE.start_aws_hash_iter_done_harness_~#map~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 1) 0) (< 0 |#StackHeapBarrier|)) [2021-11-01 10:19:34,166 INFO L858 garLoopResultBuilder]: For program point L211-20(line 211) no Hoare annotation was computed. [2021-11-01 10:19:34,166 INFO L854 garLoopResultBuilder]: At program point L2590-1(lines 2586 2594) the Hoare annotation is: false [2021-11-01 10:19:34,166 INFO L858 garLoopResultBuilder]: For program point L9990-2(line 9990) no Hoare annotation was computed. [2021-11-01 10:19:34,166 INFO L858 garLoopResultBuilder]: For program point L9990-3(line 9990) no Hoare annotation was computed. [2021-11-01 10:19:34,166 INFO L858 garLoopResultBuilder]: For program point L9990(line 9990) no Hoare annotation was computed. [2021-11-01 10:19:34,166 INFO L858 garLoopResultBuilder]: For program point L9990-9(line 9990) no Hoare annotation was computed. [2021-11-01 10:19:34,166 INFO L858 garLoopResultBuilder]: For program point L9990-10(line 9990) no Hoare annotation was computed. [2021-11-01 10:19:34,166 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-01 10:19:34,166 INFO L858 garLoopResultBuilder]: For program point L9990-12(line 9990) no Hoare annotation was computed. [2021-11-01 10:19:34,167 INFO L858 garLoopResultBuilder]: For program point L9990-5(line 9990) no Hoare annotation was computed. [2021-11-01 10:19:34,167 INFO L854 garLoopResultBuilder]: At program point L9990-6(lines 9988 9991) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_hash_iter_done_harness_~#map~0.base|) |ULTIMATE.start_aws_hash_iter_done_harness_~#map~0.offset|))) (and (= |ULTIMATE.start_bounded_malloc_#res.offset| 0) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (= |ULTIMATE.start_aws_hash_table_is_valid_#res| 0) (= ULTIMATE.start_hash_table_state_is_valid_~map.offset 0) (< (+ |ULTIMATE.start_bounded_malloc_#res.base| 1) |ULTIMATE.start_aws_hash_iter_done_harness_~#map~0.base|) (= |ULTIMATE.start_hash_table_state_is_valid_#res| 0) (= |ULTIMATE.start_aws_hash_iter_done_harness_~#map~0.base| ULTIMATE.start_aws_hash_table_is_valid_~map.base) (<= (+ (select (select |#memory_int| ULTIMATE.start_hash_table_state_is_valid_~map.base) 40) 1) 0) (= ULTIMATE.start_hash_table_state_is_valid_~size_at_least_two~0 0) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_iter_done_harness_~#map~0.base|) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 1) 0) (or (= ULTIMATE.start_assume_abort_if_not_~cond 1) (= ULTIMATE.start_assume_abort_if_not_~cond 0)) (= |ULTIMATE.start_aws_hash_iter_done_harness_~#map~0.offset| ULTIMATE.start_aws_hash_table_is_valid_~map.offset) (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_aws_hash_table_is_valid_~map.base) 0)) (= |ULTIMATE.start_aws_hash_iter_done_harness_~#map~0.offset| 0) (= |ULTIMATE.start_aws_hash_iter_done_harness_~#map~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base) (not (= .cse0 0)) (not (= ULTIMATE.start_hash_table_state_is_valid_~map.base 0)) (< (+ .cse0 1) |ULTIMATE.start_aws_hash_iter_done_harness_~#map~0.base|) (<= (+ (select (select |#memory_int| .cse0) 40) 1) 0) (= |ULTIMATE.start_aws_hash_iter_done_harness_~#map~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 1) 0) (< 0 |#StackHeapBarrier|))) [2021-11-01 10:19:34,167 INFO L858 garLoopResultBuilder]: For program point L9990-7(line 9990) no Hoare annotation was computed. [2021-11-01 10:19:34,167 INFO L858 garLoopResultBuilder]: For program point L9990-17(line 9990) no Hoare annotation was computed. [2021-11-01 10:19:34,167 INFO L858 garLoopResultBuilder]: For program point L9990-19(line 9990) no Hoare annotation was computed. [2021-11-01 10:19:34,167 INFO L854 garLoopResultBuilder]: At program point L9990-20(lines 9988 9991) the Hoare annotation is: (and (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (or (not (= ULTIMATE.start_hash_table_state_is_valid_~map.offset 0)) (not (= ULTIMATE.start_hash_table_state_is_valid_~map.base 0))) (= |ULTIMATE.start_aws_hash_table_is_valid_#res| 0) (< 1 |ULTIMATE.start_aws_hash_iter_done_harness_~#iter~2.base|) (< 1 ULTIMATE.start_aws_hash_iter_is_valid_~iter.base) (= |ULTIMATE.start_aws_hash_iter_done_harness_~#map~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base) (not (= |ULTIMATE.start_aws_hash_iter_done_harness_~#map~0.base| 0)) (= |ULTIMATE.start_aws_hash_iter_done_harness_~#map~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (< 0 |#StackHeapBarrier|)) [2021-11-01 10:19:34,167 INFO L854 garLoopResultBuilder]: At program point L9990-13(lines 9988 9991) the Hoare annotation is: (and (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (or (not (= ULTIMATE.start_hash_table_state_is_valid_~map.offset 0)) (not (= ULTIMATE.start_hash_table_state_is_valid_~map.base 0))) (= |ULTIMATE.start_aws_hash_iter_done_harness_~#iter~2.base| ULTIMATE.start_aws_hash_iter_is_valid_~iter.base) (= |ULTIMATE.start_aws_hash_table_is_valid_#res| 0) (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_hash_iter_is_valid_~iter.base) ULTIMATE.start_aws_hash_iter_is_valid_~iter.offset) |ULTIMATE.start_aws_hash_iter_done_harness_~#map~0.base|) (= |ULTIMATE.start_aws_hash_iter_done_harness_~#map~0.base| ULTIMATE.start_aws_hash_table_is_valid_~map.base) (= |ULTIMATE.start_aws_hash_iter_done_harness_~#map~0.offset| ULTIMATE.start_aws_hash_table_is_valid_~map.offset) (< 1 ULTIMATE.start_aws_hash_iter_is_valid_~iter.base) (= |ULTIMATE.start_aws_hash_iter_done_harness_~#map~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_hash_iter_done_harness_~#map~0.base|) |ULTIMATE.start_aws_hash_iter_done_harness_~#map~0.offset|) 0)) (not (= |ULTIMATE.start_aws_hash_iter_done_harness_~#map~0.base| 0)) (= ULTIMATE.start_aws_hash_iter_is_valid_~iter.offset |ULTIMATE.start_aws_hash_iter_done_harness_~#iter~2.offset|) (= |ULTIMATE.start_aws_hash_iter_done_harness_~#map~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (< 0 |#StackHeapBarrier|) (= |ULTIMATE.start_aws_hash_iter_done_harness_~#map~0.offset| (select (select |#memory_$Pointer$.offset| ULTIMATE.start_aws_hash_iter_is_valid_~iter.base) ULTIMATE.start_aws_hash_iter_is_valid_~iter.offset))) [2021-11-01 10:19:34,167 INFO L858 garLoopResultBuilder]: For program point L9990-14(line 9990) no Hoare annotation was computed. [2021-11-01 10:19:34,167 INFO L858 garLoopResultBuilder]: For program point L9990-16(line 9990) no Hoare annotation was computed. [2021-11-01 10:19:34,167 INFO L858 garLoopResultBuilder]: For program point L9990-26(line 9990) no Hoare annotation was computed. [2021-11-01 10:19:34,167 INFO L854 garLoopResultBuilder]: At program point L9990-27(lines 9988 9991) the Hoare annotation is: false [2021-11-01 10:19:34,167 INFO L854 garLoopResultBuilder]: At program point L10090(lines 10052 10093) the Hoare annotation is: (and (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (or (not (= ULTIMATE.start_hash_table_state_is_valid_~map.offset 0)) (not (= ULTIMATE.start_hash_table_state_is_valid_~map.base 0))) (= |ULTIMATE.start_aws_hash_iter_done_harness_~#iter~2.base| ULTIMATE.start_aws_hash_iter_is_valid_~iter.base) (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_hash_iter_is_valid_~iter.base) ULTIMATE.start_aws_hash_iter_is_valid_~iter.offset) |ULTIMATE.start_aws_hash_iter_done_harness_~#map~0.base|) (= |ULTIMATE.start_aws_hash_iter_done_harness_~#map~0.base| ULTIMATE.start_aws_hash_table_is_valid_~map.base) (= |ULTIMATE.start_aws_hash_iter_done_harness_~#map~0.offset| ULTIMATE.start_aws_hash_table_is_valid_~map.offset) (< 1 ULTIMATE.start_aws_hash_iter_is_valid_~iter.base) (= |ULTIMATE.start_aws_hash_iter_done_harness_~#map~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_hash_iter_done_harness_~#map~0.base|) |ULTIMATE.start_aws_hash_iter_done_harness_~#map~0.offset|) 0)) (not (= |ULTIMATE.start_aws_hash_iter_done_harness_~#map~0.base| 0)) (= ULTIMATE.start_aws_hash_iter_is_valid_~iter.offset |ULTIMATE.start_aws_hash_iter_done_harness_~#iter~2.offset|) (= |ULTIMATE.start_aws_hash_iter_is_valid_#res| 0) (= |ULTIMATE.start_aws_hash_iter_done_harness_~#map~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (< 0 |#StackHeapBarrier|) (= |ULTIMATE.start_aws_hash_iter_done_harness_~#map~0.offset| (select (select |#memory_$Pointer$.offset| ULTIMATE.start_aws_hash_iter_is_valid_~iter.base) ULTIMATE.start_aws_hash_iter_is_valid_~iter.offset))) [2021-11-01 10:19:34,167 INFO L858 garLoopResultBuilder]: For program point L9990-28(line 9990) no Hoare annotation was computed. [2021-11-01 10:19:34,167 INFO L858 garLoopResultBuilder]: For program point L9990-21(line 9990) no Hoare annotation was computed. [2021-11-01 10:19:34,167 INFO L858 garLoopResultBuilder]: For program point L9990-23(line 9990) no Hoare annotation was computed. [2021-11-01 10:19:34,167 INFO L858 garLoopResultBuilder]: For program point L9990-24(line 9990) no Hoare annotation was computed. [2021-11-01 10:19:34,167 INFO L858 garLoopResultBuilder]: For program point L9990-33(line 9990) no Hoare annotation was computed. [2021-11-01 10:19:34,167 INFO L854 garLoopResultBuilder]: At program point L9990-34(lines 9988 9991) the Hoare annotation is: false [2021-11-01 10:19:34,168 INFO L858 garLoopResultBuilder]: For program point L9990-35(line 9990) no Hoare annotation was computed. [2021-11-01 10:19:34,168 INFO L854 garLoopResultBuilder]: At program point L10090-1(lines 10052 10093) the Hoare annotation is: (and (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (or (not (= ULTIMATE.start_hash_table_state_is_valid_~map.offset 0)) (not (= ULTIMATE.start_hash_table_state_is_valid_~map.base 0))) (< 1 |ULTIMATE.start_aws_hash_iter_done_harness_~#iter~2.base|) (< 1 ULTIMATE.start_aws_hash_iter_is_valid_~iter.base) (= |ULTIMATE.start_aws_hash_iter_done_harness_~#map~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base) (not (= |ULTIMATE.start_aws_hash_iter_done_harness_~#map~0.base| 0)) (= |ULTIMATE.start_aws_hash_iter_is_valid_#res| 0) (= |ULTIMATE.start_aws_hash_iter_done_harness_~#map~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (< 0 |#StackHeapBarrier|)) [2021-11-01 10:19:34,168 INFO L854 garLoopResultBuilder]: At program point L10090-2(lines 10052 10093) the Hoare annotation is: false [2021-11-01 10:19:34,168 INFO L858 garLoopResultBuilder]: For program point L9990-30(line 9990) no Hoare annotation was computed. [2021-11-01 10:19:34,168 INFO L858 garLoopResultBuilder]: For program point L9990-31(line 9990) no Hoare annotation was computed. [2021-11-01 10:19:34,168 INFO L854 garLoopResultBuilder]: At program point L10090-3(lines 10052 10093) the Hoare annotation is: false [2021-11-01 10:19:34,168 INFO L854 garLoopResultBuilder]: At program point L9990-41(lines 9988 9991) the Hoare annotation is: false [2021-11-01 10:19:34,168 INFO L858 garLoopResultBuilder]: For program point L9990-37(line 9990) no Hoare annotation was computed. [2021-11-01 10:19:34,168 INFO L858 garLoopResultBuilder]: For program point L9990-38(line 9990) no Hoare annotation was computed. [2021-11-01 10:19:34,168 INFO L858 garLoopResultBuilder]: For program point L9990-40(line 9990) no Hoare annotation was computed. [2021-11-01 10:19:34,168 INFO L858 garLoopResultBuilder]: For program point L10124(line 10124) no Hoare annotation was computed. [2021-11-01 10:19:34,168 INFO L854 garLoopResultBuilder]: At program point L1998(lines 1988 1999) the Hoare annotation is: (and (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_iter_done_harness_~#map~0.base|) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 1) 0) (= |ULTIMATE.start_aws_hash_iter_done_harness_~#map~0.offset| 0) (= |ULTIMATE.start_aws_hash_iter_done_harness_~#map~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base) (= |ULTIMATE.start_aws_hash_iter_done_harness_~#map~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 1) 0) (< 0 |#StackHeapBarrier|)) [2021-11-01 10:19:34,168 INFO L858 garLoopResultBuilder]: For program point L10124-2(line 10124) no Hoare annotation was computed. [2021-11-01 10:19:34,168 INFO L854 garLoopResultBuilder]: At program point L1998-1(lines 1988 1999) the Hoare annotation is: (and (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_iter_done_harness_~#map~0.base|) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 1) 0) (= |ULTIMATE.start_aws_hash_iter_done_harness_~#map~0.offset| 0) (= |ULTIMATE.start_aws_hash_iter_done_harness_~#map~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base) (= |ULTIMATE.start_aws_hash_iter_done_harness_~#map~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 1) 0) (< 0 |#StackHeapBarrier|)) [2021-11-01 10:19:34,168 INFO L854 garLoopResultBuilder]: At program point L1998-2(lines 1988 1999) the Hoare annotation is: false [2021-11-01 10:19:34,168 INFO L854 garLoopResultBuilder]: At program point L1998-3(lines 1988 1999) the Hoare annotation is: false [2021-11-01 10:19:34,168 INFO L858 garLoopResultBuilder]: For program point L10059(lines 10059 10063) no Hoare annotation was computed. [2021-11-01 10:19:34,168 INFO L858 garLoopResultBuilder]: For program point L10059-1(lines 10059 10063) no Hoare annotation was computed. [2021-11-01 10:19:34,168 INFO L858 garLoopResultBuilder]: For program point L10059-2(lines 10059 10063) no Hoare annotation was computed. [2021-11-01 10:19:34,169 INFO L858 garLoopResultBuilder]: For program point L10059-3(lines 10059 10063) no Hoare annotation was computed. [2021-11-01 10:19:34,169 INFO L854 garLoopResultBuilder]: At program point L250(lines 248 251) the Hoare annotation is: (and (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_iter_done_harness_~#map~0.base|) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 1) 0) (= |ULTIMATE.start_aws_hash_iter_done_harness_~#map~0.offset| 0) (= |ULTIMATE.start_aws_hash_iter_done_harness_~#map~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base) (= |ULTIMATE.start_aws_hash_iter_done_harness_~#map~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 1) 0) (< 0 |#StackHeapBarrier|)) [2021-11-01 10:19:34,169 INFO L854 garLoopResultBuilder]: At program point L250-1(lines 248 251) the Hoare annotation is: false [2021-11-01 10:19:34,169 INFO L858 garLoopResultBuilder]: For program point L7385-3(lines 7385 7387) no Hoare annotation was computed. [2021-11-01 10:19:34,169 INFO L858 garLoopResultBuilder]: For program point L7385-2(lines 7385 7387) no Hoare annotation was computed. [2021-11-01 10:19:34,169 INFO L858 garLoopResultBuilder]: For program point L7385-1(lines 7385 7387) no Hoare annotation was computed. [2021-11-01 10:19:34,169 INFO L858 garLoopResultBuilder]: For program point L7385(lines 7385 7387) no Hoare annotation was computed. [2021-11-01 10:19:34,169 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-11-01 10:19:34,169 INFO L854 garLoopResultBuilder]: At program point L2630(lines 2626 2631) the Hoare annotation is: (and (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_iter_done_harness_~#map~0.base|) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 1) 0) (or (= ULTIMATE.start_assume_abort_if_not_~cond 1) (= ULTIMATE.start_assume_abort_if_not_~cond 0)) (= |ULTIMATE.start_aws_hash_iter_done_harness_~#map~0.offset| 0) (= |ULTIMATE.start_aws_hash_iter_done_harness_~#map~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base) (= |ULTIMATE.start_aws_hash_iter_done_harness_~#map~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 1) 0) (< 0 |#StackHeapBarrier|)) [2021-11-01 10:19:34,169 INFO L854 garLoopResultBuilder]: At program point L2630-2(lines 2626 2631) the Hoare annotation is: false [2021-11-01 10:19:34,169 INFO L854 garLoopResultBuilder]: At program point L2630-1(lines 2626 2631) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_hash_iter_done_harness_~#map~0.base|) |ULTIMATE.start_aws_hash_iter_done_harness_~#map~0.offset|))) (and |ULTIMATE.start_aws_hash_table_is_valid_#t~short1475| |ULTIMATE.start_aws_hash_table_is_valid_#t~short1478| (= |ULTIMATE.start_bounded_malloc_#res.offset| 0) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (= ULTIMATE.start_hash_table_state_is_valid_~map.offset 0) (< (+ |ULTIMATE.start_bounded_malloc_#res.base| 1) |ULTIMATE.start_aws_hash_iter_done_harness_~#map~0.base|) (= |ULTIMATE.start_aws_hash_iter_done_harness_~#map~0.base| ULTIMATE.start_aws_hash_table_is_valid_~map.base) (<= (+ (select (select |#memory_int| ULTIMATE.start_hash_table_state_is_valid_~map.base) 40) 1) 0) (= ULTIMATE.start_hash_table_state_is_valid_~size_at_least_two~0 0) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_iter_done_harness_~#map~0.base|) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 1) 0) (or (= ULTIMATE.start_assume_abort_if_not_~cond 1) (= ULTIMATE.start_assume_abort_if_not_~cond 0)) (= |ULTIMATE.start_aws_hash_iter_done_harness_~#map~0.offset| ULTIMATE.start_aws_hash_table_is_valid_~map.offset) (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_aws_hash_table_is_valid_~map.base) 0)) (= |ULTIMATE.start_aws_hash_iter_done_harness_~#map~0.offset| 0) (= |ULTIMATE.start_aws_hash_iter_done_harness_~#map~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base) (not (= .cse0 0)) (not (= ULTIMATE.start_hash_table_state_is_valid_~map.base 0)) (< (+ .cse0 1) |ULTIMATE.start_aws_hash_iter_done_harness_~#map~0.base|) (<= (+ (select (select |#memory_int| .cse0) 40) 1) 0) (= |ULTIMATE.start_aws_hash_iter_done_harness_~#map~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 1) 0) (< 0 |#StackHeapBarrier|))) [2021-11-01 10:19:34,169 INFO L858 garLoopResultBuilder]: For program point L2498(lines 2498 2499) no Hoare annotation was computed. [2021-11-01 10:19:34,169 INFO L854 garLoopResultBuilder]: At program point L2630-4(lines 2626 2631) the Hoare annotation is: false [2021-11-01 10:19:34,169 INFO L854 garLoopResultBuilder]: At program point L2630-3(lines 2626 2631) the Hoare annotation is: false [2021-11-01 10:19:34,169 INFO L854 garLoopResultBuilder]: At program point L2630-6(lines 2626 2631) the Hoare annotation is: false [2021-11-01 10:19:34,169 INFO L858 garLoopResultBuilder]: For program point L2498-1(lines 2498 2499) no Hoare annotation was computed. [2021-11-01 10:19:34,169 INFO L854 garLoopResultBuilder]: At program point L2630-5(lines 2626 2631) the Hoare annotation is: false [2021-11-01 10:19:34,169 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-01 10:19:34,170 INFO L858 garLoopResultBuilder]: For program point L10064-3(lines 10064 10068) no Hoare annotation was computed. [2021-11-01 10:19:34,170 INFO L858 garLoopResultBuilder]: For program point L10064(lines 10064 10068) no Hoare annotation was computed. [2021-11-01 10:19:34,170 INFO L858 garLoopResultBuilder]: For program point L10064-1(lines 10064 10068) no Hoare annotation was computed. [2021-11-01 10:19:34,170 INFO L858 garLoopResultBuilder]: For program point L10064-2(lines 10064 10068) no Hoare annotation was computed. [2021-11-01 10:19:34,170 INFO L854 garLoopResultBuilder]: At program point L2501-1(lines 2497 2502) the Hoare annotation is: false [2021-11-01 10:19:34,170 INFO L854 garLoopResultBuilder]: At program point L2501(lines 2497 2502) the Hoare annotation is: (and (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_iter_done_harness_~#map~0.base|) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 1) 0) (= |ULTIMATE.start_aws_hash_iter_done_harness_~#map~0.offset| 0) (= |ULTIMATE.start_aws_hash_iter_done_harness_~#map~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base) (= |ULTIMATE.start_aws_hash_iter_done_harness_~#map~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 1) 0) (< 0 |#StackHeapBarrier|)) [2021-11-01 10:19:34,170 INFO L854 garLoopResultBuilder]: At program point L255(lines 253 256) the Hoare annotation is: (and (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_iter_done_harness_~#map~0.base|) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 1) 0) (= |ULTIMATE.start_aws_hash_iter_done_harness_~#map~0.offset| 0) (= |ULTIMATE.start_aws_hash_iter_done_harness_~#map~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base) (= |ULTIMATE.start_aws_hash_iter_done_harness_~#map~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 1) 0) (< 0 |#StackHeapBarrier|)) [2021-11-01 10:19:34,170 INFO L854 garLoopResultBuilder]: At program point L255-1(lines 253 256) the Hoare annotation is: false [2021-11-01 10:19:34,181 INFO L858 garLoopResultBuilder]: For program point L222(lines 222 224) no Hoare annotation was computed. [2021-11-01 10:19:34,181 INFO L858 garLoopResultBuilder]: For program point L222-1(lines 222 224) no Hoare annotation was computed. [2021-11-01 10:19:34,181 INFO L858 garLoopResultBuilder]: For program point L222-2(lines 222 224) no Hoare annotation was computed. [2021-11-01 10:19:34,181 INFO L858 garLoopResultBuilder]: For program point L222-3(lines 222 224) no Hoare annotation was computed. [2021-11-01 10:19:34,181 INFO L858 garLoopResultBuilder]: For program point L222-4(lines 222 224) no Hoare annotation was computed. [2021-11-01 10:19:34,182 INFO L858 garLoopResultBuilder]: For program point L222-5(lines 222 224) no Hoare annotation was computed. [2021-11-01 10:19:34,182 INFO L858 garLoopResultBuilder]: For program point L222-6(lines 222 224) no Hoare annotation was computed. [2021-11-01 10:19:34,182 INFO L858 garLoopResultBuilder]: For program point L222-7(lines 222 224) no Hoare annotation was computed. [2021-11-01 10:19:34,182 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-11-01 10:19:34,182 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-01 10:19:34,182 INFO L858 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2021-11-01 10:19:34,182 INFO L858 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2021-11-01 10:19:34,182 INFO L858 garLoopResultBuilder]: For program point L223-3(line 223) no Hoare annotation was computed. [2021-11-01 10:19:34,190 INFO L858 garLoopResultBuilder]: For program point L223-4(line 223) no Hoare annotation was computed. [2021-11-01 10:19:34,190 INFO L858 garLoopResultBuilder]: For program point L223-6(line 223) no Hoare annotation was computed. [2021-11-01 10:19:34,190 INFO L858 garLoopResultBuilder]: For program point L223-7(line 223) no Hoare annotation was computed. [2021-11-01 10:19:34,190 INFO L858 garLoopResultBuilder]: For program point L223-9(line 223) no Hoare annotation was computed. [2021-11-01 10:19:34,190 INFO L858 garLoopResultBuilder]: For program point L223-10(line 223) no Hoare annotation was computed. [2021-11-01 10:19:34,190 INFO L858 garLoopResultBuilder]: For program point L223-12(line 223) no Hoare annotation was computed. [2021-11-01 10:19:34,190 INFO L858 garLoopResultBuilder]: For program point L223-13(line 223) no Hoare annotation was computed. [2021-11-01 10:19:34,190 INFO L858 garLoopResultBuilder]: For program point L10001-4(lines 10001 10005) no Hoare annotation was computed. [2021-11-01 10:19:34,191 INFO L858 garLoopResultBuilder]: For program point L9836(line 9836) no Hoare annotation was computed. [2021-11-01 10:19:34,191 INFO L858 garLoopResultBuilder]: For program point L223-15(line 223) no Hoare annotation was computed. [2021-11-01 10:19:34,191 INFO L858 garLoopResultBuilder]: For program point L10001-5(lines 10001 10005) no Hoare annotation was computed. [2021-11-01 10:19:34,191 INFO L858 garLoopResultBuilder]: For program point L223-16(line 223) no Hoare annotation was computed. [2021-11-01 10:19:34,191 INFO L858 garLoopResultBuilder]: For program point L9836-2(line 9836) no Hoare annotation was computed. [2021-11-01 10:19:34,191 INFO L858 garLoopResultBuilder]: For program point L10001(lines 10001 10005) no Hoare annotation was computed. [2021-11-01 10:19:34,191 INFO L858 garLoopResultBuilder]: For program point L223-18(line 223) no Hoare annotation was computed. [2021-11-01 10:19:34,191 INFO L858 garLoopResultBuilder]: For program point L10001-1(lines 10001 10005) no Hoare annotation was computed. [2021-11-01 10:19:34,191 INFO L858 garLoopResultBuilder]: For program point L223-19(line 223) no Hoare annotation was computed. [2021-11-01 10:19:34,191 INFO L858 garLoopResultBuilder]: For program point L10001-2(lines 10001 10005) no Hoare annotation was computed. [2021-11-01 10:19:34,192 INFO L858 garLoopResultBuilder]: For program point L10001-3(lines 10001 10005) no Hoare annotation was computed. [2021-11-01 10:19:34,192 INFO L858 garLoopResultBuilder]: For program point L223-21(line 223) no Hoare annotation was computed. [2021-11-01 10:19:34,192 INFO L858 garLoopResultBuilder]: For program point L223-22(line 223) no Hoare annotation was computed. [2021-11-01 10:19:34,192 INFO L858 garLoopResultBuilder]: For program point L7195(lines 7195 7201) no Hoare annotation was computed. [2021-11-01 10:19:34,192 INFO L858 garLoopResultBuilder]: For program point L10069(lines 10069 10073) no Hoare annotation was computed. [2021-11-01 10:19:34,192 INFO L858 garLoopResultBuilder]: For program point L10069-1(lines 10069 10073) no Hoare annotation was computed. [2021-11-01 10:19:34,192 INFO L858 garLoopResultBuilder]: For program point L10069-2(lines 10069 10073) no Hoare annotation was computed. [2021-11-01 10:19:34,192 INFO L858 garLoopResultBuilder]: For program point L10069-3(lines 10069 10073) no Hoare annotation was computed. [2021-11-01 10:19:34,192 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-11-01 10:19:34,193 INFO L858 garLoopResultBuilder]: For program point L7196(lines 7196 7200) no Hoare annotation was computed. [2021-11-01 10:19:34,193 INFO L858 garLoopResultBuilder]: For program point L10104(lines 10104 10106) no Hoare annotation was computed. [2021-11-01 10:19:34,193 INFO L858 garLoopResultBuilder]: For program point L10104-1(lines 10104 10106) no Hoare annotation was computed. [2021-11-01 10:19:34,193 INFO L858 garLoopResultBuilder]: For program point L2542(lines 2542 2543) no Hoare annotation was computed. [2021-11-01 10:19:34,193 INFO L858 garLoopResultBuilder]: For program point L2542-1(lines 2542 2543) no Hoare annotation was computed. [2021-11-01 10:19:34,193 INFO L854 garLoopResultBuilder]: At program point L263(line 263) the Hoare annotation is: false [2021-11-01 10:19:34,193 INFO L861 garLoopResultBuilder]: At program point L10140(line 10140) the Hoare annotation is: true [2021-11-01 10:19:34,193 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-11-01 10:19:34,193 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-01 10:19:34,194 INFO L858 garLoopResultBuilder]: For program point L7267(lines 7267 7272) no Hoare annotation was computed. [2021-11-01 10:19:34,194 INFO L858 garLoopResultBuilder]: For program point L10108(lines 10108 10110) no Hoare annotation was computed. [2021-11-01 10:19:34,194 INFO L858 garLoopResultBuilder]: For program point L10075(lines 10075 10088) no Hoare annotation was computed. [2021-11-01 10:19:34,194 INFO L858 garLoopResultBuilder]: For program point L10108-1(lines 10108 10110) no Hoare annotation was computed. [2021-11-01 10:19:34,194 INFO L858 garLoopResultBuilder]: For program point L10075-1(lines 10075 10088) no Hoare annotation was computed. [2021-11-01 10:19:34,194 INFO L858 garLoopResultBuilder]: For program point L10075-2(lines 10075 10088) no Hoare annotation was computed. [2021-11-01 10:19:34,194 INFO L858 garLoopResultBuilder]: For program point L10075-3(lines 10075 10088) no Hoare annotation was computed. [2021-11-01 10:19:34,194 INFO L858 garLoopResultBuilder]: For program point L10076(line 10076) no Hoare annotation was computed. [2021-11-01 10:19:34,194 INFO L858 garLoopResultBuilder]: For program point L10076-1(line 10076) no Hoare annotation was computed. [2021-11-01 10:19:34,194 INFO L858 garLoopResultBuilder]: For program point L10076-2(line 10076) no Hoare annotation was computed. [2021-11-01 10:19:34,195 INFO L858 garLoopResultBuilder]: For program point L10076-3(line 10076) no Hoare annotation was computed. [2021-11-01 10:19:34,195 INFO L854 garLoopResultBuilder]: At program point L2545-1(lines 2541 2546) the Hoare annotation is: false [2021-11-01 10:19:34,199 INFO L854 garLoopResultBuilder]: At program point L2545(lines 2541 2546) the Hoare annotation is: (and (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_iter_done_harness_~#map~0.base|) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 1) 0) (= |ULTIMATE.start_aws_hash_iter_done_harness_~#map~0.offset| 0) (= |ULTIMATE.start_aws_hash_iter_done_harness_~#map~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base) (= |ULTIMATE.start_aws_hash_iter_done_harness_~#map~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 1) 0) (< 0 |#StackHeapBarrier|)) [2021-11-01 10:19:34,200 INFO L854 garLoopResultBuilder]: At program point L266(line 266) the Hoare annotation is: (and (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_iter_done_harness_~#map~0.base|) (= |ULTIMATE.start_aws_hash_iter_done_harness_~#map~0.offset| 0) (= |ULTIMATE.start_aws_hash_iter_done_harness_~#map~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base) (= |ULTIMATE.start_aws_hash_iter_done_harness_~#map~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (<= (+ ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 1) 0) (< 0 |#StackHeapBarrier|)) [2021-11-01 10:19:34,202 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-01 10:19:34,203 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-01 10:19:34,217 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:19:34,218 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:19:34,219 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-01 10:19:34,219 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:19:34,219 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:19:34,220 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-01 10:19:34,221 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:19:34,221 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:19:34,221 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-01 10:19:34,222 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:19:34,222 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:19:34,222 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-01 10:19:34,223 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-01 10:19:34,223 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:19:34,224 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:19:34,224 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:19:34,225 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-01 10:19:34,225 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:19:34,225 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:19:34,225 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:19:34,226 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-01 10:19:34,226 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:19:34,227 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:19:34,227 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:19:34,227 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-01 10:19:34,228 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:19:34,228 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:19:34,228 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:19:34,230 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-01 10:19:34,230 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:19:34,230 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:19:34,231 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:19:34,231 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-01 10:19:34,231 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:19:34,231 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:19:34,232 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:19:34,234 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.11 10:19:34 BoogieIcfgContainer [2021-11-01 10:19:34,235 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-01 10:19:34,235 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-01 10:19:34,235 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-01 10:19:34,235 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-01 10:19:34,236 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.11 10:17:36" (3/4) ... [2021-11-01 10:19:34,238 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-11-01 10:19:34,261 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 197 nodes and edges [2021-11-01 10:19:34,263 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 74 nodes and edges [2021-11-01 10:19:34,264 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2021-11-01 10:19:34,266 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2021-11-01 10:19:34,267 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2021-11-01 10:19:34,268 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-11-01 10:19:34,270 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-11-01 10:19:34,271 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-01 10:19:34,289 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((\result + 1 <= 0 && map == map) && !(map == 0)) && map == map) && 0 < unknown-#StackHeapBarrier-unknown) || ((((((unknown-#StackHeapBarrier-unknown < map && num_entries + 1 <= 0) && map == 0) && map == map) && map == map) && max_table_entries + 1 <= 0) && 0 < unknown-#StackHeapBarrier-unknown) [2021-11-01 10:19:34,290 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((\result == 0 && !(\result == 0)) && \result + 1 < map) && unknown-#StackHeapBarrier-unknown < map) && num_entries + 1 <= 0) && (cond == 1 || cond == 0)) && map == 0) && map == map) && map == map) && max_table_entries + 1 <= 0) && 0 < unknown-#StackHeapBarrier-unknown [2021-11-01 10:19:34,290 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((aux-map && map->p_impl-aux && aux-map && map->p_impl && hash_table_state_is_valid(map->p_impl)-aux) && \result == 0) && !(\result == 0)) && map == 0) && \result + 1 < map) && \result == 0) && map == map) && unknown-#memory_int-unknown[map][40] + 1 <= 0) && size_at_least_two == 0) && unknown-#StackHeapBarrier-unknown < map) && num_entries + 1 <= 0) && (cond == 1 || cond == 0)) && map == map) && 0 == #memory_$Pointer$[map][0]) && map == 0) && map == map) && !(#memory_$Pointer$[map][map] == 0)) && !(map == 0)) && #memory_$Pointer$[map][map] + 1 < map) && unknown-#memory_int-unknown[#memory_$Pointer$[map][map]][40] + 1 <= 0) && map == map) && max_table_entries + 1 <= 0) && 0 < unknown-#StackHeapBarrier-unknown [2021-11-01 10:19:34,291 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((\result == 0 && !(\result == 0)) && \result == 0) && map == 0) && \result + 1 < map) && \result == 0) && map == map) && unknown-#memory_int-unknown[map][40] + 1 <= 0) && size_at_least_two == 0) && unknown-#StackHeapBarrier-unknown < map) && num_entries + 1 <= 0) && (cond == 1 || cond == 0)) && map == map) && 0 == #memory_$Pointer$[map][0]) && map == 0) && map == map) && !(#memory_$Pointer$[map][map] == 0)) && !(map == 0)) && #memory_$Pointer$[map][map] + 1 < map) && unknown-#memory_int-unknown[#memory_$Pointer$[map][map]][40] + 1 <= 0) && map == map) && max_table_entries + 1 <= 0) && 0 < unknown-#StackHeapBarrier-unknown [2021-11-01 10:19:34,291 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((aux-map && map->p_impl-aux && aux-map && map->p_impl && hash_table_state_is_valid(map->p_impl)-aux) && \result == 0) && !(\result == 0)) && map == 0) && \result + 1 < map) && map == map) && unknown-#memory_int-unknown[map][40] + 1 <= 0) && size_at_least_two == 0) && unknown-#StackHeapBarrier-unknown < map) && num_entries + 1 <= 0) && (cond == 1 || cond == 0)) && map == map) && 0 == #memory_$Pointer$[map][0]) && map == 0) && map == map) && !(#memory_$Pointer$[map][map] == 0)) && !(map == 0)) && #memory_$Pointer$[map][map] + 1 < map) && unknown-#memory_int-unknown[#memory_$Pointer$[map][map]][40] + 1 <= 0) && map == map) && max_table_entries + 1 <= 0) && 0 < unknown-#StackHeapBarrier-unknown [2021-11-01 10:19:34,291 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((!(\result == 0) && (!(map == 0) || !(map == 0))) && iter == iter) && #memory_$Pointer$[iter][iter] == map) && map == map) && map == map) && 1 < iter) && map == map) && !(#memory_$Pointer$[map][map] == 0)) && !(map == 0)) && iter == iter) && \result == 0) && map == map) && 0 < unknown-#StackHeapBarrier-unknown) && map == #memory_$Pointer$[iter][iter] [2021-11-01 10:19:34,292 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((!(\result == 0) && (!(map == 0) || !(map == 0))) && iter == iter) && \result == 0) && #memory_$Pointer$[iter][iter] == map) && map == map) && map == map) && 1 < iter) && map == map) && !(#memory_$Pointer$[map][map] == 0)) && !(map == 0)) && iter == iter) && map == map) && 0 < unknown-#StackHeapBarrier-unknown) && map == #memory_$Pointer$[iter][iter] [2021-11-01 10:19:34,293 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((!(\result == 0) && (!(map == 0) || !(map == 0))) && \result + 1 <= 0) && map == map) && 1 < iter) && map == map) && 1 < iter) && map == map) && !(map == 0)) && map == map) && 0 < unknown-#StackHeapBarrier-unknown [2021-11-01 10:19:34,293 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((!(\result == 0) && (!(map == 0) || !(map == 0))) && 1 < iter) && 1 < iter) && map == map) && !(map == 0)) && \result == 0) && map == map) && 0 < unknown-#StackHeapBarrier-unknown [2021-11-01 10:19:34,294 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((!(\result == 0) && (!(map == 0) || !(map == 0))) && \result == 0) && 1 < iter) && 1 < iter) && map == map) && !(map == 0)) && map == map) && 0 < unknown-#StackHeapBarrier-unknown [2021-11-01 10:19:34,845 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-11-01 10:19:34,845 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-01 10:19:34,846 INFO L158 Benchmark]: Toolchain (without parser) took 124736.57ms. Allocated memory was 100.7MB in the beginning and 501.2MB in the end (delta: 400.6MB). Free memory was 62.4MB in the beginning and 195.9MB in the end (delta: -133.5MB). Peak memory consumption was 352.9MB. Max. memory is 16.1GB. [2021-11-01 10:19:34,846 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 100.7MB. Free memory was 58.3MB in the beginning and 58.3MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-01 10:19:34,846 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2393.68ms. Allocated memory was 100.7MB in the beginning and 199.2MB in the end (delta: 98.6MB). Free memory was 62.2MB in the beginning and 132.4MB in the end (delta: -70.2MB). Peak memory consumption was 76.6MB. Max. memory is 16.1GB. [2021-11-01 10:19:34,847 INFO L158 Benchmark]: Boogie Procedure Inliner took 147.19ms. Allocated memory is still 199.2MB. Free memory was 132.4MB in the beginning and 116.7MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-11-01 10:19:34,847 INFO L158 Benchmark]: Boogie Preprocessor took 115.75ms. Allocated memory is still 199.2MB. Free memory was 116.7MB in the beginning and 106.2MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-11-01 10:19:34,847 INFO L158 Benchmark]: RCFGBuilder took 4192.52ms. Allocated memory was 199.2MB in the beginning and 404.8MB in the end (delta: 205.5MB). Free memory was 106.2MB in the beginning and 211.2MB in the end (delta: -105.0MB). Peak memory consumption was 219.0MB. Max. memory is 16.1GB. [2021-11-01 10:19:34,847 INFO L158 Benchmark]: TraceAbstraction took 117270.17ms. Allocated memory was 404.8MB in the beginning and 501.2MB in the end (delta: 96.5MB). Free memory was 211.2MB in the beginning and 387.4MB in the end (delta: -176.2MB). Peak memory consumption was 170.9MB. Max. memory is 16.1GB. [2021-11-01 10:19:34,847 INFO L158 Benchmark]: Witness Printer took 610.38ms. Allocated memory is still 501.2MB. Free memory was 387.4MB in the beginning and 195.9MB in the end (delta: 191.6MB). Peak memory consumption was 276.5MB. Max. memory is 16.1GB. [2021-11-01 10:19:34,849 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 100.7MB. Free memory was 58.3MB in the beginning and 58.3MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2393.68ms. Allocated memory was 100.7MB in the beginning and 199.2MB in the end (delta: 98.6MB). Free memory was 62.2MB in the beginning and 132.4MB in the end (delta: -70.2MB). Peak memory consumption was 76.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 147.19ms. Allocated memory is still 199.2MB. Free memory was 132.4MB in the beginning and 116.7MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 115.75ms. Allocated memory is still 199.2MB. Free memory was 116.7MB in the beginning and 106.2MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * RCFGBuilder took 4192.52ms. Allocated memory was 199.2MB in the beginning and 404.8MB in the end (delta: 205.5MB). Free memory was 106.2MB in the beginning and 211.2MB in the end (delta: -105.0MB). Peak memory consumption was 219.0MB. Max. memory is 16.1GB. * TraceAbstraction took 117270.17ms. Allocated memory was 404.8MB in the beginning and 501.2MB in the end (delta: 96.5MB). Free memory was 211.2MB in the beginning and 387.4MB in the end (delta: -176.2MB). Peak memory consumption was 170.9MB. Max. memory is 16.1GB. * Witness Printer took 610.38ms. Allocated memory is still 501.2MB. Free memory was 387.4MB in the beginning and 195.9MB in the end (delta: 191.6MB). Peak memory consumption was 276.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.00ms ErrorAutomatonConstructionTimeTotal, 0.00ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.00ms ErrorAutomatonConstructionTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeAvg, 0.00ms 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 - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - 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 1 procedures, 206 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 117181.41ms, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 26.97ms, AutomataDifference: 96896.75ms, DeadEndRemovalTime: 0.00ms, HoareAnnotationTime: 4470.25ms, InitialAbstractionConstructionTime: 10.05ms, PartialOrderReductionTime: 0.00ms, HoareTripleCheckerStatistics: 15 mSolverCounterUnknown, 6618 SdHoareTripleChecker+Valid, 88280.99ms IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6618 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 80106.12ms Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9239 mSDsCounter, 276 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15474 IncrementalHoareTripleChecker+Invalid, 15765 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 276 mSolverCounterUnsat, 0 mSDtfsCounter, 15474 mSolverCounterSat, 221.41ms SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 561 GetRequests, 429 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 9559.27ms Time, 0.00ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=372occurred in iteration=10, InterpolantAutomatonStates: 124, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.00ms DumpTime, AutomataMinimizationStatistics: 235.02ms AutomataMinimizationTime, 15 MinimizatonAttempts, 1665 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.00ms HoareAnnotationTime, 46 LocationsWithAnnotation, 46 PreInvPairs, 74 NumberOfFragments, 963 HoareAnnotationTreeSize, 46 FomulaSimplifications, 4900 FormulaSimplificationTreeSizeReduction, 117.99ms HoareSimplificationTime, 46 FomulaSimplificationsInter, 1092 FormulaSimplificationTreeSizeReductionInter, 4328.23ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 738.66ms SsaConstructionTime, 5205.36ms SatisfiabilityAnalysisTime, 7036.40ms InterpolantComputationTime, 1107 NumberOfCodeBlocks, 1107 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1092 ConstructedInterpolants, 0 QuantifiedInterpolants, 2562 SizeOfPredicates, 63 NumberOfNonLiveVariables, 16314 ConjunctsInSsa, 118 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 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 8 specifications checked. All of them hold - InvariantResult [Line: 9999]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9988]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2613]: Loop Invariant Derived loop invariant: (((((unknown-#StackHeapBarrier-unknown < map && num_entries + 1 <= 0) && map == 0) && map == map) && map == map) && max_table_entries + 1 <= 0) && 0 < unknown-#StackHeapBarrier-unknown - InvariantResult [Line: 9833]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2497]: Loop Invariant Derived loop invariant: (((((unknown-#StackHeapBarrier-unknown < map && num_entries + 1 <= 0) && map == 0) && map == map) && map == map) && max_table_entries + 1 <= 0) && 0 < unknown-#StackHeapBarrier-unknown - InvariantResult [Line: 253]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 10052]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 10140]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2586]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2626]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 266]: Loop Invariant Derived loop invariant: ((((unknown-#StackHeapBarrier-unknown < map && map == 0) && map == map) && map == map) && max_table_entries + 1 <= 0) && 0 < unknown-#StackHeapBarrier-unknown - InvariantResult [Line: 1988]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1988]: Loop Invariant Derived loop invariant: (((((unknown-#StackHeapBarrier-unknown < map && num_entries + 1 <= 0) && map == 0) && map == map) && map == map) && max_table_entries + 1 <= 0) && 0 < unknown-#StackHeapBarrier-unknown - InvariantResult [Line: 10052]: Loop Invariant [2021-11-01 10:19:34,862 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:19:34,862 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:19:34,863 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-01 10:19:34,863 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:19:34,863 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:19:34,863 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((((((!(\result == 0) && (!(map == 0) || !(map == 0))) && iter == iter) && #memory_$Pointer$[iter][iter] == map) && map == map) && map == map) && 1 < iter) && map == map) && !(#memory_$Pointer$[map][map] == 0)) && !(map == 0)) && iter == iter) && \result == 0) && map == map) && 0 < unknown-#StackHeapBarrier-unknown) && map == #memory_$Pointer$[iter][iter] - InvariantResult [Line: 9988]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1988]: Loop Invariant Derived loop invariant: (((((unknown-#StackHeapBarrier-unknown < map && num_entries + 1 <= 0) && map == 0) && map == map) && map == map) && max_table_entries + 1 <= 0) && 0 < unknown-#StackHeapBarrier-unknown - InvariantResult [Line: 9988]: Loop Invariant [2021-11-01 10:19:34,864 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:19:34,865 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:19:34,865 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-01 10:19:34,865 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:19:34,865 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:19:34,865 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((((((!(\result == 0) && (!(map == 0) || !(map == 0))) && iter == iter) && \result == 0) && #memory_$Pointer$[iter][iter] == map) && map == map) && map == map) && 1 < iter) && map == map) && !(#memory_$Pointer$[map][map] == 0)) && !(map == 0)) && iter == iter) && map == map) && 0 < unknown-#StackHeapBarrier-unknown) && map == #memory_$Pointer$[iter][iter] - InvariantResult [Line: 10052]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2626]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2626]: Loop Invariant [2021-11-01 10:19:34,866 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-01 10:19:34,866 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:19:34,866 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:19:34,866 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:19:34,867 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-01 10:19:34,867 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:19:34,867 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:19:34,867 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((((((((((((((((aux-map && map->p_impl-aux && aux-map && map->p_impl && hash_table_state_is_valid(map->p_impl)-aux) && \result == 0) && !(\result == 0)) && map == 0) && \result + 1 < map) && map == map) && unknown-#memory_int-unknown[map][40] + 1 <= 0) && size_at_least_two == 0) && unknown-#StackHeapBarrier-unknown < map) && num_entries + 1 <= 0) && (cond == 1 || cond == 0)) && map == map) && 0 == #memory_$Pointer$[map][0]) && map == 0) && map == map) && !(#memory_$Pointer$[map][map] == 0)) && !(map == 0)) && #memory_$Pointer$[map][map] + 1 < map) && unknown-#memory_int-unknown[#memory_$Pointer$[map][map]][40] + 1 <= 0) && map == map) && max_table_entries + 1 <= 0) && 0 < unknown-#StackHeapBarrier-unknown - InvariantResult [Line: 1988]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 253]: Loop Invariant Derived loop invariant: (((((unknown-#StackHeapBarrier-unknown < map && num_entries + 1 <= 0) && map == 0) && map == map) && map == map) && max_table_entries + 1 <= 0) && 0 < unknown-#StackHeapBarrier-unknown - InvariantResult [Line: 9999]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9999]: Loop Invariant [2021-11-01 10:19:34,868 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-01 10:19:34,869 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:19:34,869 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:19:34,869 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:19:34,869 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-01 10:19:34,869 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:19:34,870 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:19:34,870 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((((((((((((((((aux-map && map->p_impl-aux && aux-map && map->p_impl && hash_table_state_is_valid(map->p_impl)-aux) && \result == 0) && !(\result == 0)) && map == 0) && \result + 1 < map) && \result == 0) && map == map) && unknown-#memory_int-unknown[map][40] + 1 <= 0) && size_at_least_two == 0) && unknown-#StackHeapBarrier-unknown < map) && num_entries + 1 <= 0) && (cond == 1 || cond == 0)) && map == map) && 0 == #memory_$Pointer$[map][0]) && map == 0) && map == map) && !(#memory_$Pointer$[map][map] == 0)) && !(map == 0)) && #memory_$Pointer$[map][map] + 1 < map) && unknown-#memory_int-unknown[#memory_$Pointer$[map][map]][40] + 1 <= 0) && map == map) && max_table_entries + 1 <= 0) && 0 < unknown-#StackHeapBarrier-unknown - InvariantResult [Line: 9999]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2586]: Loop Invariant Derived loop invariant: (((((unknown-#StackHeapBarrier-unknown < map && num_entries + 1 <= 0) && map == 0) && map == map) && map == map) && max_table_entries + 1 <= 0) && 0 < unknown-#StackHeapBarrier-unknown - InvariantResult [Line: 248]: Loop Invariant Derived loop invariant: (((((unknown-#StackHeapBarrier-unknown < map && num_entries + 1 <= 0) && map == 0) && map == map) && map == map) && max_table_entries + 1 <= 0) && 0 < unknown-#StackHeapBarrier-unknown - InvariantResult [Line: 6943]: Loop Invariant Derived loop invariant: (((((((((\result == 0 && !(\result == 0)) && \result + 1 < map) && unknown-#StackHeapBarrier-unknown < map) && num_entries + 1 <= 0) && (cond == 1 || cond == 0)) && map == 0) && map == map) && map == map) && max_table_entries + 1 <= 0) && 0 < unknown-#StackHeapBarrier-unknown - InvariantResult [Line: 2613]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9999]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2626]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 10052]: Loop Invariant Derived loop invariant: (((((((!(\result == 0) && (!(map == 0) || !(map == 0))) && 1 < iter) && 1 < iter) && map == map) && !(map == 0)) && \result == 0) && map == map) && 0 < unknown-#StackHeapBarrier-unknown - InvariantResult [Line: 263]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 248]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9988]: Loop Invariant [2021-11-01 10:19:34,872 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-01 10:19:34,872 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:19:34,872 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:19:34,872 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:19:34,873 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-01 10:19:34,873 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:19:34,873 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-01 10:19:34,873 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((((((((((((((((\result == 0 && !(\result == 0)) && \result == 0) && map == 0) && \result + 1 < map) && \result == 0) && map == map) && unknown-#memory_int-unknown[map][40] + 1 <= 0) && size_at_least_two == 0) && unknown-#StackHeapBarrier-unknown < map) && num_entries + 1 <= 0) && (cond == 1 || cond == 0)) && map == map) && 0 == #memory_$Pointer$[map][0]) && map == 0) && map == map) && !(#memory_$Pointer$[map][map] == 0)) && !(map == 0)) && #memory_$Pointer$[map][map] + 1 < map) && unknown-#memory_int-unknown[#memory_$Pointer$[map][map]][40] + 1 <= 0) && map == map) && max_table_entries + 1 <= 0) && 0 < unknown-#StackHeapBarrier-unknown - InvariantResult [Line: 2626]: Loop Invariant Derived loop invariant: ((((((unknown-#StackHeapBarrier-unknown < map && num_entries + 1 <= 0) && (cond == 1 || cond == 0)) && map == 0) && map == map) && map == map) && max_table_entries + 1 <= 0) && 0 < unknown-#StackHeapBarrier-unknown - InvariantResult [Line: 10101]: Loop Invariant Derived loop invariant: (((((((((!(\result == 0) && (!(map == 0) || !(map == 0))) && \result + 1 <= 0) && map == map) && 1 < iter) && map == map) && 1 < iter) && map == map) && !(map == 0)) && map == map) && 0 < unknown-#StackHeapBarrier-unknown - InvariantResult [Line: 2626]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2541]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 10101]: Loop Invariant Derived loop invariant: ((((\result + 1 <= 0 && map == map) && !(map == 0)) && map == map) && 0 < unknown-#StackHeapBarrier-unknown) || ((((((unknown-#StackHeapBarrier-unknown < map && num_entries + 1 <= 0) && map == 0) && map == map) && map == map) && max_table_entries + 1 <= 0) && 0 < unknown-#StackHeapBarrier-unknown) - InvariantResult [Line: 2626]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2497]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9999]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9988]: Loop Invariant Derived loop invariant: (((((((!(\result == 0) && (!(map == 0) || !(map == 0))) && \result == 0) && 1 < iter) && 1 < iter) && map == map) && !(map == 0)) && map == map) && 0 < unknown-#StackHeapBarrier-unknown - InvariantResult [Line: 2541]: Loop Invariant Derived loop invariant: (((((unknown-#StackHeapBarrier-unknown < map && num_entries + 1 <= 0) && map == 0) && map == map) && map == map) && max_table_entries + 1 <= 0) && 0 < unknown-#StackHeapBarrier-unknown - InvariantResult [Line: 9988]: Loop Invariant Derived loop invariant: 0 RESULT: Ultimate proved your program to be correct! [2021-11-01 10:19:35,103 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2021-11-01 10:19:35,142 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 137 Received shutdown request...