./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_hash_table_create_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c3fed411 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_hash_table_create_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 a871e941a14cf19147765419aa3746af2f9add859ed1f61f31f704f97208fdb0 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-18 00:40:08,861 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-18 00:40:08,884 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-18 00:40:08,933 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-18 00:40:08,933 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-18 00:40:08,937 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-18 00:40:08,938 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-18 00:40:08,941 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-18 00:40:08,943 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-18 00:40:08,948 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-18 00:40:08,948 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-18 00:40:08,949 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-18 00:40:08,950 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-18 00:40:08,952 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-18 00:40:08,953 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-18 00:40:08,955 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-18 00:40:08,956 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-18 00:40:08,956 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-18 00:40:08,958 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-18 00:40:08,959 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-18 00:40:08,960 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-18 00:40:08,961 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-18 00:40:08,962 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-18 00:40:08,963 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-18 00:40:08,965 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-18 00:40:08,965 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-18 00:40:08,966 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-18 00:40:08,966 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-18 00:40:08,967 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-18 00:40:08,968 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-18 00:40:08,968 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-18 00:40:08,968 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-18 00:40:08,969 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-18 00:40:08,970 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-18 00:40:08,971 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-18 00:40:08,972 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-18 00:40:08,973 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-18 00:40:08,973 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-18 00:40:08,973 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-18 00:40:08,974 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-18 00:40:08,975 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-18 00:40:08,977 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-12-18 00:40:09,009 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-18 00:40:09,010 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-18 00:40:09,010 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-18 00:40:09,010 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-18 00:40:09,011 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-18 00:40:09,011 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-18 00:40:09,012 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-18 00:40:09,012 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-18 00:40:09,012 INFO L138 SettingsManager]: * Use SBE=true [2021-12-18 00:40:09,013 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-18 00:40:09,013 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-18 00:40:09,014 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-18 00:40:09,014 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-18 00:40:09,014 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-18 00:40:09,014 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-18 00:40:09,014 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-18 00:40:09,015 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-18 00:40:09,015 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-18 00:40:09,015 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-18 00:40:09,015 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-18 00:40:09,015 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-18 00:40:09,015 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-18 00:40:09,016 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-18 00:40:09,016 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-18 00:40:09,016 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-18 00:40:09,016 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-18 00:40:09,016 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-18 00:40:09,018 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-18 00:40:09,018 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-18 00:40:09,018 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-18 00:40:09,018 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-18 00:40:09,018 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 -> a871e941a14cf19147765419aa3746af2f9add859ed1f61f31f704f97208fdb0 [2021-12-18 00:40:09,251 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-18 00:40:09,274 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-18 00:40:09,276 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-18 00:40:09,277 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-18 00:40:09,278 INFO L275 PluginConnector]: CDTParser initialized [2021-12-18 00:40:09,279 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_hash_table_create_harness.i [2021-12-18 00:40:09,343 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd81f2ef9/6856aec219814697b2d7577bbeff9fc9/FLAG1b1621501 [2021-12-18 00:40:10,045 INFO L306 CDTParser]: Found 1 translation units. [2021-12-18 00:40:10,046 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_create_harness.i [2021-12-18 00:40:10,082 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd81f2ef9/6856aec219814697b2d7577bbeff9fc9/FLAG1b1621501 [2021-12-18 00:40:10,158 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd81f2ef9/6856aec219814697b2d7577bbeff9fc9 [2021-12-18 00:40:10,161 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-18 00:40:10,163 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-18 00:40:10,164 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-18 00:40:10,164 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-18 00:40:10,166 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-18 00:40:10,167 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:40:10" (1/1) ... [2021-12-18 00:40:10,168 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c80d52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:40:10, skipping insertion in model container [2021-12-18 00:40:10,169 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:40:10" (1/1) ... [2021-12-18 00:40:10,174 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-18 00:40:10,275 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-18 00:40:10,514 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_create_harness.i[4495,4508] [2021-12-18 00:40:10,522 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_create_harness.i[4555,4568] [2021-12-18 00:40:11,264 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:40:11,264 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:40:11,265 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:40:11,265 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:40:11,266 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:40:11,275 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:40:11,275 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:40:11,277 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:40:11,277 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:40:11,279 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:40:11,279 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:40:11,280 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:40:11,280 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:40:11,537 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-12-18 00:40:11,538 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-12-18 00:40:11,539 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-12-18 00:40:11,540 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-12-18 00:40:11,541 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-12-18 00:40:11,541 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-12-18 00:40:11,542 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-12-18 00:40:11,542 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-12-18 00:40:11,543 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-12-18 00:40:11,543 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-12-18 00:40:11,712 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-12-18 00:40:11,935 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:40:11,936 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:40:11,948 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:40:11,949 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:40:11,953 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:40:11,953 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:40:11,961 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:40:11,963 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:40:11,965 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:40:11,965 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:40:11,965 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:40:11,966 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:40:11,966 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:40:11,995 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-18 00:40:12,035 INFO L203 MainTranslator]: Completed pre-run [2021-12-18 00:40:12,046 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_create_harness.i[4495,4508] [2021-12-18 00:40:12,046 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_create_harness.i[4555,4568] [2021-12-18 00:40:12,106 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:40:12,107 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:40:12,107 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:40:12,108 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:40:12,109 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:40:12,116 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:40:12,116 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:40:12,117 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:40:12,117 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:40:12,118 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:40:12,119 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:40:12,119 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:40:12,119 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:40:12,153 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-12-18 00:40:12,153 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-12-18 00:40:12,154 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-12-18 00:40:12,155 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-12-18 00:40:12,156 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-12-18 00:40:12,156 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-12-18 00:40:12,157 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-12-18 00:40:12,157 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-12-18 00:40:12,158 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-12-18 00:40:12,158 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-12-18 00:40:12,182 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-12-18 00:40:12,268 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:40:12,269 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:40:12,275 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:40:12,275 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:40:12,277 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:40:12,278 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:40:12,318 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:40:12,320 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:40:12,322 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:40:12,322 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:40:12,322 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:40:12,323 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:40:12,323 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:40:12,338 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-18 00:40:12,538 INFO L208 MainTranslator]: Completed translation [2021-12-18 00:40:12,538 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:40:12 WrapperNode [2021-12-18 00:40:12,538 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-18 00:40:12,539 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-18 00:40:12,539 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-18 00:40:12,540 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-18 00:40:12,545 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:40:12" (1/1) ... [2021-12-18 00:40:12,655 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:40:12" (1/1) ... [2021-12-18 00:40:12,743 INFO L137 Inliner]: procedures = 775, calls = 2489, calls flagged for inlining = 67, calls inlined = 21, statements flattened = 1294 [2021-12-18 00:40:12,744 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-18 00:40:12,745 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-18 00:40:12,745 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-18 00:40:12,746 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-18 00:40:12,753 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:40:12" (1/1) ... [2021-12-18 00:40:12,754 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:40:12" (1/1) ... [2021-12-18 00:40:12,773 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:40:12" (1/1) ... [2021-12-18 00:40:12,774 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:40:12" (1/1) ... [2021-12-18 00:40:12,828 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:40:12" (1/1) ... [2021-12-18 00:40:12,847 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:40:12" (1/1) ... [2021-12-18 00:40:12,862 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:40:12" (1/1) ... [2021-12-18 00:40:12,878 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-18 00:40:12,881 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-18 00:40:12,881 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-18 00:40:12,881 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-18 00:40:12,882 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:40:12" (1/1) ... [2021-12-18 00:40:12,888 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-18 00:40:12,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 00:40:12,908 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-12-18 00:40:12,944 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-12-18 00:40:12,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2021-12-18 00:40:12,965 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2021-12-18 00:40:12,966 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2021-12-18 00:40:12,966 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-18 00:40:12,966 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2021-12-18 00:40:12,966 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2021-12-18 00:40:12,967 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-12-18 00:40:12,967 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-12-18 00:40:12,967 INFO L130 BoogieDeclarations]: Found specification of procedure aws_hash_table_create [2021-12-18 00:40:12,967 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_hash_table_create [2021-12-18 00:40:12,967 INFO L130 BoogieDeclarations]: Found specification of procedure hash_table_state_is_valid [2021-12-18 00:40:12,968 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_table_state_is_valid [2021-12-18 00:40:12,968 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-18 00:40:12,968 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-18 00:40:12,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-18 00:40:12,968 INFO L130 BoogieDeclarations]: Found specification of procedure s_emplace_item [2021-12-18 00:40:12,969 INFO L138 BoogieDeclarations]: Found implementation of procedure s_emplace_item [2021-12-18 00:40:12,969 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-18 00:40:12,969 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-18 00:40:12,969 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2021-12-18 00:40:12,969 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2021-12-18 00:40:12,969 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mul_size_checked [2021-12-18 00:40:12,969 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mul_size_checked [2021-12-18 00:40:12,969 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mem_release [2021-12-18 00:40:12,970 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mem_release [2021-12-18 00:40:12,970 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-18 00:40:12,970 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_plus [2021-12-18 00:40:12,970 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_plus [2021-12-18 00:40:12,970 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-18 00:40:12,970 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2021-12-18 00:40:12,971 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2021-12-18 00:40:12,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-18 00:40:12,971 INFO L130 BoogieDeclarations]: Found specification of procedure s_hash_for [2021-12-18 00:40:12,971 INFO L138 BoogieDeclarations]: Found implementation of procedure s_hash_for [2021-12-18 00:40:12,971 INFO L130 BoogieDeclarations]: Found specification of procedure aws_is_power_of_two [2021-12-18 00:40:12,971 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_is_power_of_two [2021-12-18 00:40:12,972 INFO L130 BoogieDeclarations]: Found specification of procedure s_update_template_size [2021-12-18 00:40:12,972 INFO L138 BoogieDeclarations]: Found implementation of procedure s_update_template_size [2021-12-18 00:40:12,972 INFO L130 BoogieDeclarations]: Found specification of procedure s_hash_keys_eq [2021-12-18 00:40:12,972 INFO L138 BoogieDeclarations]: Found implementation of procedure s_hash_keys_eq [2021-12-18 00:40:12,972 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_uninterpreted_equals [2021-12-18 00:40:12,973 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_uninterpreted_equals [2021-12-18 00:40:12,973 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-18 00:40:12,975 INFO L130 BoogieDeclarations]: Found specification of procedure aws_allocator_is_valid [2021-12-18 00:40:12,976 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_allocator_is_valid [2021-12-18 00:40:12,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2021-12-18 00:40:12,976 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_calloc [2021-12-18 00:40:12,976 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_calloc [2021-12-18 00:40:12,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2021-12-18 00:40:12,977 INFO L130 BoogieDeclarations]: Found specification of procedure hash_table_state_required_bytes [2021-12-18 00:40:12,977 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_table_state_required_bytes [2021-12-18 00:40:12,977 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_uninterpreted_hasher [2021-12-18 00:40:12,982 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_uninterpreted_hasher [2021-12-18 00:40:12,982 INFO L130 BoogieDeclarations]: Found specification of procedure s_safe_eq_check [2021-12-18 00:40:12,982 INFO L138 BoogieDeclarations]: Found implementation of procedure s_safe_eq_check [2021-12-18 00:40:12,983 INFO L130 BoogieDeclarations]: Found specification of procedure s_find_entry [2021-12-18 00:40:12,983 INFO L138 BoogieDeclarations]: Found implementation of procedure s_find_entry [2021-12-18 00:40:12,983 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-12-18 00:40:12,983 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-12-18 00:40:12,983 INFO L130 BoogieDeclarations]: Found specification of procedure aws_hash_table_is_valid [2021-12-18 00:40:12,983 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_hash_table_is_valid [2021-12-18 00:40:12,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-18 00:40:12,983 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2021-12-18 00:40:12,984 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2021-12-18 00:40:12,984 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_mult [2021-12-18 00:40:12,984 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_mult [2021-12-18 00:40:12,984 INFO L130 BoogieDeclarations]: Found specification of procedure aws_add_size_checked [2021-12-18 00:40:12,984 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_add_size_checked [2021-12-18 00:40:12,984 INFO L130 BoogieDeclarations]: Found specification of procedure s_alloc_state [2021-12-18 00:40:12,984 INFO L138 BoogieDeclarations]: Found implementation of procedure s_alloc_state [2021-12-18 00:40:12,984 INFO L130 BoogieDeclarations]: Found specification of procedure uninterpreted_equals [2021-12-18 00:40:12,985 INFO L138 BoogieDeclarations]: Found implementation of procedure uninterpreted_equals [2021-12-18 00:40:12,985 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2021-12-18 00:40:12,985 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2021-12-18 00:40:12,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-18 00:40:13,404 INFO L236 CfgBuilder]: Building ICFG [2021-12-18 00:40:13,415 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-18 00:40:13,648 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##5: assume !true; [2021-12-18 00:40:13,676 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume !true; [2021-12-18 00:40:14,216 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##7: assume !true; [2021-12-18 00:40:14,216 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##29: assume !true; [2021-12-18 00:40:14,553 INFO L277 CfgBuilder]: Performing block encoding [2021-12-18 00:40:14,570 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-18 00:40:14,570 INFO L301 CfgBuilder]: Removed 11 assume(true) statements. [2021-12-18 00:40:14,573 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:40:14 BoogieIcfgContainer [2021-12-18 00:40:14,574 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-18 00:40:14,575 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-18 00:40:14,575 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-18 00:40:14,578 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-18 00:40:14,578 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 12:40:10" (1/3) ... [2021-12-18 00:40:14,578 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3afa2a79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:40:14, skipping insertion in model container [2021-12-18 00:40:14,579 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:40:12" (2/3) ... [2021-12-18 00:40:14,579 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3afa2a79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:40:14, skipping insertion in model container [2021-12-18 00:40:14,579 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:40:14" (3/3) ... [2021-12-18 00:40:14,580 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_hash_table_create_harness.i [2021-12-18 00:40:14,585 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-18 00:40:14,585 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-18 00:40:14,635 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-18 00:40:14,654 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-12-18 00:40:14,655 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-18 00:40:14,679 INFO L276 IsEmpty]: Start isEmpty. Operand has 349 states, 235 states have (on average 1.2723404255319148) internal successors, (299), 232 states have internal predecessors, (299), 86 states have call successors, (86), 30 states have call predecessors, (86), 30 states have return successors, (86), 86 states have call predecessors, (86), 86 states have call successors, (86) [2021-12-18 00:40:14,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2021-12-18 00:40:14,691 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:40:14,692 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 00:40:14,693 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:40:14,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:40:14,697 INFO L85 PathProgramCache]: Analyzing trace with hash -322226588, now seen corresponding path program 1 times [2021-12-18 00:40:14,704 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:40:14,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21551152] [2021-12-18 00:40:14,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:40:14,705 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:40:15,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:15,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:40:15,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:15,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-18 00:40:15,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:15,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 00:40:15,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:15,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-18 00:40:15,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:15,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-18 00:40:15,289 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:40:15,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21551152] [2021-12-18 00:40:15,290 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2021-12-18 00:40:15,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [550386531] [2021-12-18 00:40:15,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:40:15,291 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 00:40:15,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 00:40:15,295 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-12-18 00:40:15,330 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-12-18 00:40:15,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:15,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 2485 conjuncts, 1 conjunts are in the unsatisfiable core [2021-12-18 00:40:15,853 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 00:40:16,042 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2021-12-18 00:40:16,042 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 00:40:16,043 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [550386531] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 00:40:16,043 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 00:40:16,043 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-18 00:40:16,045 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436905928] [2021-12-18 00:40:16,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 00:40:16,051 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-18 00:40:16,051 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:40:16,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-18 00:40:16,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 00:40:16,081 INFO L87 Difference]: Start difference. First operand has 349 states, 235 states have (on average 1.2723404255319148) internal successors, (299), 232 states have internal predecessors, (299), 86 states have call successors, (86), 30 states have call predecessors, (86), 30 states have return successors, (86), 86 states have call predecessors, (86), 86 states have call successors, (86) Second operand has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2021-12-18 00:40:16,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:40:16,168 INFO L93 Difference]: Finished difference Result 692 states and 983 transitions. [2021-12-18 00:40:16,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-18 00:40:16,171 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 124 [2021-12-18 00:40:16,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:40:16,189 INFO L225 Difference]: With dead ends: 692 [2021-12-18 00:40:16,189 INFO L226 Difference]: Without dead ends: 341 [2021-12-18 00:40:16,199 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 00:40:16,209 INFO L933 BasicCegarLoop]: 460 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 00:40:16,211 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 00:40:16,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2021-12-18 00:40:16,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 341. [2021-12-18 00:40:16,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 224 states have (on average 1.2544642857142858) internal successors, (281), 226 states have internal predecessors, (281), 86 states have call successors, (86), 30 states have call predecessors, (86), 30 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2021-12-18 00:40:16,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 451 transitions. [2021-12-18 00:40:16,289 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 451 transitions. Word has length 124 [2021-12-18 00:40:16,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:40:16,290 INFO L470 AbstractCegarLoop]: Abstraction has 341 states and 451 transitions. [2021-12-18 00:40:16,290 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2021-12-18 00:40:16,291 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 451 transitions. [2021-12-18 00:40:16,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2021-12-18 00:40:16,293 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:40:16,293 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 00:40:16,320 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-18 00:40:16,515 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2021-12-18 00:40:16,516 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:40:16,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:40:16,516 INFO L85 PathProgramCache]: Analyzing trace with hash -672164438, now seen corresponding path program 1 times [2021-12-18 00:40:16,516 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:40:16,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147606866] [2021-12-18 00:40:16,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:40:16,517 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:40:16,599 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-18 00:40:16,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [895231676] [2021-12-18 00:40:16,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:40:16,601 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 00:40:16,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 00:40:16,602 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-12-18 00:40:16,603 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-12-18 00:40:17,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:17,144 INFO L263 TraceCheckSpWp]: Trace formula consists of 2485 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-18 00:40:17,149 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 00:40:17,383 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2021-12-18 00:40:17,383 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 00:40:17,383 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:40:17,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147606866] [2021-12-18 00:40:17,384 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-18 00:40:17,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [895231676] [2021-12-18 00:40:17,384 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [895231676] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 00:40:17,384 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 00:40:17,384 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-18 00:40:17,385 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768297545] [2021-12-18 00:40:17,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 00:40:17,386 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-18 00:40:17,386 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:40:17,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-18 00:40:17,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-18 00:40:17,387 INFO L87 Difference]: Start difference. First operand 341 states and 451 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19) [2021-12-18 00:40:17,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:40:17,466 INFO L93 Difference]: Finished difference Result 678 states and 901 transitions. [2021-12-18 00:40:17,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-18 00:40:17,466 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19) Word has length 124 [2021-12-18 00:40:17,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:40:17,470 INFO L225 Difference]: With dead ends: 678 [2021-12-18 00:40:17,471 INFO L226 Difference]: Without dead ends: 346 [2021-12-18 00:40:17,472 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-18 00:40:17,474 INFO L933 BasicCegarLoop]: 448 mSDtfsCounter, 2 mSDsluCounter, 1340 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1788 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 00:40:17,474 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 1788 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 00:40:17,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2021-12-18 00:40:17,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 346. [2021-12-18 00:40:17,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 228 states have (on average 1.25) internal successors, (285), 230 states have internal predecessors, (285), 86 states have call successors, (86), 30 states have call predecessors, (86), 31 states have return successors, (88), 85 states have call predecessors, (88), 84 states have call successors, (88) [2021-12-18 00:40:17,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 459 transitions. [2021-12-18 00:40:17,498 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 459 transitions. Word has length 124 [2021-12-18 00:40:17,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:40:17,499 INFO L470 AbstractCegarLoop]: Abstraction has 346 states and 459 transitions. [2021-12-18 00:40:17,499 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19) [2021-12-18 00:40:17,499 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 459 transitions. [2021-12-18 00:40:17,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2021-12-18 00:40:17,512 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:40:17,512 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 00:40:17,546 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-12-18 00:40:17,735 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,SelfDestructingSolverStorable1 [2021-12-18 00:40:17,736 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:40:17,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:40:17,736 INFO L85 PathProgramCache]: Analyzing trace with hash 320130104, now seen corresponding path program 1 times [2021-12-18 00:40:17,736 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:40:17,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037399199] [2021-12-18 00:40:17,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:40:17,736 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:40:17,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:17,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:40:17,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:17,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-18 00:40:17,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:17,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 00:40:17,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:18,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-18 00:40:18,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:18,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-18 00:40:18,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:18,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:40:18,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:18,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:40:18,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:18,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 00:40:18,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:18,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-12-18 00:40:18,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:18,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-18 00:40:18,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:18,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:40:18,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:18,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-12-18 00:40:18,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:18,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-18 00:40:18,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:18,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-12-18 00:40:18,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:18,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-18 00:40:18,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:18,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-12-18 00:40:18,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:18,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-12-18 00:40:18,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:18,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2021-12-18 00:40:18,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:18,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2021-12-18 00:40:18,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:18,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2021-12-18 00:40:18,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:18,239 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2021-12-18 00:40:18,239 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:40:18,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037399199] [2021-12-18 00:40:18,239 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037399199] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 00:40:18,239 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 00:40:18,240 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-18 00:40:18,240 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741147313] [2021-12-18 00:40:18,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 00:40:18,241 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-18 00:40:18,241 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:40:18,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-18 00:40:18,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-18 00:40:18,242 INFO L87 Difference]: Start difference. First operand 346 states and 459 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 5 states have internal predecessors, (61), 3 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2021-12-18 00:40:19,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:40:19,941 INFO L93 Difference]: Finished difference Result 758 states and 1020 transitions. [2021-12-18 00:40:19,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-18 00:40:19,942 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 5 states have internal predecessors, (61), 3 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 130 [2021-12-18 00:40:19,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:40:19,948 INFO L225 Difference]: With dead ends: 758 [2021-12-18 00:40:19,948 INFO L226 Difference]: Without dead ends: 426 [2021-12-18 00:40:19,953 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2021-12-18 00:40:19,956 INFO L933 BasicCegarLoop]: 415 mSDtfsCounter, 276 mSDsluCounter, 1137 mSDsCounter, 0 mSdLazyCounter, 1140 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 1552 SdHoareTripleChecker+Invalid, 1271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 1140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2021-12-18 00:40:19,957 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [338 Valid, 1552 Invalid, 1271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 1140 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2021-12-18 00:40:19,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2021-12-18 00:40:19,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 346. [2021-12-18 00:40:19,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 228 states have (on average 1.2456140350877194) internal successors, (284), 230 states have internal predecessors, (284), 86 states have call successors, (86), 30 states have call predecessors, (86), 31 states have return successors, (88), 85 states have call predecessors, (88), 84 states have call successors, (88) [2021-12-18 00:40:19,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 458 transitions. [2021-12-18 00:40:19,988 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 458 transitions. Word has length 130 [2021-12-18 00:40:19,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:40:19,988 INFO L470 AbstractCegarLoop]: Abstraction has 346 states and 458 transitions. [2021-12-18 00:40:19,988 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 5 states have internal predecessors, (61), 3 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2021-12-18 00:40:19,989 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 458 transitions. [2021-12-18 00:40:19,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2021-12-18 00:40:19,990 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:40:19,990 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 00:40:19,990 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-18 00:40:19,990 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:40:19,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:40:19,991 INFO L85 PathProgramCache]: Analyzing trace with hash 2006309942, now seen corresponding path program 1 times [2021-12-18 00:40:19,991 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:40:19,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339941753] [2021-12-18 00:40:19,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:40:19,991 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:40:20,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:20,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:40:20,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:20,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-18 00:40:20,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:20,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 00:40:20,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:20,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-18 00:40:20,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:20,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-18 00:40:20,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:20,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:40:20,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:20,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:40:20,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:20,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 00:40:20,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:20,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-12-18 00:40:20,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:20,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-18 00:40:20,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:20,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:40:20,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:20,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-12-18 00:40:20,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:20,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-18 00:40:20,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:20,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-12-18 00:40:20,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:20,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-18 00:40:20,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:20,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-12-18 00:40:20,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:20,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-12-18 00:40:20,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:20,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2021-12-18 00:40:20,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:20,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2021-12-18 00:40:20,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:20,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2021-12-18 00:40:20,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:20,460 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2021-12-18 00:40:20,460 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:40:20,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339941753] [2021-12-18 00:40:20,460 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339941753] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 00:40:20,461 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 00:40:20,461 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-12-18 00:40:20,461 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094398111] [2021-12-18 00:40:20,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 00:40:20,462 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-18 00:40:20,462 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:40:20,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-18 00:40:20,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-12-18 00:40:20,463 INFO L87 Difference]: Start difference. First operand 346 states and 458 transitions. Second operand has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 9 states have internal predecessors, (61), 4 states have call successors, (23), 5 states have call predecessors, (23), 3 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) [2021-12-18 00:40:24,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:40:24,006 INFO L93 Difference]: Finished difference Result 754 states and 1012 transitions. [2021-12-18 00:40:24,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-18 00:40:24,007 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 9 states have internal predecessors, (61), 4 states have call successors, (23), 5 states have call predecessors, (23), 3 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) Word has length 130 [2021-12-18 00:40:24,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:40:24,010 INFO L225 Difference]: With dead ends: 754 [2021-12-18 00:40:24,010 INFO L226 Difference]: Without dead ends: 429 [2021-12-18 00:40:24,012 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2021-12-18 00:40:24,012 INFO L933 BasicCegarLoop]: 411 mSDtfsCounter, 399 mSDsluCounter, 1976 mSDsCounter, 0 mSdLazyCounter, 2242 mSolverCounterSat, 263 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 2387 SdHoareTripleChecker+Invalid, 2505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 263 IncrementalHoareTripleChecker+Valid, 2242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2021-12-18 00:40:24,013 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [459 Valid, 2387 Invalid, 2505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [263 Valid, 2242 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2021-12-18 00:40:24,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2021-12-18 00:40:24,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 349. [2021-12-18 00:40:24,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 230 states have (on average 1.2434782608695651) internal successors, (286), 233 states have internal predecessors, (286), 86 states have call successors, (86), 30 states have call predecessors, (86), 32 states have return successors, (89), 85 states have call predecessors, (89), 84 states have call successors, (89) [2021-12-18 00:40:24,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 461 transitions. [2021-12-18 00:40:24,029 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 461 transitions. Word has length 130 [2021-12-18 00:40:24,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:40:24,030 INFO L470 AbstractCegarLoop]: Abstraction has 349 states and 461 transitions. [2021-12-18 00:40:24,030 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 9 states have internal predecessors, (61), 4 states have call successors, (23), 5 states have call predecessors, (23), 3 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) [2021-12-18 00:40:24,030 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 461 transitions. [2021-12-18 00:40:24,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2021-12-18 00:40:24,031 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:40:24,032 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 00:40:24,032 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-18 00:40:24,032 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:40:24,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:40:24,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1092762838, now seen corresponding path program 1 times [2021-12-18 00:40:24,033 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:40:24,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106157776] [2021-12-18 00:40:24,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:40:24,044 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:40:24,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:24,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:40:24,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:24,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-18 00:40:24,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:24,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 00:40:24,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:24,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-18 00:40:24,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:24,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-18 00:40:24,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:24,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:40:24,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:24,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:40:24,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:24,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 00:40:24,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:24,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-12-18 00:40:24,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:24,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-18 00:40:24,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:24,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:40:24,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:24,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-12-18 00:40:24,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:24,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-18 00:40:24,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:24,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-12-18 00:40:24,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:24,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-12-18 00:40:24,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:24,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-12-18 00:40:24,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:24,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2021-12-18 00:40:24,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:24,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2021-12-18 00:40:24,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:24,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2021-12-18 00:40:24,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:24,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2021-12-18 00:40:24,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:24,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2021-12-18 00:40:24,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:24,470 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2021-12-18 00:40:24,470 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:40:24,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106157776] [2021-12-18 00:40:24,470 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106157776] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 00:40:24,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2022451553] [2021-12-18 00:40:24,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:40:24,470 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 00:40:24,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 00:40:24,471 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-12-18 00:40:24,482 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-12-18 00:40:24,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:24,955 INFO L263 TraceCheckSpWp]: Trace formula consists of 2518 conjuncts, 23 conjunts are in the unsatisfiable core [2021-12-18 00:40:24,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 00:40:26,033 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((aws_hash_table_is_valid_~map.base Int) (aws_hash_table_is_valid_~map.offset Int)) (not (= (select (select |c_#memory_$Pointer$.offset| aws_hash_table_is_valid_~map.base) aws_hash_table_is_valid_~map.offset) 0))) (exists ((aws_hash_table_is_valid_~map.base Int) (aws_hash_table_is_valid_~map.offset Int)) (not (= (select (select |c_#memory_$Pointer$.base| aws_hash_table_is_valid_~map.base) aws_hash_table_is_valid_~map.offset) 0)))) is different from true [2021-12-18 00:40:32,435 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2021-12-18 00:40:32,435 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 00:40:32,435 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2022451553] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 00:40:32,436 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-18 00:40:32,436 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 16 [2021-12-18 00:40:32,436 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356536073] [2021-12-18 00:40:32,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 00:40:32,436 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-18 00:40:32,436 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:40:32,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-18 00:40:32,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=175, Unknown=3, NotChecked=26, Total=240 [2021-12-18 00:40:32,437 INFO L87 Difference]: Start difference. First operand 349 states and 461 transitions. Second operand has 8 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 3 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (21), 2 states have call predecessors, (21), 3 states have call successors, (21) [2021-12-18 00:40:33,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:40:33,139 INFO L93 Difference]: Finished difference Result 681 states and 900 transitions. [2021-12-18 00:40:33,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-18 00:40:33,151 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 3 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (21), 2 states have call predecessors, (21), 3 states have call successors, (21) Word has length 136 [2021-12-18 00:40:33,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:40:33,155 INFO L225 Difference]: With dead ends: 681 [2021-12-18 00:40:33,155 INFO L226 Difference]: Without dead ends: 351 [2021-12-18 00:40:33,156 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=51, Invalid=222, Unknown=3, NotChecked=30, Total=306 [2021-12-18 00:40:33,157 INFO L933 BasicCegarLoop]: 444 mSDtfsCounter, 5 mSDsluCounter, 1962 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2406 SdHoareTripleChecker+Invalid, 728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 628 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-18 00:40:33,157 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 2406 Invalid, 728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 628 Unchecked, 0.6s Time] [2021-12-18 00:40:33,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2021-12-18 00:40:33,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 351. [2021-12-18 00:40:33,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 232 states have (on average 1.2413793103448276) internal successors, (288), 234 states have internal predecessors, (288), 86 states have call successors, (86), 31 states have call predecessors, (86), 32 states have return successors, (89), 85 states have call predecessors, (89), 84 states have call successors, (89) [2021-12-18 00:40:33,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 463 transitions. [2021-12-18 00:40:33,176 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 463 transitions. Word has length 136 [2021-12-18 00:40:33,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:40:33,178 INFO L470 AbstractCegarLoop]: Abstraction has 351 states and 463 transitions. [2021-12-18 00:40:33,178 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 3 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (21), 2 states have call predecessors, (21), 3 states have call successors, (21) [2021-12-18 00:40:33,178 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 463 transitions. [2021-12-18 00:40:33,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2021-12-18 00:40:33,180 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:40:33,181 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 00:40:33,213 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-18 00:40:33,403 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 00:40:33,404 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:40:33,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:40:33,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1043141135, now seen corresponding path program 1 times [2021-12-18 00:40:33,404 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:40:33,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365117810] [2021-12-18 00:40:33,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:40:33,404 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:40:33,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:33,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:40:33,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:33,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-18 00:40:33,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:33,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 00:40:33,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:33,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-18 00:40:33,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:33,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-18 00:40:33,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:33,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:40:33,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:33,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:40:33,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:33,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 00:40:33,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:33,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-12-18 00:40:33,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:33,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-18 00:40:33,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:33,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:40:33,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:33,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-12-18 00:40:33,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:33,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-18 00:40:33,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:33,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:40:33,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:33,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-18 00:40:33,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:33,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-12-18 00:40:33,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:33,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-12-18 00:40:33,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:33,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2021-12-18 00:40:33,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:33,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-12-18 00:40:33,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:33,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2021-12-18 00:40:33,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:33,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2021-12-18 00:40:33,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:33,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2021-12-18 00:40:33,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:33,869 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2021-12-18 00:40:33,869 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:40:33,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365117810] [2021-12-18 00:40:33,870 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365117810] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 00:40:33,870 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 00:40:33,870 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-18 00:40:33,870 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260249132] [2021-12-18 00:40:33,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 00:40:33,871 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-18 00:40:33,871 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:40:33,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-18 00:40:33,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-12-18 00:40:33,872 INFO L87 Difference]: Start difference. First operand 351 states and 463 transitions. Second operand has 9 states, 8 states have (on average 8.5) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (25), 5 states have call predecessors, (25), 3 states have return successors, (22), 3 states have call predecessors, (22), 2 states have call successors, (22) [2021-12-18 00:40:35,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:40:35,266 INFO L93 Difference]: Finished difference Result 739 states and 993 transitions. [2021-12-18 00:40:35,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-18 00:40:35,266 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.5) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (25), 5 states have call predecessors, (25), 3 states have return successors, (22), 3 states have call predecessors, (22), 2 states have call successors, (22) Word has length 141 [2021-12-18 00:40:35,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:40:35,269 INFO L225 Difference]: With dead ends: 739 [2021-12-18 00:40:35,270 INFO L226 Difference]: Without dead ends: 433 [2021-12-18 00:40:35,271 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2021-12-18 00:40:35,271 INFO L933 BasicCegarLoop]: 410 mSDtfsCounter, 357 mSDsluCounter, 1346 mSDsCounter, 0 mSdLazyCounter, 1233 mSolverCounterSat, 253 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 411 SdHoareTripleChecker+Valid, 1756 SdHoareTripleChecker+Invalid, 1486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 253 IncrementalHoareTripleChecker+Valid, 1233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-12-18 00:40:35,271 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [411 Valid, 1756 Invalid, 1486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [253 Valid, 1233 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2021-12-18 00:40:35,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2021-12-18 00:40:35,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 353. [2021-12-18 00:40:35,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 233 states have (on average 1.240343347639485) internal successors, (289), 236 states have internal predecessors, (289), 86 states have call successors, (86), 31 states have call predecessors, (86), 33 states have return successors, (94), 85 states have call predecessors, (94), 84 states have call successors, (94) [2021-12-18 00:40:35,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 469 transitions. [2021-12-18 00:40:35,306 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 469 transitions. Word has length 141 [2021-12-18 00:40:35,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:40:35,307 INFO L470 AbstractCegarLoop]: Abstraction has 353 states and 469 transitions. [2021-12-18 00:40:35,307 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.5) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (25), 5 states have call predecessors, (25), 3 states have return successors, (22), 3 states have call predecessors, (22), 2 states have call successors, (22) [2021-12-18 00:40:35,307 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 469 transitions. [2021-12-18 00:40:35,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2021-12-18 00:40:35,309 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:40:35,309 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 00:40:35,309 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-18 00:40:35,309 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:40:35,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:40:35,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1171893452, now seen corresponding path program 1 times [2021-12-18 00:40:35,310 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:40:35,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460297595] [2021-12-18 00:40:35,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:40:35,310 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:40:35,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:35,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:40:35,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:35,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-18 00:40:35,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:35,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 00:40:35,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:35,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-18 00:40:35,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:35,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-18 00:40:35,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:35,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:40:35,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:35,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:40:35,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:35,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 00:40:35,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:35,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-12-18 00:40:35,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:35,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-18 00:40:35,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:35,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:40:35,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:35,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-12-18 00:40:35,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:35,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-18 00:40:35,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:35,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:40:35,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:35,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-18 00:40:35,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:35,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-12-18 00:40:35,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:35,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-12-18 00:40:35,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:35,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2021-12-18 00:40:35,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:35,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-12-18 00:40:35,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:35,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2021-12-18 00:40:35,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:35,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2021-12-18 00:40:35,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:35,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:40:35,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:35,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2021-12-18 00:40:35,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:35,908 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2021-12-18 00:40:35,908 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:40:35,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460297595] [2021-12-18 00:40:35,908 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460297595] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 00:40:35,908 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 00:40:35,908 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-18 00:40:35,908 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896060445] [2021-12-18 00:40:35,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 00:40:35,909 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-18 00:40:35,909 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:40:35,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-18 00:40:35,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-18 00:40:35,910 INFO L87 Difference]: Start difference. First operand 353 states and 469 transitions. Second operand has 8 states, 7 states have (on average 9.0) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (25), 5 states have call predecessors, (25), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2021-12-18 00:40:37,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:40:37,604 INFO L93 Difference]: Finished difference Result 441 states and 597 transitions. [2021-12-18 00:40:37,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-18 00:40:37,605 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.0) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (25), 5 states have call predecessors, (25), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 146 [2021-12-18 00:40:37,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:40:37,608 INFO L225 Difference]: With dead ends: 441 [2021-12-18 00:40:37,608 INFO L226 Difference]: Without dead ends: 439 [2021-12-18 00:40:37,608 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2021-12-18 00:40:37,609 INFO L933 BasicCegarLoop]: 424 mSDtfsCounter, 373 mSDsluCounter, 1136 mSDsCounter, 0 mSdLazyCounter, 936 mSolverCounterSat, 254 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 1560 SdHoareTripleChecker+Invalid, 1190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 254 IncrementalHoareTripleChecker+Valid, 936 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2021-12-18 00:40:37,609 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [418 Valid, 1560 Invalid, 1190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [254 Valid, 936 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2021-12-18 00:40:37,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2021-12-18 00:40:37,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 357. [2021-12-18 00:40:37,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 236 states have (on average 1.2372881355932204) internal successors, (292), 239 states have internal predecessors, (292), 86 states have call successors, (86), 32 states have call predecessors, (86), 34 states have return successors, (94), 85 states have call predecessors, (94), 84 states have call successors, (94) [2021-12-18 00:40:37,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 472 transitions. [2021-12-18 00:40:37,627 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 472 transitions. Word has length 146 [2021-12-18 00:40:37,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:40:37,628 INFO L470 AbstractCegarLoop]: Abstraction has 357 states and 472 transitions. [2021-12-18 00:40:37,628 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.0) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (25), 5 states have call predecessors, (25), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2021-12-18 00:40:37,628 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 472 transitions. [2021-12-18 00:40:37,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2021-12-18 00:40:37,630 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:40:37,630 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 00:40:37,630 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-18 00:40:37,630 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:40:37,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:40:37,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1112780077, now seen corresponding path program 1 times [2021-12-18 00:40:37,631 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:40:37,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340868769] [2021-12-18 00:40:37,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:40:37,631 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:40:37,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:37,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:40:37,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:37,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-18 00:40:37,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:37,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 00:40:37,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:37,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-18 00:40:37,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:37,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-18 00:40:37,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:37,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:40:37,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:37,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:40:37,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:37,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 00:40:37,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:37,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-12-18 00:40:37,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:37,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-18 00:40:37,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:37,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:40:37,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:37,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-12-18 00:40:37,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:38,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-18 00:40:38,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:38,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:40:38,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:38,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-18 00:40:38,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:38,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-12-18 00:40:38,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:38,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-12-18 00:40:38,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:38,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2021-12-18 00:40:38,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:38,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-12-18 00:40:38,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:38,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2021-12-18 00:40:38,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:38,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2021-12-18 00:40:38,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:38,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:40:38,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:38,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2021-12-18 00:40:38,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:38,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2021-12-18 00:40:38,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:38,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2021-12-18 00:40:38,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:38,093 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2021-12-18 00:40:38,093 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:40:38,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340868769] [2021-12-18 00:40:38,093 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340868769] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 00:40:38,093 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 00:40:38,093 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-18 00:40:38,094 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148274729] [2021-12-18 00:40:38,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 00:40:38,094 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-18 00:40:38,094 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:40:38,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-18 00:40:38,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-18 00:40:38,095 INFO L87 Difference]: Start difference. First operand 357 states and 472 transitions. Second operand has 8 states, 7 states have (on average 10.285714285714286) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (27), 5 states have call predecessors, (27), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2021-12-18 00:40:39,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:40:39,524 INFO L93 Difference]: Finished difference Result 447 states and 603 transitions. [2021-12-18 00:40:39,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-18 00:40:39,525 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.285714285714286) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (27), 5 states have call predecessors, (27), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 159 [2021-12-18 00:40:39,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:40:39,527 INFO L225 Difference]: With dead ends: 447 [2021-12-18 00:40:39,527 INFO L226 Difference]: Without dead ends: 445 [2021-12-18 00:40:39,528 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2021-12-18 00:40:39,528 INFO L933 BasicCegarLoop]: 421 mSDtfsCounter, 364 mSDsluCounter, 1118 mSDsCounter, 0 mSdLazyCounter, 951 mSolverCounterSat, 253 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 1539 SdHoareTripleChecker+Invalid, 1204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 253 IncrementalHoareTripleChecker+Valid, 951 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-12-18 00:40:39,528 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [412 Valid, 1539 Invalid, 1204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [253 Valid, 951 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2021-12-18 00:40:39,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2021-12-18 00:40:39,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 362. [2021-12-18 00:40:39,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 239 states have (on average 1.2343096234309623) internal successors, (295), 243 states have internal predecessors, (295), 87 states have call successors, (87), 33 states have call predecessors, (87), 35 states have return successors, (95), 85 states have call predecessors, (95), 85 states have call successors, (95) [2021-12-18 00:40:39,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 477 transitions. [2021-12-18 00:40:39,545 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 477 transitions. Word has length 159 [2021-12-18 00:40:39,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:40:39,546 INFO L470 AbstractCegarLoop]: Abstraction has 362 states and 477 transitions. [2021-12-18 00:40:39,546 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.285714285714286) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (27), 5 states have call predecessors, (27), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2021-12-18 00:40:39,546 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 477 transitions. [2021-12-18 00:40:39,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2021-12-18 00:40:39,548 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:40:39,548 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 00:40:39,548 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-18 00:40:39,548 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:40:39,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:40:39,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1110933035, now seen corresponding path program 1 times [2021-12-18 00:40:39,549 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:40:39,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581818343] [2021-12-18 00:40:39,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:40:39,549 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:40:39,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:39,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:40:39,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:39,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-18 00:40:39,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:39,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 00:40:39,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:39,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-18 00:40:39,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:39,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-18 00:40:39,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:39,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:40:39,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:39,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:40:39,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:39,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 00:40:39,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:39,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-12-18 00:40:39,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:39,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-18 00:40:39,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:39,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:40:39,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:39,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-12-18 00:40:39,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:39,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-18 00:40:39,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:39,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:40:39,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:39,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-18 00:40:39,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:39,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-12-18 00:40:39,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:39,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-12-18 00:40:39,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:39,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2021-12-18 00:40:39,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:39,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-12-18 00:40:39,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:39,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2021-12-18 00:40:39,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:39,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2021-12-18 00:40:39,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:39,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:40:39,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:39,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2021-12-18 00:40:39,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:39,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2021-12-18 00:40:39,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:39,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2021-12-18 00:40:39,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:40,000 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2021-12-18 00:40:40,000 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:40:40,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581818343] [2021-12-18 00:40:40,001 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581818343] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 00:40:40,001 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 00:40:40,001 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-18 00:40:40,001 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030594258] [2021-12-18 00:40:40,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 00:40:40,002 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-18 00:40:40,002 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:40:40,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-18 00:40:40,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-18 00:40:40,003 INFO L87 Difference]: Start difference. First operand 362 states and 477 transitions. Second operand has 8 states, 7 states have (on average 10.285714285714286) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (27), 5 states have call predecessors, (27), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2021-12-18 00:40:41,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:40:41,525 INFO L93 Difference]: Finished difference Result 450 states and 605 transitions. [2021-12-18 00:40:41,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-18 00:40:41,526 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.285714285714286) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (27), 5 states have call predecessors, (27), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 159 [2021-12-18 00:40:41,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:40:41,528 INFO L225 Difference]: With dead ends: 450 [2021-12-18 00:40:41,528 INFO L226 Difference]: Without dead ends: 448 [2021-12-18 00:40:41,529 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2021-12-18 00:40:41,529 INFO L933 BasicCegarLoop]: 422 mSDtfsCounter, 361 mSDsluCounter, 1166 mSDsCounter, 0 mSdLazyCounter, 1045 mSolverCounterSat, 252 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 408 SdHoareTripleChecker+Valid, 1588 SdHoareTripleChecker+Invalid, 1297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 252 IncrementalHoareTripleChecker+Valid, 1045 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2021-12-18 00:40:41,530 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [408 Valid, 1588 Invalid, 1297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [252 Valid, 1045 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2021-12-18 00:40:41,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2021-12-18 00:40:41,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 361. [2021-12-18 00:40:41,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 239 states have (on average 1.2343096234309623) internal successors, (295), 242 states have internal predecessors, (295), 86 states have call successors, (86), 33 states have call predecessors, (86), 35 states have return successors, (94), 85 states have call predecessors, (94), 84 states have call successors, (94) [2021-12-18 00:40:41,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 475 transitions. [2021-12-18 00:40:41,546 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 475 transitions. Word has length 159 [2021-12-18 00:40:41,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:40:41,546 INFO L470 AbstractCegarLoop]: Abstraction has 361 states and 475 transitions. [2021-12-18 00:40:41,546 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.285714285714286) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (27), 5 states have call predecessors, (27), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2021-12-18 00:40:41,547 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 475 transitions. [2021-12-18 00:40:41,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2021-12-18 00:40:41,548 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:40:41,549 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 00:40:41,549 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-18 00:40:41,549 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:40:41,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:40:41,549 INFO L85 PathProgramCache]: Analyzing trace with hash -287383829, now seen corresponding path program 1 times [2021-12-18 00:40:41,550 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:40:41,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627332014] [2021-12-18 00:40:41,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:40:41,550 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:40:41,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:41,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:40:41,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:41,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-18 00:40:41,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:41,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 00:40:41,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:41,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-18 00:40:41,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:41,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-18 00:40:41,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:41,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:40:41,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:41,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:40:41,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:41,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 00:40:41,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:41,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-12-18 00:40:41,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:41,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-18 00:40:41,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:41,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:40:41,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:41,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-12-18 00:40:41,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:41,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-18 00:40:41,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:41,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:40:41,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:41,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-18 00:40:41,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:41,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-12-18 00:40:41,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:41,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-12-18 00:40:41,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:41,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2021-12-18 00:40:41,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:41,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-12-18 00:40:41,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:41,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2021-12-18 00:40:41,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:41,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-18 00:40:41,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:41,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:40:41,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:41,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:40:41,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:41,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-18 00:40:41,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:41,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2021-12-18 00:40:41,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:41,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2021-12-18 00:40:41,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:41,905 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2021-12-18 00:40:41,905 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:40:41,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627332014] [2021-12-18 00:40:41,905 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627332014] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 00:40:41,905 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 00:40:41,906 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-18 00:40:41,906 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580500021] [2021-12-18 00:40:41,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 00:40:41,906 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-18 00:40:41,906 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:40:41,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-18 00:40:41,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-12-18 00:40:41,907 INFO L87 Difference]: Start difference. First operand 361 states and 475 transitions. Second operand has 9 states, 8 states have (on average 9.625) internal successors, (77), 5 states have internal predecessors, (77), 4 states have call successors, (31), 6 states have call predecessors, (31), 1 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2021-12-18 00:40:43,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:40:43,560 INFO L93 Difference]: Finished difference Result 805 states and 1098 transitions. [2021-12-18 00:40:43,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-18 00:40:43,560 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 9.625) internal successors, (77), 5 states have internal predecessors, (77), 4 states have call successors, (31), 6 states have call predecessors, (31), 1 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) Word has length 174 [2021-12-18 00:40:43,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:40:43,563 INFO L225 Difference]: With dead ends: 805 [2021-12-18 00:40:43,563 INFO L226 Difference]: Without dead ends: 513 [2021-12-18 00:40:43,564 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2021-12-18 00:40:43,565 INFO L933 BasicCegarLoop]: 488 mSDtfsCounter, 598 mSDsluCounter, 1623 mSDsCounter, 0 mSdLazyCounter, 1244 mSolverCounterSat, 432 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 653 SdHoareTripleChecker+Valid, 2111 SdHoareTripleChecker+Invalid, 1676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 432 IncrementalHoareTripleChecker+Valid, 1244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2021-12-18 00:40:43,565 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [653 Valid, 2111 Invalid, 1676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [432 Valid, 1244 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2021-12-18 00:40:43,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2021-12-18 00:40:43,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 402. [2021-12-18 00:40:43,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 269 states have (on average 1.2490706319702602) internal successors, (336), 273 states have internal predecessors, (336), 96 states have call successors, (96), 34 states have call predecessors, (96), 36 states have return successors, (105), 94 states have call predecessors, (105), 94 states have call successors, (105) [2021-12-18 00:40:43,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 537 transitions. [2021-12-18 00:40:43,585 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 537 transitions. Word has length 174 [2021-12-18 00:40:43,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:40:43,586 INFO L470 AbstractCegarLoop]: Abstraction has 402 states and 537 transitions. [2021-12-18 00:40:43,586 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 9.625) internal successors, (77), 5 states have internal predecessors, (77), 4 states have call successors, (31), 6 states have call predecessors, (31), 1 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2021-12-18 00:40:43,586 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 537 transitions. [2021-12-18 00:40:43,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2021-12-18 00:40:43,589 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:40:43,589 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 00:40:43,589 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-18 00:40:43,589 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:40:43,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:40:43,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1099401581, now seen corresponding path program 1 times [2021-12-18 00:40:43,590 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:40:43,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266664483] [2021-12-18 00:40:43,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:40:43,591 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:40:43,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:43,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:40:43,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:43,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-18 00:40:43,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:43,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 00:40:43,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:43,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-18 00:40:43,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:43,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-18 00:40:43,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:43,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:40:43,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:43,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:40:43,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:43,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 00:40:43,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:43,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-12-18 00:40:43,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:43,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-18 00:40:43,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:44,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:40:44,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:44,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-12-18 00:40:44,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:44,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-18 00:40:44,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:44,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:40:44,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:44,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-18 00:40:44,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:44,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-12-18 00:40:44,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:44,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-12-18 00:40:44,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:44,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2021-12-18 00:40:44,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:44,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-12-18 00:40:44,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:44,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2021-12-18 00:40:44,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:44,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-18 00:40:44,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:44,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:40:44,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:44,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:40:44,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:44,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-18 00:40:44,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:44,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2021-12-18 00:40:44,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:44,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2021-12-18 00:40:44,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:44,200 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2021-12-18 00:40:44,201 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:40:44,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266664483] [2021-12-18 00:40:44,201 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266664483] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 00:40:44,201 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 00:40:44,201 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-12-18 00:40:44,201 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102016854] [2021-12-18 00:40:44,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 00:40:44,202 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-18 00:40:44,202 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:40:44,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-18 00:40:44,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2021-12-18 00:40:44,203 INFO L87 Difference]: Start difference. First operand 402 states and 537 transitions. Second operand has 14 states, 14 states have (on average 5.5) internal successors, (77), 8 states have internal predecessors, (77), 6 states have call successors, (31), 8 states have call predecessors, (31), 2 states have return successors, (25), 4 states have call predecessors, (25), 3 states have call successors, (25) [2021-12-18 00:40:47,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:40:47,300 INFO L93 Difference]: Finished difference Result 1011 states and 1427 transitions. [2021-12-18 00:40:47,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-18 00:40:47,300 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.5) internal successors, (77), 8 states have internal predecessors, (77), 6 states have call successors, (31), 8 states have call predecessors, (31), 2 states have return successors, (25), 4 states have call predecessors, (25), 3 states have call successors, (25) Word has length 174 [2021-12-18 00:40:47,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:40:47,305 INFO L225 Difference]: With dead ends: 1011 [2021-12-18 00:40:47,305 INFO L226 Difference]: Without dead ends: 691 [2021-12-18 00:40:47,307 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=116, Invalid=534, Unknown=0, NotChecked=0, Total=650 [2021-12-18 00:40:47,307 INFO L933 BasicCegarLoop]: 439 mSDtfsCounter, 449 mSDsluCounter, 3180 mSDsCounter, 0 mSdLazyCounter, 2606 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 3619 SdHoareTripleChecker+Invalid, 2808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 2606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2021-12-18 00:40:47,308 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [501 Valid, 3619 Invalid, 2808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 2606 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2021-12-18 00:40:47,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2021-12-18 00:40:47,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 449. [2021-12-18 00:40:47,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 303 states have (on average 1.2607260726072607) internal successors, (382), 308 states have internal predecessors, (382), 105 states have call successors, (105), 37 states have call predecessors, (105), 40 states have return successors, (118), 103 states have call predecessors, (118), 103 states have call successors, (118) [2021-12-18 00:40:47,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 605 transitions. [2021-12-18 00:40:47,333 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 605 transitions. Word has length 174 [2021-12-18 00:40:47,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:40:47,333 INFO L470 AbstractCegarLoop]: Abstraction has 449 states and 605 transitions. [2021-12-18 00:40:47,334 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.5) internal successors, (77), 8 states have internal predecessors, (77), 6 states have call successors, (31), 8 states have call predecessors, (31), 2 states have return successors, (25), 4 states have call predecessors, (25), 3 states have call successors, (25) [2021-12-18 00:40:47,334 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 605 transitions. [2021-12-18 00:40:47,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2021-12-18 00:40:47,336 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:40:47,336 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 00:40:47,336 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-18 00:40:47,336 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:40:47,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:40:47,337 INFO L85 PathProgramCache]: Analyzing trace with hash -73198679, now seen corresponding path program 1 times [2021-12-18 00:40:47,337 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:40:47,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819888907] [2021-12-18 00:40:47,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:40:47,337 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:40:47,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:47,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:40:47,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:47,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-18 00:40:47,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:47,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 00:40:47,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:47,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-18 00:40:47,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:47,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-18 00:40:47,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:47,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:40:47,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:47,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:40:47,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:47,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 00:40:47,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:47,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-12-18 00:40:47,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:47,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-18 00:40:47,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:47,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:40:47,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:47,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-12-18 00:40:47,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:47,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-18 00:40:47,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:47,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:40:47,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:47,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-18 00:40:47,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:47,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-12-18 00:40:47,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:47,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-12-18 00:40:47,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:47,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2021-12-18 00:40:47,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:47,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-12-18 00:40:47,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:47,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2021-12-18 00:40:47,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:47,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-12-18 00:40:47,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:47,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:40:47,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:47,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:40:47,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:47,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:40:47,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:47,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-18 00:40:47,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:47,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-18 00:40:47,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:47,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2021-12-18 00:40:47,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:47,737 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2021-12-18 00:40:47,737 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:40:47,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819888907] [2021-12-18 00:40:47,737 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819888907] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 00:40:47,738 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 00:40:47,738 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-18 00:40:47,738 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741604139] [2021-12-18 00:40:47,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 00:40:47,739 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-18 00:40:47,739 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:40:47,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-18 00:40:47,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-12-18 00:40:47,740 INFO L87 Difference]: Start difference. First operand 449 states and 605 transitions. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 5 states have internal predecessors, (78), 3 states have call successors, (27), 6 states have call predecessors, (27), 3 states have return successors, (26), 2 states have call predecessors, (26), 3 states have call successors, (26) [2021-12-18 00:40:50,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:40:50,586 INFO L93 Difference]: Finished difference Result 861 states and 1191 transitions. [2021-12-18 00:40:50,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-18 00:40:50,587 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 5 states have internal predecessors, (78), 3 states have call successors, (27), 6 states have call predecessors, (27), 3 states have return successors, (26), 2 states have call predecessors, (26), 3 states have call successors, (26) Word has length 172 [2021-12-18 00:40:50,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:40:50,590 INFO L225 Difference]: With dead ends: 861 [2021-12-18 00:40:50,590 INFO L226 Difference]: Without dead ends: 583 [2021-12-18 00:40:50,592 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2021-12-18 00:40:50,593 INFO L933 BasicCegarLoop]: 436 mSDtfsCounter, 586 mSDsluCounter, 1250 mSDsCounter, 0 mSdLazyCounter, 1188 mSolverCounterSat, 446 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 644 SdHoareTripleChecker+Valid, 1686 SdHoareTripleChecker+Invalid, 1634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 446 IncrementalHoareTripleChecker+Valid, 1188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2021-12-18 00:40:50,593 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [644 Valid, 1686 Invalid, 1634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [446 Valid, 1188 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2021-12-18 00:40:50,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2021-12-18 00:40:50,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 449. [2021-12-18 00:40:50,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 303 states have (on average 1.2475247524752475) internal successors, (378), 308 states have internal predecessors, (378), 105 states have call successors, (105), 37 states have call predecessors, (105), 40 states have return successors, (118), 103 states have call predecessors, (118), 103 states have call successors, (118) [2021-12-18 00:40:50,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 601 transitions. [2021-12-18 00:40:50,613 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 601 transitions. Word has length 172 [2021-12-18 00:40:50,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:40:50,614 INFO L470 AbstractCegarLoop]: Abstraction has 449 states and 601 transitions. [2021-12-18 00:40:50,614 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 5 states have internal predecessors, (78), 3 states have call successors, (27), 6 states have call predecessors, (27), 3 states have return successors, (26), 2 states have call predecessors, (26), 3 states have call successors, (26) [2021-12-18 00:40:50,614 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 601 transitions. [2021-12-18 00:40:50,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2021-12-18 00:40:50,616 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:40:50,616 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 00:40:50,617 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-18 00:40:50,617 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:40:50,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:40:50,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1732239655, now seen corresponding path program 1 times [2021-12-18 00:40:50,617 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:40:50,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788287044] [2021-12-18 00:40:50,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:40:50,618 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:40:50,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:50,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:40:50,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:50,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-18 00:40:50,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:50,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 00:40:50,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:50,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-18 00:40:50,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:50,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-18 00:40:50,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:50,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:40:50,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:50,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:40:50,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:50,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 00:40:50,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:50,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-12-18 00:40:50,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:50,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-18 00:40:50,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:50,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:40:50,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:50,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-12-18 00:40:50,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:50,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-18 00:40:50,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:50,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:40:50,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:50,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-18 00:40:50,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:50,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-12-18 00:40:50,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:50,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-12-18 00:40:50,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:50,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2021-12-18 00:40:50,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:50,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-12-18 00:40:50,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:51,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2021-12-18 00:40:51,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:51,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-12-18 00:40:51,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:51,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:40:51,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:51,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:40:51,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:51,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:40:51,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:51,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-18 00:40:51,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:51,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-18 00:40:51,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:51,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2021-12-18 00:40:51,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:51,131 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2021-12-18 00:40:51,131 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:40:51,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788287044] [2021-12-18 00:40:51,132 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788287044] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 00:40:51,132 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 00:40:51,132 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-18 00:40:51,132 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206113653] [2021-12-18 00:40:51,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 00:40:51,133 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-18 00:40:51,133 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:40:51,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-18 00:40:51,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-12-18 00:40:51,134 INFO L87 Difference]: Start difference. First operand 449 states and 601 transitions. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (27), 6 states have call predecessors, (27), 3 states have return successors, (26), 3 states have call predecessors, (26), 2 states have call successors, (26) [2021-12-18 00:40:55,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:40:55,171 INFO L93 Difference]: Finished difference Result 784 states and 1122 transitions. [2021-12-18 00:40:55,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-18 00:40:55,172 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (27), 6 states have call predecessors, (27), 3 states have return successors, (26), 3 states have call predecessors, (26), 2 states have call successors, (26) Word has length 172 [2021-12-18 00:40:55,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:40:55,176 INFO L225 Difference]: With dead ends: 784 [2021-12-18 00:40:55,176 INFO L226 Difference]: Without dead ends: 709 [2021-12-18 00:40:55,176 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2021-12-18 00:40:55,177 INFO L933 BasicCegarLoop]: 491 mSDtfsCounter, 348 mSDsluCounter, 1619 mSDsCounter, 0 mSdLazyCounter, 1539 mSolverCounterSat, 186 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 411 SdHoareTripleChecker+Valid, 2110 SdHoareTripleChecker+Invalid, 1725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 186 IncrementalHoareTripleChecker+Valid, 1539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2021-12-18 00:40:55,177 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [411 Valid, 2110 Invalid, 1725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [186 Valid, 1539 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2021-12-18 00:40:55,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2021-12-18 00:40:55,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 457. [2021-12-18 00:40:55,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 309 states have (on average 1.2427184466019416) internal successors, (384), 314 states have internal predecessors, (384), 105 states have call successors, (105), 37 states have call predecessors, (105), 42 states have return successors, (122), 105 states have call predecessors, (122), 103 states have call successors, (122) [2021-12-18 00:40:55,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 611 transitions. [2021-12-18 00:40:55,201 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 611 transitions. Word has length 172 [2021-12-18 00:40:55,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:40:55,202 INFO L470 AbstractCegarLoop]: Abstraction has 457 states and 611 transitions. [2021-12-18 00:40:55,202 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (27), 6 states have call predecessors, (27), 3 states have return successors, (26), 3 states have call predecessors, (26), 2 states have call successors, (26) [2021-12-18 00:40:55,202 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 611 transitions. [2021-12-18 00:40:55,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2021-12-18 00:40:55,204 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:40:55,204 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 00:40:55,205 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-18 00:40:55,205 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:40:55,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:40:55,205 INFO L85 PathProgramCache]: Analyzing trace with hash -2115319198, now seen corresponding path program 1 times [2021-12-18 00:40:55,205 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:40:55,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735872254] [2021-12-18 00:40:55,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:40:55,206 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:40:55,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:55,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:40:55,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:55,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-18 00:40:55,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:55,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 00:40:55,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:55,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-18 00:40:55,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:55,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-18 00:40:55,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:55,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:40:55,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:55,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:40:55,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:55,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 00:40:55,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:55,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-12-18 00:40:55,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:55,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-18 00:40:55,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:55,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:40:55,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:55,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-12-18 00:40:55,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:55,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-18 00:40:55,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:55,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:40:55,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:55,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-18 00:40:55,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:55,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-12-18 00:40:55,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:55,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-12-18 00:40:55,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:55,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2021-12-18 00:40:55,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:55,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-12-18 00:40:55,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:55,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2021-12-18 00:40:55,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:55,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-18 00:40:55,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:55,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:40:55,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:55,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:40:55,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:55,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-18 00:40:55,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:55,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2021-12-18 00:40:55,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:55,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2021-12-18 00:40:55,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:55,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2021-12-18 00:40:55,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:55,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2021-12-18 00:40:55,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:55,952 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 201 trivial. 0 not checked. [2021-12-18 00:40:55,952 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:40:55,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735872254] [2021-12-18 00:40:55,953 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735872254] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 00:40:55,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [523815843] [2021-12-18 00:40:55,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:40:55,953 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 00:40:55,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 00:40:55,954 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-12-18 00:40:55,955 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-12-18 00:40:56,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:40:56,551 INFO L263 TraceCheckSpWp]: Trace formula consists of 2776 conjuncts, 49 conjunts are in the unsatisfiable core [2021-12-18 00:40:56,556 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 00:40:56,728 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 7 treesize of output 3 [2021-12-18 00:40:56,730 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 7 treesize of output 3 [2021-12-18 00:40:56,988 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 56 proven. 2 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2021-12-18 00:40:56,988 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 00:40:57,642 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 201 trivial. 0 not checked. [2021-12-18 00:40:57,642 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [523815843] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 00:40:57,642 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 00:40:57,642 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12, 13] total 20 [2021-12-18 00:40:57,642 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396092029] [2021-12-18 00:40:57,642 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 00:40:57,643 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-12-18 00:40:57,643 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:40:57,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-18 00:40:57,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2021-12-18 00:40:57,644 INFO L87 Difference]: Start difference. First operand 457 states and 611 transitions. Second operand has 20 states, 17 states have (on average 6.117647058823529) internal successors, (104), 15 states have internal predecessors, (104), 10 states have call successors, (42), 7 states have call predecessors, (42), 5 states have return successors, (33), 6 states have call predecessors, (33), 8 states have call successors, (33) [2021-12-18 00:41:00,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:41:00,365 INFO L93 Difference]: Finished difference Result 966 states and 1329 transitions. [2021-12-18 00:41:00,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-18 00:41:00,365 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 6.117647058823529) internal successors, (104), 15 states have internal predecessors, (104), 10 states have call successors, (42), 7 states have call predecessors, (42), 5 states have return successors, (33), 6 states have call predecessors, (33), 8 states have call successors, (33) Word has length 178 [2021-12-18 00:41:00,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:41:00,369 INFO L225 Difference]: With dead ends: 966 [2021-12-18 00:41:00,369 INFO L226 Difference]: Without dead ends: 615 [2021-12-18 00:41:00,370 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 436 GetRequests, 393 SyntacticMatches, 11 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=159, Invalid=963, Unknown=0, NotChecked=0, Total=1122 [2021-12-18 00:41:00,371 INFO L933 BasicCegarLoop]: 422 mSDtfsCounter, 626 mSDsluCounter, 3147 mSDsCounter, 0 mSdLazyCounter, 2546 mSolverCounterSat, 482 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 676 SdHoareTripleChecker+Valid, 3569 SdHoareTripleChecker+Invalid, 3028 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 482 IncrementalHoareTripleChecker+Valid, 2546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2021-12-18 00:41:00,371 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [676 Valid, 3569 Invalid, 3028 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [482 Valid, 2546 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2021-12-18 00:41:00,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2021-12-18 00:41:00,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 473. [2021-12-18 00:41:00,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 316 states have (on average 1.2373417721518987) internal successors, (391), 321 states have internal predecessors, (391), 113 states have call successors, (113), 38 states have call predecessors, (113), 43 states have return successors, (128), 113 states have call predecessors, (128), 111 states have call successors, (128) [2021-12-18 00:41:00,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 632 transitions. [2021-12-18 00:41:00,392 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 632 transitions. Word has length 178 [2021-12-18 00:41:00,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:41:00,393 INFO L470 AbstractCegarLoop]: Abstraction has 473 states and 632 transitions. [2021-12-18 00:41:00,393 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 6.117647058823529) internal successors, (104), 15 states have internal predecessors, (104), 10 states have call successors, (42), 7 states have call predecessors, (42), 5 states have return successors, (33), 6 states have call predecessors, (33), 8 states have call successors, (33) [2021-12-18 00:41:00,393 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 632 transitions. [2021-12-18 00:41:00,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2021-12-18 00:41:00,395 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:41:00,396 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 00:41:00,426 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-12-18 00:41:00,623 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 00:41:00,623 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:41:00,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:41:00,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1434896197, now seen corresponding path program 1 times [2021-12-18 00:41:00,624 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:41:00,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549079235] [2021-12-18 00:41:00,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:41:00,624 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:41:00,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:00,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:41:00,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:01,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-18 00:41:01,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:01,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 00:41:01,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:01,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-18 00:41:01,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:01,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-18 00:41:01,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:01,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:41:01,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:01,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:41:01,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:01,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 00:41:01,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:01,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-12-18 00:41:01,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:01,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-18 00:41:01,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:01,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:41:01,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:01,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-12-18 00:41:01,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:01,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-18 00:41:01,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:01,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:41:01,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:01,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-18 00:41:01,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:01,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-12-18 00:41:01,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:01,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-12-18 00:41:01,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:01,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2021-12-18 00:41:01,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:01,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-12-18 00:41:01,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:01,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2021-12-18 00:41:01,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:01,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-18 00:41:01,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:01,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:41:01,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:01,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:41:01,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:01,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-18 00:41:01,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:01,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2021-12-18 00:41:01,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:01,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2021-12-18 00:41:01,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:01,286 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2021-12-18 00:41:01,286 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:41:01,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549079235] [2021-12-18 00:41:01,286 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549079235] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 00:41:01,286 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 00:41:01,286 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-12-18 00:41:01,287 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289091795] [2021-12-18 00:41:01,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 00:41:01,288 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-18 00:41:01,288 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:41:01,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-18 00:41:01,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2021-12-18 00:41:01,289 INFO L87 Difference]: Start difference. First operand 473 states and 632 transitions. Second operand has 15 states, 15 states have (on average 5.4) internal successors, (81), 9 states have internal predecessors, (81), 6 states have call successors, (31), 8 states have call predecessors, (31), 2 states have return successors, (25), 4 states have call predecessors, (25), 3 states have call successors, (25) [2021-12-18 00:41:04,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:41:04,393 INFO L93 Difference]: Finished difference Result 1059 states and 1490 transitions. [2021-12-18 00:41:04,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-18 00:41:04,393 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.4) internal successors, (81), 9 states have internal predecessors, (81), 6 states have call successors, (31), 8 states have call predecessors, (31), 2 states have return successors, (25), 4 states have call predecessors, (25), 3 states have call successors, (25) Word has length 178 [2021-12-18 00:41:04,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:41:04,398 INFO L225 Difference]: With dead ends: 1059 [2021-12-18 00:41:04,398 INFO L226 Difference]: Without dead ends: 738 [2021-12-18 00:41:04,399 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=140, Invalid=672, Unknown=0, NotChecked=0, Total=812 [2021-12-18 00:41:04,400 INFO L933 BasicCegarLoop]: 479 mSDtfsCounter, 430 mSDsluCounter, 3918 mSDsCounter, 0 mSdLazyCounter, 2861 mSolverCounterSat, 193 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 482 SdHoareTripleChecker+Valid, 4397 SdHoareTripleChecker+Invalid, 3054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 193 IncrementalHoareTripleChecker+Valid, 2861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2021-12-18 00:41:04,400 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [482 Valid, 4397 Invalid, 3054 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [193 Valid, 2861 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2021-12-18 00:41:04,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2021-12-18 00:41:04,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 494. [2021-12-18 00:41:04,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 327 states have (on average 1.2324159021406729) internal successors, (403), 332 states have internal predecessors, (403), 121 states have call successors, (121), 40 states have call predecessors, (121), 45 states have return successors, (138), 121 states have call predecessors, (138), 119 states have call successors, (138) [2021-12-18 00:41:04,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 662 transitions. [2021-12-18 00:41:04,429 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 662 transitions. Word has length 178 [2021-12-18 00:41:04,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:41:04,429 INFO L470 AbstractCegarLoop]: Abstraction has 494 states and 662 transitions. [2021-12-18 00:41:04,430 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.4) internal successors, (81), 9 states have internal predecessors, (81), 6 states have call successors, (31), 8 states have call predecessors, (31), 2 states have return successors, (25), 4 states have call predecessors, (25), 3 states have call successors, (25) [2021-12-18 00:41:04,430 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 662 transitions. [2021-12-18 00:41:04,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2021-12-18 00:41:04,431 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:41:04,432 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 00:41:04,432 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-18 00:41:04,432 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:41:04,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:41:04,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1914549499, now seen corresponding path program 1 times [2021-12-18 00:41:04,433 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:41:04,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108629840] [2021-12-18 00:41:04,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:41:04,433 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:41:04,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:04,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:41:04,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:04,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-18 00:41:04,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:04,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 00:41:04,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:04,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-18 00:41:04,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:04,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-18 00:41:04,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:04,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:41:04,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:04,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:41:04,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:04,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 00:41:04,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:04,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-12-18 00:41:04,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:04,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-18 00:41:04,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:04,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:41:04,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:04,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-12-18 00:41:04,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:04,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-18 00:41:04,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:04,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:41:04,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:04,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-18 00:41:04,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:04,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-12-18 00:41:04,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:04,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-12-18 00:41:04,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:04,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2021-12-18 00:41:04,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:04,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-12-18 00:41:04,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:04,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2021-12-18 00:41:04,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:04,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-12-18 00:41:04,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:04,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:41:04,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:04,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:41:04,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:04,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:41:04,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:04,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-18 00:41:04,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:04,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-18 00:41:04,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:04,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2021-12-18 00:41:04,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:04,792 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2021-12-18 00:41:04,793 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:41:04,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108629840] [2021-12-18 00:41:04,793 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108629840] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 00:41:04,793 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 00:41:04,793 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-18 00:41:04,793 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380696110] [2021-12-18 00:41:04,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 00:41:04,794 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-18 00:41:04,794 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:41:04,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-18 00:41:04,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-12-18 00:41:04,795 INFO L87 Difference]: Start difference. First operand 494 states and 662 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (27), 6 states have call predecessors, (27), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2021-12-18 00:41:07,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:41:07,922 INFO L93 Difference]: Finished difference Result 908 states and 1252 transitions. [2021-12-18 00:41:07,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-18 00:41:07,922 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (27), 6 states have call predecessors, (27), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 174 [2021-12-18 00:41:07,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:41:07,925 INFO L225 Difference]: With dead ends: 908 [2021-12-18 00:41:07,925 INFO L226 Difference]: Without dead ends: 630 [2021-12-18 00:41:07,926 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-12-18 00:41:07,927 INFO L933 BasicCegarLoop]: 443 mSDtfsCounter, 283 mSDsluCounter, 784 mSDsCounter, 0 mSdLazyCounter, 933 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 1227 SdHoareTripleChecker+Invalid, 1095 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 933 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2021-12-18 00:41:07,927 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [336 Valid, 1227 Invalid, 1095 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 933 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2021-12-18 00:41:07,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2021-12-18 00:41:07,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 496. [2021-12-18 00:41:07,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 329 states have (on average 1.2310030395136777) internal successors, (405), 334 states have internal predecessors, (405), 121 states have call successors, (121), 40 states have call predecessors, (121), 45 states have return successors, (138), 121 states have call predecessors, (138), 119 states have call successors, (138) [2021-12-18 00:41:07,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 664 transitions. [2021-12-18 00:41:07,950 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 664 transitions. Word has length 174 [2021-12-18 00:41:07,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:41:07,951 INFO L470 AbstractCegarLoop]: Abstraction has 496 states and 664 transitions. [2021-12-18 00:41:07,951 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (27), 6 states have call predecessors, (27), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2021-12-18 00:41:07,951 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 664 transitions. [2021-12-18 00:41:07,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2021-12-18 00:41:07,953 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:41:07,953 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 5, 5, 4, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 00:41:07,953 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-18 00:41:07,953 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:41:07,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:41:07,954 INFO L85 PathProgramCache]: Analyzing trace with hash -167187636, now seen corresponding path program 1 times [2021-12-18 00:41:07,954 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:41:07,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734475851] [2021-12-18 00:41:07,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:41:07,954 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:41:08,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:08,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:41:08,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:08,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-18 00:41:08,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:08,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 00:41:08,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:08,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-18 00:41:08,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:08,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-18 00:41:08,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:08,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:41:08,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:08,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:41:08,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:08,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 00:41:08,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:08,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-12-18 00:41:08,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:08,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-18 00:41:08,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:08,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:41:08,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:08,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-12-18 00:41:08,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:08,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-18 00:41:08,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:08,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:41:08,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:08,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-18 00:41:08,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:08,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-12-18 00:41:08,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:08,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-12-18 00:41:08,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:08,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2021-12-18 00:41:08,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:08,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-12-18 00:41:08,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:08,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2021-12-18 00:41:08,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:08,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-18 00:41:08,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:08,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:41:08,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:08,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:41:08,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:08,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-18 00:41:08,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:08,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2021-12-18 00:41:08,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:08,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:41:08,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:08,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2021-12-18 00:41:08,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:08,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2021-12-18 00:41:08,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:08,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2021-12-18 00:41:08,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:08,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:41:08,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:08,929 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2021-12-18 00:41:08,930 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:41:08,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734475851] [2021-12-18 00:41:08,930 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734475851] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 00:41:08,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [578175229] [2021-12-18 00:41:08,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:41:08,930 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 00:41:08,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 00:41:08,936 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-12-18 00:41:08,937 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-12-18 00:41:09,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:09,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 2844 conjuncts, 91 conjunts are in the unsatisfiable core [2021-12-18 00:41:09,675 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 00:41:10,005 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2021-12-18 00:41:10,005 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 00:41:10,006 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [578175229] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 00:41:10,006 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-18 00:41:10,006 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 12 [2021-12-18 00:41:10,006 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111561624] [2021-12-18 00:41:10,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 00:41:10,007 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-18 00:41:10,007 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:41:10,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-18 00:41:10,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-12-18 00:41:10,008 INFO L87 Difference]: Start difference. First operand 496 states and 664 transitions. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 4 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (27), 4 states have call predecessors, (27), 4 states have call successors, (27) [2021-12-18 00:41:10,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:41:10,199 INFO L93 Difference]: Finished difference Result 985 states and 1317 transitions. [2021-12-18 00:41:10,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 00:41:10,200 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 4 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (27), 4 states have call predecessors, (27), 4 states have call successors, (27) Word has length 188 [2021-12-18 00:41:10,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:41:10,203 INFO L225 Difference]: With dead ends: 985 [2021-12-18 00:41:10,203 INFO L226 Difference]: Without dead ends: 498 [2021-12-18 00:41:10,205 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 241 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-12-18 00:41:10,205 INFO L933 BasicCegarLoop]: 418 mSDtfsCounter, 30 mSDsluCounter, 1994 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 2412 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 00:41:10,205 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 2412 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 00:41:10,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2021-12-18 00:41:10,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 498. [2021-12-18 00:41:10,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 330 states have (on average 1.2303030303030302) internal successors, (406), 336 states have internal predecessors, (406), 121 states have call successors, (121), 40 states have call predecessors, (121), 46 states have return successors, (139), 121 states have call predecessors, (139), 119 states have call successors, (139) [2021-12-18 00:41:10,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 666 transitions. [2021-12-18 00:41:10,227 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 666 transitions. Word has length 188 [2021-12-18 00:41:10,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:41:10,228 INFO L470 AbstractCegarLoop]: Abstraction has 498 states and 666 transitions. [2021-12-18 00:41:10,228 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 4 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (27), 4 states have call predecessors, (27), 4 states have call successors, (27) [2021-12-18 00:41:10,228 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 666 transitions. [2021-12-18 00:41:10,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2021-12-18 00:41:10,230 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:41:10,230 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 5, 5, 4, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 00:41:10,261 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2021-12-18 00:41:10,452 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,SelfDestructingSolverStorable16 [2021-12-18 00:41:10,452 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:41:10,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:41:10,453 INFO L85 PathProgramCache]: Analyzing trace with hash 464786715, now seen corresponding path program 1 times [2021-12-18 00:41:10,453 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:41:10,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361550429] [2021-12-18 00:41:10,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:41:10,453 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:41:10,501 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-18 00:41:10,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [157230398] [2021-12-18 00:41:10,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:41:10,502 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 00:41:10,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 00:41:10,503 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-12-18 00:41:10,532 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-12-18 00:41:30,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:30,279 INFO L263 TraceCheckSpWp]: Trace formula consists of 2949 conjuncts, 271 conjunts are in the unsatisfiable core [2021-12-18 00:41:30,288 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 00:41:30,316 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-18 00:41:30,788 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-18 00:41:30,788 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-18 00:41:30,836 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-18 00:41:31,003 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 13 treesize of output 9 [2021-12-18 00:41:31,191 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 17 treesize of output 9 [2021-12-18 00:41:31,381 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 13 treesize of output 9 [2021-12-18 00:41:31,840 INFO L354 Elim1Store]: treesize reduction 183, result has 22.1 percent of original size [2021-12-18 00:41:31,840 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 74 treesize of output 105 [2021-12-18 00:41:32,682 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2021-12-18 00:41:32,782 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-18 00:41:33,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:41:33,109 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-18 00:41:33,109 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 26 [2021-12-18 00:41:33,312 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 119 proven. 15 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2021-12-18 00:41:33,312 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 00:41:33,722 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:41:33,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361550429] [2021-12-18 00:41:33,722 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-18 00:41:33,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [157230398] [2021-12-18 00:41:33,722 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [157230398] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 00:41:33,722 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-12-18 00:41:33,723 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2021-12-18 00:41:33,723 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248644529] [2021-12-18 00:41:33,723 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-12-18 00:41:33,723 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-12-18 00:41:33,724 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:41:33,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-12-18 00:41:33,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1159, Unknown=0, NotChecked=0, Total=1260 [2021-12-18 00:41:33,725 INFO L87 Difference]: Start difference. First operand 498 states and 666 transitions. Second operand has 32 states, 25 states have (on average 3.8) internal successors, (95), 25 states have internal predecessors, (95), 11 states have call successors, (32), 5 states have call predecessors, (32), 10 states have return successors, (28), 10 states have call predecessors, (28), 11 states have call successors, (28) [2021-12-18 00:41:36,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:41:36,899 INFO L93 Difference]: Finished difference Result 1010 states and 1344 transitions. [2021-12-18 00:41:36,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-12-18 00:41:36,900 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 25 states have (on average 3.8) internal successors, (95), 25 states have internal predecessors, (95), 11 states have call successors, (32), 5 states have call predecessors, (32), 10 states have return successors, (28), 10 states have call predecessors, (28), 11 states have call successors, (28) Word has length 194 [2021-12-18 00:41:36,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:41:36,902 INFO L225 Difference]: With dead ends: 1010 [2021-12-18 00:41:36,902 INFO L226 Difference]: Without dead ends: 522 [2021-12-18 00:41:36,904 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 251 SyntacticMatches, 5 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 512 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=157, Invalid=1823, Unknown=0, NotChecked=0, Total=1980 [2021-12-18 00:41:36,905 INFO L933 BasicCegarLoop]: 376 mSDtfsCounter, 145 mSDsluCounter, 2457 mSDsCounter, 0 mSdLazyCounter, 2226 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 2833 SdHoareTripleChecker+Invalid, 4964 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 2226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2652 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2021-12-18 00:41:36,905 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [178 Valid, 2833 Invalid, 4964 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 2226 Invalid, 0 Unknown, 2652 Unchecked, 2.8s Time] [2021-12-18 00:41:36,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2021-12-18 00:41:36,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 514. [2021-12-18 00:41:36,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 514 states, 341 states have (on average 1.2258064516129032) internal successors, (418), 348 states have internal predecessors, (418), 122 states have call successors, (122), 43 states have call predecessors, (122), 50 states have return successors, (144), 122 states have call predecessors, (144), 120 states have call successors, (144) [2021-12-18 00:41:36,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 684 transitions. [2021-12-18 00:41:36,928 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 684 transitions. Word has length 194 [2021-12-18 00:41:36,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:41:36,928 INFO L470 AbstractCegarLoop]: Abstraction has 514 states and 684 transitions. [2021-12-18 00:41:36,929 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 25 states have (on average 3.8) internal successors, (95), 25 states have internal predecessors, (95), 11 states have call successors, (32), 5 states have call predecessors, (32), 10 states have return successors, (28), 10 states have call predecessors, (28), 11 states have call successors, (28) [2021-12-18 00:41:36,929 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 684 transitions. [2021-12-18 00:41:36,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2021-12-18 00:41:36,930 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:41:36,931 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 5, 5, 4, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 00:41:36,985 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-12-18 00:41:37,147 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,SelfDestructingSolverStorable17 [2021-12-18 00:41:37,148 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:41:37,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:41:37,148 INFO L85 PathProgramCache]: Analyzing trace with hash 554039209, now seen corresponding path program 1 times [2021-12-18 00:41:37,148 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:41:37,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284304192] [2021-12-18 00:41:37,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:41:37,149 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:41:37,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:37,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:41:37,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:37,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-18 00:41:37,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:37,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 00:41:37,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:37,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-18 00:41:37,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:37,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-18 00:41:37,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:37,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:41:37,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:37,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:41:37,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:37,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 00:41:37,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:37,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-18 00:41:37,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:37,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:41:37,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:37,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-12-18 00:41:37,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:37,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-12-18 00:41:37,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:37,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:41:37,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:37,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2021-12-18 00:41:37,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:37,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-18 00:41:37,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:37,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:41:37,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:37,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2021-12-18 00:41:37,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:37,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2021-12-18 00:41:37,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:37,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-18 00:41:37,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:37,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-12-18 00:41:37,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:37,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-18 00:41:37,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:37,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2021-12-18 00:41:37,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:37,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2021-12-18 00:41:37,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:37,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:41:37,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:37,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:41:37,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:37,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-18 00:41:37,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:37,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2021-12-18 00:41:37,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:37,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:41:37,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:37,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2021-12-18 00:41:37,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:37,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2021-12-18 00:41:37,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:37,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2021-12-18 00:41:37,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:37,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:41:37,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:37,628 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2021-12-18 00:41:37,628 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:41:37,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284304192] [2021-12-18 00:41:37,629 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284304192] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 00:41:37,629 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 00:41:37,629 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-18 00:41:37,629 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061558444] [2021-12-18 00:41:37,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 00:41:37,630 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-18 00:41:37,630 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:41:37,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-18 00:41:37,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-12-18 00:41:37,631 INFO L87 Difference]: Start difference. First operand 514 states and 684 transitions. Second operand has 10 states, 10 states have (on average 8.3) internal successors, (83), 6 states have internal predecessors, (83), 2 states have call successors, (33), 5 states have call predecessors, (33), 4 states have return successors, (29), 4 states have call predecessors, (29), 2 states have call successors, (29) [2021-12-18 00:41:39,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:41:39,406 INFO L93 Difference]: Finished difference Result 1110 states and 1513 transitions. [2021-12-18 00:41:39,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-18 00:41:39,407 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 6 states have internal predecessors, (83), 2 states have call successors, (33), 5 states have call predecessors, (33), 4 states have return successors, (29), 4 states have call predecessors, (29), 2 states have call successors, (29) Word has length 200 [2021-12-18 00:41:39,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:41:39,410 INFO L225 Difference]: With dead ends: 1110 [2021-12-18 00:41:39,410 INFO L226 Difference]: Without dead ends: 615 [2021-12-18 00:41:39,412 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-12-18 00:41:39,412 INFO L933 BasicCegarLoop]: 422 mSDtfsCounter, 464 mSDsluCounter, 1731 mSDsCounter, 0 mSdLazyCounter, 1357 mSolverCounterSat, 366 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 512 SdHoareTripleChecker+Valid, 2153 SdHoareTripleChecker+Invalid, 1723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 366 IncrementalHoareTripleChecker+Valid, 1357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2021-12-18 00:41:39,412 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [512 Valid, 2153 Invalid, 1723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [366 Valid, 1357 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2021-12-18 00:41:39,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2021-12-18 00:41:39,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 513. [2021-12-18 00:41:39,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 341 states have (on average 1.2228739002932552) internal successors, (417), 347 states have internal predecessors, (417), 121 states have call successors, (121), 43 states have call predecessors, (121), 50 states have return successors, (142), 122 states have call predecessors, (142), 119 states have call successors, (142) [2021-12-18 00:41:39,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 680 transitions. [2021-12-18 00:41:39,435 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 680 transitions. Word has length 200 [2021-12-18 00:41:39,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:41:39,436 INFO L470 AbstractCegarLoop]: Abstraction has 513 states and 680 transitions. [2021-12-18 00:41:39,436 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 6 states have internal predecessors, (83), 2 states have call successors, (33), 5 states have call predecessors, (33), 4 states have return successors, (29), 4 states have call predecessors, (29), 2 states have call successors, (29) [2021-12-18 00:41:39,436 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 680 transitions. [2021-12-18 00:41:39,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2021-12-18 00:41:39,438 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:41:39,438 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 5, 5, 4, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 00:41:39,438 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-18 00:41:39,438 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:41:39,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:41:39,439 INFO L85 PathProgramCache]: Analyzing trace with hash -769130113, now seen corresponding path program 1 times [2021-12-18 00:41:39,439 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:41:39,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170403907] [2021-12-18 00:41:39,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:41:39,439 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:41:39,487 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-18 00:41:39,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [744002041] [2021-12-18 00:41:39,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:41:39,488 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 00:41:39,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 00:41:39,492 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 00:41:39,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-18 00:41:40,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:41:40,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 2953 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-18 00:41:40,123 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 00:41:40,400 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2021-12-18 00:41:40,400 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 00:41:40,400 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:41:40,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170403907] [2021-12-18 00:41:40,400 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-18 00:41:40,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [744002041] [2021-12-18 00:41:40,401 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [744002041] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 00:41:40,401 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 00:41:40,401 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-18 00:41:40,401 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239832066] [2021-12-18 00:41:40,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 00:41:40,401 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-18 00:41:40,401 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:41:40,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-18 00:41:40,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-18 00:41:40,402 INFO L87 Difference]: Start difference. First operand 513 states and 680 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 6 states have internal predecessors, (90), 2 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (29), 4 states have call predecessors, (29), 2 states have call successors, (29) [2021-12-18 00:41:40,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:41:40,433 INFO L93 Difference]: Finished difference Result 558 states and 729 transitions. [2021-12-18 00:41:40,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 00:41:40,433 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 6 states have internal predecessors, (90), 2 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (29), 4 states have call predecessors, (29), 2 states have call successors, (29) Word has length 200 [2021-12-18 00:41:40,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:41:40,434 INFO L225 Difference]: With dead ends: 558 [2021-12-18 00:41:40,434 INFO L226 Difference]: Without dead ends: 0 [2021-12-18 00:41:40,435 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-18 00:41:40,436 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 2 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 00:41:40,436 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 346 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 00:41:40,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-12-18 00:41:40,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-12-18 00:41:40,437 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-12-18 00:41:40,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-12-18 00:41:40,437 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 200 [2021-12-18 00:41:40,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:41:40,438 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-18 00:41:40,438 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 6 states have internal predecessors, (90), 2 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (29), 4 states have call predecessors, (29), 2 states have call successors, (29) [2021-12-18 00:41:40,438 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-12-18 00:41:40,438 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-12-18 00:41:40,440 INFO L764 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-18 00:41:40,473 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2021-12-18 00:41:40,667 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 00:41:40,669 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-12-18 00:41:41,604 INFO L861 garLoopResultBuilder]: At program point L7342(line 7342) the Hoare annotation is: true [2021-12-18 00:41:41,605 INFO L858 garLoopResultBuilder]: For program point uninterpreted_equalsFINAL(lines 7331 7345) no Hoare annotation was computed. [2021-12-18 00:41:41,605 INFO L858 garLoopResultBuilder]: For program point L7339-1(line 7339) no Hoare annotation was computed. [2021-12-18 00:41:41,605 INFO L861 garLoopResultBuilder]: At program point L7339(line 7339) the Hoare annotation is: true [2021-12-18 00:41:41,605 INFO L858 garLoopResultBuilder]: For program point L7342-3(line 7342) no Hoare annotation was computed. [2021-12-18 00:41:41,605 INFO L858 garLoopResultBuilder]: For program point L7341-2(lines 7341 7343) no Hoare annotation was computed. [2021-12-18 00:41:41,605 INFO L861 garLoopResultBuilder]: At program point L7342-2(line 7342) the Hoare annotation is: true [2021-12-18 00:41:41,605 INFO L858 garLoopResultBuilder]: For program point L7341(lines 7341 7343) no Hoare annotation was computed. [2021-12-18 00:41:41,605 INFO L861 garLoopResultBuilder]: At program point L7342-1(line 7342) the Hoare annotation is: true [2021-12-18 00:41:41,606 INFO L858 garLoopResultBuilder]: For program point uninterpreted_equalsEXIT(lines 7331 7345) no Hoare annotation was computed. [2021-12-18 00:41:41,606 INFO L858 garLoopResultBuilder]: For program point L7335-1(line 7335) no Hoare annotation was computed. [2021-12-18 00:41:41,606 INFO L861 garLoopResultBuilder]: At program point L7335(line 7335) the Hoare annotation is: true [2021-12-18 00:41:41,606 INFO L861 garLoopResultBuilder]: At program point L7337-1(line 7337) the Hoare annotation is: true [2021-12-18 00:41:41,606 INFO L861 garLoopResultBuilder]: At program point uninterpreted_equalsENTRY(lines 7331 7345) the Hoare annotation is: true [2021-12-18 00:41:41,606 INFO L861 garLoopResultBuilder]: At program point L7337(line 7337) the Hoare annotation is: true [2021-12-18 00:41:41,606 INFO L858 garLoopResultBuilder]: For program point L6944-1(lines 6944 6946) no Hoare annotation was computed. [2021-12-18 00:41:41,606 INFO L854 garLoopResultBuilder]: At program point L6944(lines 6944 6946) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= bounded_malloc_~size |bounded_malloc_#in~size|)) [2021-12-18 00:41:41,606 INFO L854 garLoopResultBuilder]: At program point bounded_mallocENTRY(lines 6943 6948) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|)) [2021-12-18 00:41:41,607 INFO L858 garLoopResultBuilder]: For program point bounded_mallocFINAL(lines 6943 6948) no Hoare annotation was computed. [2021-12-18 00:41:41,607 INFO L858 garLoopResultBuilder]: For program point bounded_mallocEXIT(lines 6943 6948) no Hoare annotation was computed. [2021-12-18 00:41:41,607 INFO L861 garLoopResultBuilder]: At program point __CPROVER_uninterpreted_equalsENTRY(line 239) the Hoare annotation is: true [2021-12-18 00:41:41,607 INFO L858 garLoopResultBuilder]: For program point __CPROVER_uninterpreted_equalsFINAL(line 239) no Hoare annotation was computed. [2021-12-18 00:41:41,607 INFO L858 garLoopResultBuilder]: For program point __CPROVER_uninterpreted_equalsEXIT(line 239) no Hoare annotation was computed. [2021-12-18 00:41:41,607 INFO L858 garLoopResultBuilder]: For program point __CPROVER_uninterpreted_hasherEXIT(line 238) no Hoare annotation was computed. [2021-12-18 00:41:41,607 INFO L861 garLoopResultBuilder]: At program point __CPROVER_uninterpreted_hasherENTRY(line 238) the Hoare annotation is: true [2021-12-18 00:41:41,607 INFO L858 garLoopResultBuilder]: For program point __CPROVER_uninterpreted_hasherFINAL(line 238) no Hoare annotation was computed. [2021-12-18 00:41:41,608 INFO L858 garLoopResultBuilder]: For program point L10008-3(line 10008) no Hoare annotation was computed. [2021-12-18 00:41:41,608 INFO L861 garLoopResultBuilder]: At program point L10008-4(line 10008) the Hoare annotation is: true [2021-12-18 00:41:41,608 INFO L858 garLoopResultBuilder]: For program point L10008-5(line 10008) no Hoare annotation was computed. [2021-12-18 00:41:41,608 INFO L861 garLoopResultBuilder]: At program point aws_hash_table_is_validENTRY(lines 10006 10009) the Hoare annotation is: true [2021-12-18 00:41:41,608 INFO L858 garLoopResultBuilder]: For program point L10008(line 10008) no Hoare annotation was computed. [2021-12-18 00:41:41,608 INFO L858 garLoopResultBuilder]: For program point L10008-2(line 10008) no Hoare annotation was computed. [2021-12-18 00:41:41,608 INFO L858 garLoopResultBuilder]: For program point L10008-7(line 10008) no Hoare annotation was computed. [2021-12-18 00:41:41,608 INFO L858 garLoopResultBuilder]: For program point aws_hash_table_is_validEXIT(lines 10006 10009) no Hoare annotation was computed. [2021-12-18 00:41:41,608 INFO L858 garLoopResultBuilder]: For program point aws_hash_table_is_validFINAL(lines 10006 10009) no Hoare annotation was computed. [2021-12-18 00:41:41,608 INFO L858 garLoopResultBuilder]: For program point nondet_boolFINAL(line 261) no Hoare annotation was computed. [2021-12-18 00:41:41,608 INFO L858 garLoopResultBuilder]: For program point nondet_boolEXIT(line 261) no Hoare annotation was computed. [2021-12-18 00:41:41,608 INFO L861 garLoopResultBuilder]: At program point nondet_boolENTRY(line 261) the Hoare annotation is: true [2021-12-18 00:41:41,608 INFO L858 garLoopResultBuilder]: For program point L7130(lines 7130 7134) no Hoare annotation was computed. [2021-12-18 00:41:41,608 INFO L858 garLoopResultBuilder]: For program point aws_mem_releaseEXIT(lines 7122 7135) no Hoare annotation was computed. [2021-12-18 00:41:41,608 INFO L861 garLoopResultBuilder]: At program point L7126(lines 7126 7128) the Hoare annotation is: true [2021-12-18 00:41:41,608 INFO L861 garLoopResultBuilder]: At program point aws_mem_releaseENTRY(lines 7122 7135) the Hoare annotation is: true [2021-12-18 00:41:41,608 INFO L858 garLoopResultBuilder]: For program point L7130-2(lines 7122 7135) no Hoare annotation was computed. [2021-12-18 00:41:41,609 INFO L858 garLoopResultBuilder]: For program point L7123-1(lines 7123 7125) no Hoare annotation was computed. [2021-12-18 00:41:41,609 INFO L861 garLoopResultBuilder]: At program point L7123(lines 7123 7125) the Hoare annotation is: true [2021-12-18 00:41:41,609 INFO L858 garLoopResultBuilder]: For program point L7126-1(lines 7126 7128) no Hoare annotation was computed. [2021-12-18 00:41:41,609 INFO L854 garLoopResultBuilder]: At program point hash_table_state_required_bytesENTRY(lines 10119 10131) the Hoare annotation is: (and (= |#memory_int| |old(#memory_int)|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |#memory_real| |old(#memory_real)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2021-12-18 00:41:41,609 INFO L858 garLoopResultBuilder]: For program point hash_table_state_required_bytesEXIT(lines 10119 10131) no Hoare annotation was computed. [2021-12-18 00:41:41,609 INFO L858 garLoopResultBuilder]: For program point L10126-1(line 10126) no Hoare annotation was computed. [2021-12-18 00:41:41,609 INFO L858 garLoopResultBuilder]: For program point L10126-2(lines 10126 10128) no Hoare annotation was computed. [2021-12-18 00:41:41,609 INFO L854 garLoopResultBuilder]: At program point L10122(line 10122) the Hoare annotation is: (and (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |#memory_int| |old(#memory_int)|) (= hash_table_state_required_bytes_~required_bytes.offset |hash_table_state_required_bytes_#in~required_bytes.offset|) (= 0 |hash_table_state_required_bytes_~#elemsize~0.offset|) (= |#memory_real| |old(#memory_real)|) (= hash_table_state_required_bytes_~required_bytes.base |hash_table_state_required_bytes_#in~required_bytes.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= 0 (select |old(#valid)| |hash_table_state_required_bytes_~#elemsize~0.base|)) (= |#valid| (store |old(#valid)| |hash_table_state_required_bytes_~#elemsize~0.base| 1)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= hash_table_state_required_bytes_~size |hash_table_state_required_bytes_#in~size|)) [2021-12-18 00:41:41,609 INFO L854 garLoopResultBuilder]: At program point L10126(line 10126) the Hoare annotation is: (and (= hash_table_state_required_bytes_~required_bytes.offset |hash_table_state_required_bytes_#in~required_bytes.offset|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (exists ((|v___CPROVER_overflow_mult_~#c~1.base_83| Int) (v_ArrVal_3189 Int)) (let ((.cse0 (store |old(#valid)| |hash_table_state_required_bytes_~#elemsize~0.base| 1))) (and (= 0 (select .cse0 |v___CPROVER_overflow_mult_~#c~1.base_83|)) (= |#valid| (store .cse0 |v___CPROVER_overflow_mult_~#c~1.base_83| v_ArrVal_3189))))) (= hash_table_state_required_bytes_~required_bytes.base |hash_table_state_required_bytes_#in~required_bytes.base|) (= |hash_table_state_required_bytes_#t~mem1324| (* 24 |hash_table_state_required_bytes_#in~size|)) (= 0 (select |old(#valid)| |hash_table_state_required_bytes_~#elemsize~0.base|))) [2021-12-18 00:41:41,609 INFO L858 garLoopResultBuilder]: For program point hash_table_state_required_bytesFINAL(lines 10119 10131) no Hoare annotation was computed. [2021-12-18 00:41:41,609 INFO L858 garLoopResultBuilder]: For program point L10122-1(line 10122) no Hoare annotation was computed. [2021-12-18 00:41:41,609 INFO L858 garLoopResultBuilder]: For program point L10122-2(lines 10122 10124) no Hoare annotation was computed. [2021-12-18 00:41:41,610 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-12-18 00:41:41,610 INFO L861 garLoopResultBuilder]: At program point L6940(lines 6934 6941) the Hoare annotation is: true [2021-12-18 00:41:41,610 INFO L861 garLoopResultBuilder]: At program point L6936-2(line 6936) the Hoare annotation is: true [2021-12-18 00:41:41,610 INFO L858 garLoopResultBuilder]: For program point L6936-1(line 6936) no Hoare annotation was computed. [2021-12-18 00:41:41,610 INFO L861 garLoopResultBuilder]: At program point L6936(line 6936) the Hoare annotation is: true [2021-12-18 00:41:41,610 INFO L858 garLoopResultBuilder]: For program point L6937-1(lines 6937 6939) no Hoare annotation was computed. [2021-12-18 00:41:41,610 INFO L861 garLoopResultBuilder]: At program point L6937(lines 6937 6939) the Hoare annotation is: true [2021-12-18 00:41:41,610 INFO L858 garLoopResultBuilder]: For program point L6936-3(line 6936) no Hoare annotation was computed. [2021-12-18 00:41:41,610 INFO L858 garLoopResultBuilder]: For program point can_fail_callocEXIT(lines 6954 6958) no Hoare annotation was computed. [2021-12-18 00:41:41,610 INFO L858 garLoopResultBuilder]: For program point L6955-1(lines 6955 6957) no Hoare annotation was computed. [2021-12-18 00:41:41,611 INFO L861 garLoopResultBuilder]: At program point can_fail_callocENTRY(lines 6954 6958) the Hoare annotation is: true [2021-12-18 00:41:41,611 INFO L861 garLoopResultBuilder]: At program point L6955(line 6955) the Hoare annotation is: true [2021-12-18 00:41:41,611 INFO L858 garLoopResultBuilder]: For program point can_fail_callocFINAL(lines 6954 6958) no Hoare annotation was computed. [2021-12-18 00:41:41,611 INFO L858 garLoopResultBuilder]: For program point L6955-3(lines 6955 6957) no Hoare annotation was computed. [2021-12-18 00:41:41,611 INFO L861 garLoopResultBuilder]: At program point L2657(lines 2637 2658) the Hoare annotation is: true [2021-12-18 00:41:41,611 INFO L858 garLoopResultBuilder]: For program point L9210(lines 9210 9212) no Hoare annotation was computed. [2021-12-18 00:41:41,611 INFO L858 garLoopResultBuilder]: For program point L9202(lines 9202 9204) no Hoare annotation was computed. [2021-12-18 00:41:41,612 INFO L858 garLoopResultBuilder]: For program point L9210-2(lines 9210 9212) no Hoare annotation was computed. [2021-12-18 00:41:41,612 INFO L858 garLoopResultBuilder]: For program point L2643-1(line 2643) no Hoare annotation was computed. [2021-12-18 00:41:41,612 INFO L861 garLoopResultBuilder]: At program point L2643(line 2643) the Hoare annotation is: true [2021-12-18 00:41:41,612 INFO L858 garLoopResultBuilder]: For program point L9196(lines 9196 9198) no Hoare annotation was computed. [2021-12-18 00:41:41,612 INFO L858 garLoopResultBuilder]: For program point L9196-2(lines 9196 9198) no Hoare annotation was computed. [2021-12-18 00:41:41,612 INFO L858 garLoopResultBuilder]: For program point L2642(lines 2642 2644) no Hoare annotation was computed. [2021-12-18 00:41:41,612 INFO L858 garLoopResultBuilder]: For program point L2638(lines 2638 2641) no Hoare annotation was computed. [2021-12-18 00:41:41,612 INFO L858 garLoopResultBuilder]: For program point s_update_template_sizeEXIT(lines 9193 9218) no Hoare annotation was computed. [2021-12-18 00:41:41,613 INFO L861 garLoopResultBuilder]: At program point s_update_template_sizeENTRY(lines 9193 9218) the Hoare annotation is: true [2021-12-18 00:41:41,613 INFO L858 garLoopResultBuilder]: For program point s_update_template_sizeFINAL(lines 9193 9218) no Hoare annotation was computed. [2021-12-18 00:41:41,613 INFO L858 garLoopResultBuilder]: For program point aws_allocator_is_validFINAL(lines 6984 6987) no Hoare annotation was computed. [2021-12-18 00:41:41,613 INFO L861 garLoopResultBuilder]: At program point L6986(line 6986) the Hoare annotation is: true [2021-12-18 00:41:41,613 INFO L861 garLoopResultBuilder]: At program point aws_allocator_is_validENTRY(lines 6984 6987) the Hoare annotation is: true [2021-12-18 00:41:41,613 INFO L858 garLoopResultBuilder]: For program point L6986-1(line 6986) no Hoare annotation was computed. [2021-12-18 00:41:41,613 INFO L858 garLoopResultBuilder]: For program point aws_allocator_is_validEXIT(lines 6984 6987) no Hoare annotation was computed. [2021-12-18 00:41:41,613 INFO L861 garLoopResultBuilder]: At program point L9150-1(line 9150) the Hoare annotation is: true [2021-12-18 00:41:41,614 INFO L861 garLoopResultBuilder]: At program point s_hash_keys_eqENTRY(lines 9147 9155) the Hoare annotation is: true [2021-12-18 00:41:41,614 INFO L858 garLoopResultBuilder]: For program point L9150-2(line 9150) no Hoare annotation was computed. [2021-12-18 00:41:41,614 INFO L858 garLoopResultBuilder]: For program point s_hash_keys_eqEXIT(lines 9147 9155) no Hoare annotation was computed. [2021-12-18 00:41:41,614 INFO L861 garLoopResultBuilder]: At program point L9153(line 9153) the Hoare annotation is: true [2021-12-18 00:41:41,614 INFO L861 garLoopResultBuilder]: At program point L9154-1(line 9154) the Hoare annotation is: true [2021-12-18 00:41:41,614 INFO L858 garLoopResultBuilder]: For program point L9153-1(line 9153) no Hoare annotation was computed. [2021-12-18 00:41:41,614 INFO L858 garLoopResultBuilder]: For program point L9154-2(line 9154) no Hoare annotation was computed. [2021-12-18 00:41:41,615 INFO L861 garLoopResultBuilder]: At program point L9154-3(line 9154) the Hoare annotation is: true [2021-12-18 00:41:41,615 INFO L861 garLoopResultBuilder]: At program point L9150(line 9150) the Hoare annotation is: true [2021-12-18 00:41:41,615 INFO L858 garLoopResultBuilder]: For program point L9154-4(lines 9147 9155) no Hoare annotation was computed. [2021-12-18 00:41:41,615 INFO L858 garLoopResultBuilder]: For program point aws_mul_size_checkedEXIT(lines 2586 2594) no Hoare annotation was computed. [2021-12-18 00:41:41,615 INFO L858 garLoopResultBuilder]: For program point L2498-1(lines 2498 2499) no Hoare annotation was computed. [2021-12-18 00:41:41,615 INFO L858 garLoopResultBuilder]: For program point aws_mul_size_checkedFINAL(lines 2586 2594) no Hoare annotation was computed. [2021-12-18 00:41:41,615 INFO L854 garLoopResultBuilder]: At program point aws_mul_size_checkedENTRY(lines 2586 2594) the Hoare annotation is: (and (= |#memory_int| |old(#memory_int)|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |#memory_real| |old(#memory_real)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2021-12-18 00:41:41,616 INFO L854 garLoopResultBuilder]: At program point L2501(lines 2497 2502) the Hoare annotation is: (or (and (= |#memory_int| |old(#memory_int)|) (= |#memory_real| |old(#memory_real)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (<= (+ |aws_mul_size_checked_aws_mul_u64_checked_#res#1| 1) 0)) (and (= ~tl_last_error~0 |old(~tl_last_error~0)|) (exists ((|v___CPROVER_overflow_mult_~#c~1.base_83| Int) (v_ArrVal_3189 Int)) (and (= 0 (select |old(#valid)| |v___CPROVER_overflow_mult_~#c~1.base_83|)) (= |#valid| (store |old(#valid)| |v___CPROVER_overflow_mult_~#c~1.base_83| v_ArrVal_3189)))) (= |aws_mul_size_checked_aws_mul_u64_checked_#res#1| 0) (= (select (select |#memory_int| |aws_mul_size_checked_#in~r#1.base|) |aws_mul_size_checked_#in~r#1.offset|) (* |aws_mul_size_checked_#in~a#1| |aws_mul_size_checked_#in~b#1|)))) [2021-12-18 00:41:41,616 INFO L854 garLoopResultBuilder]: At program point L2498(line 2498) the Hoare annotation is: (and (= |#memory_int| |old(#memory_int)|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |aws_mul_size_checked_aws_mul_u64_checked_~b#1| |aws_mul_size_checked_#in~b#1|) (= |#memory_real| |old(#memory_real)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |aws_mul_size_checked_aws_mul_u64_checked_~r#1.base| |aws_mul_size_checked_#in~r#1.base|) (= |aws_mul_size_checked_aws_mul_u64_checked_~a#1| |aws_mul_size_checked_#in~a#1|) (= |aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset| |aws_mul_size_checked_#in~r#1.offset|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2021-12-18 00:41:41,616 INFO L858 garLoopResultBuilder]: For program point L2499-1(line 2499) no Hoare annotation was computed. [2021-12-18 00:41:41,616 INFO L854 garLoopResultBuilder]: At program point L2499(line 2499) the Hoare annotation is: (and (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |#memory_int| |old(#memory_int)|) (= |aws_mul_size_checked_aws_mul_u64_checked_~b#1| |aws_mul_size_checked_#in~b#1|) (= |#memory_real| |old(#memory_real)|) (exists ((|v___CPROVER_overflow_mult_~#c~1.base_83| Int) (v_ArrVal_3189 Int)) (and (= 0 (select |old(#valid)| |v___CPROVER_overflow_mult_~#c~1.base_83|)) (= |#valid| (store |old(#valid)| |v___CPROVER_overflow_mult_~#c~1.base_83| v_ArrVal_3189)))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |aws_mul_size_checked_aws_mul_u64_checked_~r#1.base| |aws_mul_size_checked_#in~r#1.base|) (= |aws_mul_size_checked_aws_mul_u64_checked_~a#1| |aws_mul_size_checked_#in~a#1|) (= |aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset| |aws_mul_size_checked_#in~r#1.offset|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2021-12-18 00:41:41,616 INFO L858 garLoopResultBuilder]: For program point nondet_uint64_tEXIT(line 266) no Hoare annotation was computed. [2021-12-18 00:41:41,616 INFO L861 garLoopResultBuilder]: At program point nondet_uint64_tENTRY(line 266) the Hoare annotation is: true [2021-12-18 00:41:41,616 INFO L858 garLoopResultBuilder]: For program point nondet_uint64_tFINAL(line 266) no Hoare annotation was computed. [2021-12-18 00:41:41,616 INFO L858 garLoopResultBuilder]: For program point L9115(line 9115) no Hoare annotation was computed. [2021-12-18 00:41:41,617 INFO L861 garLoopResultBuilder]: At program point L9115-1(lines 9100 9116) the Hoare annotation is: true [2021-12-18 00:41:41,617 INFO L858 garLoopResultBuilder]: For program point L9115-2(lines 9100 9116) no Hoare annotation was computed. [2021-12-18 00:41:41,617 INFO L861 garLoopResultBuilder]: At program point L9101(line 9101) the Hoare annotation is: true [2021-12-18 00:41:41,617 INFO L861 garLoopResultBuilder]: At program point L9101-1(line 9101) the Hoare annotation is: true [2021-12-18 00:41:41,617 INFO L858 garLoopResultBuilder]: For program point L9101-2(line 9101) no Hoare annotation was computed. [2021-12-18 00:41:41,617 INFO L861 garLoopResultBuilder]: At program point L7373-1(lines 7369 7374) the Hoare annotation is: true [2021-12-18 00:41:41,617 INFO L858 garLoopResultBuilder]: For program point L7373(line 7373) no Hoare annotation was computed. [2021-12-18 00:41:41,618 INFO L858 garLoopResultBuilder]: For program point L9085(lines 9085 9093) no Hoare annotation was computed. [2021-12-18 00:41:41,618 INFO L861 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2021-12-18 00:41:41,618 INFO L858 garLoopResultBuilder]: For program point L9112(lines 9112 9114) no Hoare annotation was computed. [2021-12-18 00:41:41,618 INFO L861 garLoopResultBuilder]: At program point s_hash_forENTRY(lines 9100 9116) the Hoare annotation is: true [2021-12-18 00:41:41,618 INFO L861 garLoopResultBuilder]: At program point L7370(lines 7370 7372) the Hoare annotation is: true [2021-12-18 00:41:41,618 INFO L858 garLoopResultBuilder]: For program point L9104(lines 9104 9109) no Hoare annotation was computed. [2021-12-18 00:41:41,618 INFO L858 garLoopResultBuilder]: For program point s_hash_forEXIT(lines 9100 9116) no Hoare annotation was computed. [2021-12-18 00:41:41,618 INFO L861 garLoopResultBuilder]: At program point L7370-1(lines 7370 7372) the Hoare annotation is: true [2021-12-18 00:41:41,619 INFO L854 garLoopResultBuilder]: At program point __CPROVER_overflow_plusENTRY(lines 248 251) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|)) [2021-12-18 00:41:41,619 INFO L858 garLoopResultBuilder]: For program point __CPROVER_overflow_plusFINAL(lines 248 251) no Hoare annotation was computed. [2021-12-18 00:41:41,619 INFO L858 garLoopResultBuilder]: For program point __CPROVER_overflow_plusEXIT(lines 248 251) no Hoare annotation was computed. [2021-12-18 00:41:41,619 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-12-18 00:41:41,619 INFO L858 garLoopResultBuilder]: For program point L-1-2(line -1) no Hoare annotation was computed. [2021-12-18 00:41:41,619 INFO L861 garLoopResultBuilder]: At program point L7356-1(lines 7348 7357) the Hoare annotation is: true [2021-12-18 00:41:41,619 INFO L858 garLoopResultBuilder]: For program point L7356(line 7356) no Hoare annotation was computed. [2021-12-18 00:41:41,619 INFO L861 garLoopResultBuilder]: At program point L7350(lines 7350 7352) the Hoare annotation is: true [2021-12-18 00:41:41,620 INFO L861 garLoopResultBuilder]: At program point L7287(lines 7280 7288) the Hoare annotation is: true [2021-12-18 00:41:41,620 INFO L861 garLoopResultBuilder]: At program point L7353(lines 7353 7355) the Hoare annotation is: true [2021-12-18 00:41:41,620 INFO L858 garLoopResultBuilder]: For program point ##fun~$Pointer$~X~$Pointer$~TO~intFINAL(line -1) no Hoare annotation was computed. [2021-12-18 00:41:41,620 INFO L858 garLoopResultBuilder]: For program point L7284(lines 7284 7286) no Hoare annotation was computed. [2021-12-18 00:41:41,620 INFO L861 garLoopResultBuilder]: At program point L7350-1(lines 7350 7352) the Hoare annotation is: true [2021-12-18 00:41:41,620 INFO L861 garLoopResultBuilder]: At program point L7281-1(lines 7281 7283) the Hoare annotation is: true [2021-12-18 00:41:41,620 INFO L861 garLoopResultBuilder]: At program point L7281(lines 7281 7283) the Hoare annotation is: true [2021-12-18 00:41:41,621 INFO L858 garLoopResultBuilder]: For program point ##fun~$Pointer$~X~$Pointer$~TO~intEXIT(line -1) no Hoare annotation was computed. [2021-12-18 00:41:41,621 INFO L861 garLoopResultBuilder]: At program point L262(line 262) the Hoare annotation is: true [2021-12-18 00:41:41,621 INFO L861 garLoopResultBuilder]: At program point ##fun~$Pointer$~X~$Pointer$~TO~intENTRY(line -1) the Hoare annotation is: true [2021-12-18 00:41:41,621 INFO L858 garLoopResultBuilder]: For program point aws_hash_table_createEXIT(lines 9516 9580) no Hoare annotation was computed. [2021-12-18 00:41:41,621 INFO L858 garLoopResultBuilder]: For program point L9533(lines 9533 9539) no Hoare annotation was computed. [2021-12-18 00:41:41,621 INFO L858 garLoopResultBuilder]: For program point L9504(lines 9504 9507) no Hoare annotation was computed. [2021-12-18 00:41:41,621 INFO L858 garLoopResultBuilder]: For program point L9546(lines 9546 9561) no Hoare annotation was computed. [2021-12-18 00:41:41,621 INFO L861 garLoopResultBuilder]: At program point L9571(line 9571) the Hoare annotation is: true [2021-12-18 00:41:41,622 INFO L858 garLoopResultBuilder]: For program point L9571-1(line 9571) no Hoare annotation was computed. [2021-12-18 00:41:41,622 INFO L861 garLoopResultBuilder]: At program point L9513(lines 9484 9514) the Hoare annotation is: true [2021-12-18 00:41:41,622 INFO L858 garLoopResultBuilder]: For program point L9546-2(lines 9546 9561) no Hoare annotation was computed. [2021-12-18 00:41:41,622 INFO L858 garLoopResultBuilder]: For program point L9534-2(lines 9534 9536) no Hoare annotation was computed. [2021-12-18 00:41:41,622 INFO L858 garLoopResultBuilder]: For program point L9534(lines 9534 9536) no Hoare annotation was computed. [2021-12-18 00:41:41,622 INFO L861 garLoopResultBuilder]: At program point L9493(line 9493) the Hoare annotation is: true [2021-12-18 00:41:41,622 INFO L858 garLoopResultBuilder]: For program point L9493-1(line 9493) no Hoare annotation was computed. [2021-12-18 00:41:41,622 INFO L858 garLoopResultBuilder]: For program point L9493-2(lines 9493 9495) no Hoare annotation was computed. [2021-12-18 00:41:41,623 INFO L861 garLoopResultBuilder]: At program point L9497(line 9497) the Hoare annotation is: true [2021-12-18 00:41:41,623 INFO L858 garLoopResultBuilder]: For program point L9497-1(line 9497) no Hoare annotation was computed. [2021-12-18 00:41:41,623 INFO L861 garLoopResultBuilder]: At program point L9489(line 9489) the Hoare annotation is: true [2021-12-18 00:41:41,623 INFO L858 garLoopResultBuilder]: For program point L9489-1(line 9489) no Hoare annotation was computed. [2021-12-18 00:41:41,623 INFO L858 garLoopResultBuilder]: For program point L9489-2(lines 9489 9491) no Hoare annotation was computed. [2021-12-18 00:41:41,623 INFO L858 garLoopResultBuilder]: For program point L9543-2(lines 9543 9545) no Hoare annotation was computed. [2021-12-18 00:41:41,623 INFO L861 garLoopResultBuilder]: At program point L9506(line 9506) the Hoare annotation is: true [2021-12-18 00:41:41,623 INFO L861 garLoopResultBuilder]: At program point L9543(line 9543) the Hoare annotation is: true [2021-12-18 00:41:41,624 INFO L858 garLoopResultBuilder]: For program point L9543-1(line 9543) no Hoare annotation was computed. [2021-12-18 00:41:41,624 INFO L858 garLoopResultBuilder]: For program point L9502-1(lines 9502 9508) no Hoare annotation was computed. [2021-12-18 00:41:41,624 INFO L858 garLoopResultBuilder]: For program point L9531(line 9531) no Hoare annotation was computed. [2021-12-18 00:41:41,624 INFO L858 garLoopResultBuilder]: For program point L9502-3(lines 9502 9508) no Hoare annotation was computed. [2021-12-18 00:41:41,624 INFO L858 garLoopResultBuilder]: For program point L9498(lines 9498 9500) no Hoare annotation was computed. [2021-12-18 00:41:41,624 INFO L861 garLoopResultBuilder]: At program point L9502-4(lines 9502 9508) the Hoare annotation is: true [2021-12-18 00:41:41,624 INFO L858 garLoopResultBuilder]: For program point L9506-1(line 9506) no Hoare annotation was computed. [2021-12-18 00:41:41,624 INFO L861 garLoopResultBuilder]: At program point aws_hash_table_createENTRY(lines 9516 9580) the Hoare annotation is: true [2021-12-18 00:41:41,625 INFO L858 garLoopResultBuilder]: For program point aws_hash_table_createFINAL(lines 9516 9580) no Hoare annotation was computed. [2021-12-18 00:41:41,625 INFO L861 garLoopResultBuilder]: At program point L9527-2(lines 9527 9529) the Hoare annotation is: true [2021-12-18 00:41:41,625 INFO L861 garLoopResultBuilder]: At program point L9523(line 9523) the Hoare annotation is: true [2021-12-18 00:41:41,625 INFO L858 garLoopResultBuilder]: For program point L9523-1(line 9523) no Hoare annotation was computed. [2021-12-18 00:41:41,625 INFO L858 garLoopResultBuilder]: For program point L9502-5(lines 9502 9508) no Hoare annotation was computed. [2021-12-18 00:41:41,625 INFO L858 garLoopResultBuilder]: For program point L9527(lines 9527 9529) no Hoare annotation was computed. [2021-12-18 00:41:41,625 INFO L858 garLoopResultBuilder]: For program point L9548(lines 9548 9551) no Hoare annotation was computed. [2021-12-18 00:41:41,626 INFO L858 garLoopResultBuilder]: For program point L9573(lines 9573 9575) no Hoare annotation was computed. [2021-12-18 00:41:41,626 INFO L858 garLoopResultBuilder]: For program point L9573-2(lines 9573 9575) no Hoare annotation was computed. [2021-12-18 00:41:41,626 INFO L861 garLoopResultBuilder]: At program point L9511(line 9511) the Hoare annotation is: true [2021-12-18 00:41:41,626 INFO L858 garLoopResultBuilder]: For program point L9511-1(line 9511) no Hoare annotation was computed. [2021-12-18 00:41:41,626 INFO L861 garLoopResultBuilder]: At program point hash_table_state_is_validENTRY(lines 10017 10064) the Hoare annotation is: true [2021-12-18 00:41:41,626 INFO L861 garLoopResultBuilder]: At program point L10045(line 10045) the Hoare annotation is: true [2021-12-18 00:41:41,626 INFO L858 garLoopResultBuilder]: For program point L10045-1(line 10045) no Hoare annotation was computed. [2021-12-18 00:41:41,626 INFO L858 garLoopResultBuilder]: For program point hash_table_state_is_validEXIT(lines 10017 10064) no Hoare annotation was computed. [2021-12-18 00:41:41,627 INFO L858 garLoopResultBuilder]: For program point hash_table_state_is_validFINAL(lines 10017 10064) no Hoare annotation was computed. [2021-12-18 00:41:41,627 INFO L858 garLoopResultBuilder]: For program point L10019(lines 10019 10023) no Hoare annotation was computed. [2021-12-18 00:41:41,627 INFO L858 garLoopResultBuilder]: For program point L9131(lines 9131 9139) no Hoare annotation was computed. [2021-12-18 00:41:41,627 INFO L861 garLoopResultBuilder]: At program point s_safe_eq_checkENTRY(lines 9121 9142) the Hoare annotation is: true [2021-12-18 00:41:41,627 INFO L858 garLoopResultBuilder]: For program point L9125(lines 9125 9129) no Hoare annotation was computed. [2021-12-18 00:41:41,627 INFO L861 garLoopResultBuilder]: At program point L9141(line 9141) the Hoare annotation is: true [2021-12-18 00:41:41,627 INFO L858 garLoopResultBuilder]: For program point L9141-1(line 9141) no Hoare annotation was computed. [2021-12-18 00:41:41,628 INFO L858 garLoopResultBuilder]: For program point s_safe_eq_checkFINAL(lines 9121 9142) no Hoare annotation was computed. [2021-12-18 00:41:41,628 INFO L858 garLoopResultBuilder]: For program point s_safe_eq_checkEXIT(lines 9121 9142) no Hoare annotation was computed. [2021-12-18 00:41:41,628 INFO L861 garLoopResultBuilder]: At program point L9173(line 9173) the Hoare annotation is: true [2021-12-18 00:41:41,628 INFO L858 garLoopResultBuilder]: For program point L9173-1(line 9173) no Hoare annotation was computed. [2021-12-18 00:41:41,628 INFO L858 garLoopResultBuilder]: For program point L9173-2(lines 9173 9177) no Hoare annotation was computed. [2021-12-18 00:41:41,628 INFO L861 garLoopResultBuilder]: At program point s_alloc_stateENTRY(lines 9171 9190) the Hoare annotation is: true [2021-12-18 00:41:41,628 INFO L861 garLoopResultBuilder]: At program point L7018(line 7018) the Hoare annotation is: true [2021-12-18 00:41:41,628 INFO L861 garLoopResultBuilder]: At program point L7020(lines 7001 7021) the Hoare annotation is: true [2021-12-18 00:41:41,629 INFO L858 garLoopResultBuilder]: For program point L7016-1(line 7016) no Hoare annotation was computed. [2021-12-18 00:41:41,629 INFO L861 garLoopResultBuilder]: At program point L7016(line 7016) the Hoare annotation is: true [2021-12-18 00:41:41,629 INFO L858 garLoopResultBuilder]: For program point L7018-1(line 7018) no Hoare annotation was computed. [2021-12-18 00:41:41,629 INFO L861 garLoopResultBuilder]: At program point L7010(line 7010) the Hoare annotation is: true [2021-12-18 00:41:41,629 INFO L858 garLoopResultBuilder]: For program point L7010-2(lines 7010 7014) no Hoare annotation was computed. [2021-12-18 00:41:41,629 INFO L858 garLoopResultBuilder]: For program point s_alloc_stateEXIT(lines 9171 9190) no Hoare annotation was computed. [2021-12-18 00:41:41,629 INFO L858 garLoopResultBuilder]: For program point L7010-1(line 7010) no Hoare annotation was computed. [2021-12-18 00:41:41,629 INFO L861 garLoopResultBuilder]: At program point L7002(line 7002) the Hoare annotation is: true [2021-12-18 00:41:41,630 INFO L858 garLoopResultBuilder]: For program point L7004-1(line 7004) no Hoare annotation was computed. [2021-12-18 00:41:41,630 INFO L861 garLoopResultBuilder]: At program point L7004(line 7004) the Hoare annotation is: true [2021-12-18 00:41:41,630 INFO L858 garLoopResultBuilder]: For program point L9182(lines 9182 9186) no Hoare annotation was computed. [2021-12-18 00:41:41,630 INFO L858 garLoopResultBuilder]: For program point L7002-2(line 7002) no Hoare annotation was computed. [2021-12-18 00:41:41,630 INFO L861 garLoopResultBuilder]: At program point L7002-1(line 7002) the Hoare annotation is: true [2021-12-18 00:41:41,630 INFO L858 garLoopResultBuilder]: For program point L7017-2(lines 7017 7019) no Hoare annotation was computed. [2021-12-18 00:41:41,630 INFO L858 garLoopResultBuilder]: For program point L7017(lines 7017 7019) no Hoare annotation was computed. [2021-12-18 00:41:41,630 INFO L858 garLoopResultBuilder]: For program point s_alloc_stateFINAL(lines 9171 9190) no Hoare annotation was computed. [2021-12-18 00:41:41,631 INFO L861 garLoopResultBuilder]: At program point L9437-1(line 9437) the Hoare annotation is: true [2021-12-18 00:41:41,631 INFO L858 garLoopResultBuilder]: For program point L9437-2(line 9437) no Hoare annotation was computed. [2021-12-18 00:41:41,631 INFO L861 garLoopResultBuilder]: At program point L9437-3(lines 9437 9439) the Hoare annotation is: true [2021-12-18 00:41:41,631 INFO L861 garLoopResultBuilder]: At program point L9478-5(lines 9433 9482) the Hoare annotation is: true [2021-12-18 00:41:41,631 INFO L858 garLoopResultBuilder]: For program point L9478-6(lines 9478 9481) no Hoare annotation was computed. [2021-12-18 00:41:41,631 INFO L861 garLoopResultBuilder]: At program point L9462-2(lines 9448 9476) the Hoare annotation is: true [2021-12-18 00:41:41,631 INFO L858 garLoopResultBuilder]: For program point L9462(lines 9462 9475) no Hoare annotation was computed. [2021-12-18 00:41:41,632 INFO L861 garLoopResultBuilder]: At program point s_emplace_itemENTRY(lines 9430 9482) the Hoare annotation is: true [2021-12-18 00:41:41,632 INFO L858 garLoopResultBuilder]: For program point s_emplace_itemFINAL(lines 9430 9482) no Hoare annotation was computed. [2021-12-18 00:41:41,632 INFO L861 garLoopResultBuilder]: At program point L9434(line 9434) the Hoare annotation is: true [2021-12-18 00:41:41,632 INFO L861 garLoopResultBuilder]: At program point L9434-1(line 9434) the Hoare annotation is: true [2021-12-18 00:41:41,632 INFO L858 garLoopResultBuilder]: For program point L9434-2(line 9434) no Hoare annotation was computed. [2021-12-18 00:41:41,632 INFO L858 garLoopResultBuilder]: For program point L9464(lines 9464 9466) no Hoare annotation was computed. [2021-12-18 00:41:41,632 INFO L858 garLoopResultBuilder]: For program point L9464-2(lines 9464 9466) no Hoare annotation was computed. [2021-12-18 00:41:41,632 INFO L858 garLoopResultBuilder]: For program point s_emplace_itemEXIT(lines 9430 9482) no Hoare annotation was computed. [2021-12-18 00:41:41,632 INFO L858 garLoopResultBuilder]: For program point L9448-1(lines 9448 9476) no Hoare annotation was computed. [2021-12-18 00:41:41,632 INFO L858 garLoopResultBuilder]: For program point L9436(lines 9436 9440) no Hoare annotation was computed. [2021-12-18 00:41:41,632 INFO L858 garLoopResultBuilder]: For program point L9436-1(lines 9436 9440) no Hoare annotation was computed. [2021-12-18 00:41:41,632 INFO L858 garLoopResultBuilder]: For program point L9478-1(line 9478) no Hoare annotation was computed. [2021-12-18 00:41:41,632 INFO L861 garLoopResultBuilder]: At program point L9478-3(line 9478) the Hoare annotation is: true [2021-12-18 00:41:41,633 INFO L858 garLoopResultBuilder]: For program point L9478-4(line 9478) no Hoare annotation was computed. [2021-12-18 00:41:41,633 INFO L858 garLoopResultBuilder]: For program point L9478(line 9478) no Hoare annotation was computed. [2021-12-18 00:41:41,633 INFO L858 garLoopResultBuilder]: For program point L9338(lines 9338 9340) no Hoare annotation was computed. [2021-12-18 00:41:41,633 INFO L858 garLoopResultBuilder]: For program point L9330(lines 9330 9332) no Hoare annotation was computed. [2021-12-18 00:41:41,633 INFO L858 garLoopResultBuilder]: For program point L9338-2(lines 9338 9340) no Hoare annotation was computed. [2021-12-18 00:41:41,633 INFO L858 garLoopResultBuilder]: For program point L9388(lines 9388 9396) no Hoare annotation was computed. [2021-12-18 00:41:41,633 INFO L858 garLoopResultBuilder]: For program point L9330-2(lines 9330 9332) no Hoare annotation was computed. [2021-12-18 00:41:41,633 INFO L858 garLoopResultBuilder]: For program point L9372(lines 9372 9375) no Hoare annotation was computed. [2021-12-18 00:41:41,633 INFO L858 garLoopResultBuilder]: For program point s_find_entryFINAL(lines 9321 9346) no Hoare annotation was computed. [2021-12-18 00:41:41,633 INFO L858 garLoopResultBuilder]: For program point s_find_entryEXIT(lines 9321 9346) no Hoare annotation was computed. [2021-12-18 00:41:41,633 INFO L861 garLoopResultBuilder]: At program point s_find_entryENTRY(lines 9321 9346) the Hoare annotation is: true [2021-12-18 00:41:41,633 INFO L858 garLoopResultBuilder]: For program point L9377-4(lines 9377 9380) no Hoare annotation was computed. [2021-12-18 00:41:41,633 INFO L858 garLoopResultBuilder]: For program point L9402(lines 9402 9404) no Hoare annotation was computed. [2021-12-18 00:41:41,633 INFO L858 garLoopResultBuilder]: For program point L9377(line 9377) no Hoare annotation was computed. [2021-12-18 00:41:41,633 INFO L861 garLoopResultBuilder]: At program point L9377-1(line 9377) the Hoare annotation is: true [2021-12-18 00:41:41,633 INFO L858 garLoopResultBuilder]: For program point L9377-2(line 9377) no Hoare annotation was computed. [2021-12-18 00:41:41,633 INFO L861 garLoopResultBuilder]: At program point L9406(lines 9348 9407) the Hoare annotation is: true [2021-12-18 00:41:41,633 INFO L861 garLoopResultBuilder]: At program point L9365-2(lines 9365 9399) the Hoare annotation is: true [2021-12-18 00:41:41,634 INFO L858 garLoopResultBuilder]: For program point L9365-3(lines 9365 9399) no Hoare annotation was computed. [2021-12-18 00:41:41,634 INFO L858 garLoopResultBuilder]: For program point L9402-2(lines 9402 9404) no Hoare annotation was computed. [2021-12-18 00:41:41,634 INFO L858 garLoopResultBuilder]: For program point L9337-4(lines 9337 9343) no Hoare annotation was computed. [2021-12-18 00:41:41,634 INFO L858 garLoopResultBuilder]: For program point L9337(line 9337) no Hoare annotation was computed. [2021-12-18 00:41:41,634 INFO L861 garLoopResultBuilder]: At program point L9337-1(line 9337) the Hoare annotation is: true [2021-12-18 00:41:41,634 INFO L858 garLoopResultBuilder]: For program point L9337-2(line 9337) no Hoare annotation was computed. [2021-12-18 00:41:41,634 INFO L858 garLoopResultBuilder]: For program point L9329(lines 9329 9335) no Hoare annotation was computed. [2021-12-18 00:41:41,634 INFO L858 garLoopResultBuilder]: For program point L211-2(lines 210 212) no Hoare annotation was computed. [2021-12-18 00:41:41,635 INFO L861 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 210 212) the Hoare annotation is: true [2021-12-18 00:41:41,635 INFO L858 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2021-12-18 00:41:41,635 INFO L858 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 210 212) no Hoare annotation was computed. [2021-12-18 00:41:41,635 INFO L854 garLoopResultBuilder]: At program point aws_raise_errorENTRY(lines 1988 1999) the Hoare annotation is: (= ~tl_last_error~0 |old(~tl_last_error~0)|) [2021-12-18 00:41:41,635 INFO L858 garLoopResultBuilder]: For program point aws_raise_errorFINAL(lines 1988 1999) no Hoare annotation was computed. [2021-12-18 00:41:41,635 INFO L858 garLoopResultBuilder]: For program point L7385(lines 7385 7387) no Hoare annotation was computed. [2021-12-18 00:41:41,635 INFO L858 garLoopResultBuilder]: For program point aws_raise_errorEXIT(lines 1988 1999) no Hoare annotation was computed. [2021-12-18 00:41:41,635 INFO L858 garLoopResultBuilder]: For program point can_fail_allocatorFINAL(lines 6950 6952) no Hoare annotation was computed. [2021-12-18 00:41:41,635 INFO L858 garLoopResultBuilder]: For program point can_fail_allocatorEXIT(lines 6950 6952) no Hoare annotation was computed. [2021-12-18 00:41:41,635 INFO L861 garLoopResultBuilder]: At program point can_fail_allocatorENTRY(lines 6950 6952) the Hoare annotation is: true [2021-12-18 00:41:41,635 INFO L854 garLoopResultBuilder]: At program point __CPROVER_overflow_multENTRY(lines 253 256) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|)) [2021-12-18 00:41:41,635 INFO L858 garLoopResultBuilder]: For program point __CPROVER_overflow_multEXIT(lines 253 256) no Hoare annotation was computed. [2021-12-18 00:41:41,635 INFO L858 garLoopResultBuilder]: For program point __CPROVER_overflow_multFINAL(lines 253 256) no Hoare annotation was computed. [2021-12-18 00:41:41,635 INFO L858 garLoopResultBuilder]: For program point aws_is_power_of_twoFINAL(lines 2626 2631) no Hoare annotation was computed. [2021-12-18 00:41:41,635 INFO L858 garLoopResultBuilder]: For program point aws_is_power_of_twoEXIT(lines 2626 2631) no Hoare annotation was computed. [2021-12-18 00:41:41,636 INFO L861 garLoopResultBuilder]: At program point aws_is_power_of_twoENTRY(lines 2626 2631) the Hoare annotation is: true [2021-12-18 00:41:41,636 INFO L854 garLoopResultBuilder]: At program point L2545(lines 2541 2546) the Hoare annotation is: (let ((.cse0 (= ~tl_last_error~0 |old(~tl_last_error~0)|))) (or (and (or .cse0 (and (= |#memory_int| |old(#memory_int)|) (= |#memory_real| |old(#memory_real)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))) (<= (+ |aws_add_size_checked_aws_add_u64_checked_#res#1| 1) 0)) (and .cse0 (exists ((|v___CPROVER_overflow_mult_~#c~1.base_83| Int) (v_ArrVal_3189 Int)) (and (= 0 (select |old(#valid)| |v___CPROVER_overflow_mult_~#c~1.base_83|)) (= |#valid| (store |old(#valid)| |v___CPROVER_overflow_mult_~#c~1.base_83| v_ArrVal_3189)))) (= (select (select |#memory_int| |aws_add_size_checked_#in~r#1.base|) |aws_add_size_checked_#in~r#1.offset|) (+ |aws_add_size_checked_#in~b#1| |aws_add_size_checked_#in~a#1|))))) [2021-12-18 00:41:41,636 INFO L854 garLoopResultBuilder]: At program point aws_add_size_checkedENTRY(lines 2613 2621) the Hoare annotation is: (and (= |#memory_int| |old(#memory_int)|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |#memory_real| |old(#memory_real)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2021-12-18 00:41:41,636 INFO L854 garLoopResultBuilder]: At program point L2542(line 2542) the Hoare annotation is: (and (= |#memory_int| |old(#memory_int)|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |#valid| |old(#valid)|) (= |#length| |old(#length)|) (= |aws_add_size_checked_aws_add_u64_checked_~r#1.base| |aws_add_size_checked_#in~r#1.base|) (= |aws_add_size_checked_aws_add_u64_checked_~b#1| |aws_add_size_checked_#in~b#1|) (= |#memory_real| |old(#memory_real)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |aws_add_size_checked_aws_add_u64_checked_~r#1.offset| |aws_add_size_checked_#in~r#1.offset|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |aws_add_size_checked_aws_add_u64_checked_~a#1| |aws_add_size_checked_#in~a#1|)) [2021-12-18 00:41:41,636 INFO L858 garLoopResultBuilder]: For program point L2543-1(line 2543) no Hoare annotation was computed. [2021-12-18 00:41:41,636 INFO L854 garLoopResultBuilder]: At program point L2543(line 2543) the Hoare annotation is: (and (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |#memory_int| |old(#memory_int)|) (= |aws_add_size_checked_aws_add_u64_checked_~r#1.base| |aws_add_size_checked_#in~r#1.base|) (= |aws_add_size_checked_aws_add_u64_checked_~b#1| |aws_add_size_checked_#in~b#1|) (= |#memory_real| |old(#memory_real)|) (exists ((|v___CPROVER_overflow_mult_~#c~1.base_83| Int) (v_ArrVal_3189 Int)) (and (= 0 (select |old(#valid)| |v___CPROVER_overflow_mult_~#c~1.base_83|)) (= |#valid| (store |old(#valid)| |v___CPROVER_overflow_mult_~#c~1.base_83| v_ArrVal_3189)))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |aws_add_size_checked_aws_add_u64_checked_~r#1.offset| |aws_add_size_checked_#in~r#1.offset|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |aws_add_size_checked_aws_add_u64_checked_~a#1| |aws_add_size_checked_#in~a#1|)) [2021-12-18 00:41:41,636 INFO L858 garLoopResultBuilder]: For program point L2542-1(lines 2542 2543) no Hoare annotation was computed. [2021-12-18 00:41:41,637 INFO L858 garLoopResultBuilder]: For program point aws_add_size_checkedFINAL(lines 2613 2621) no Hoare annotation was computed. [2021-12-18 00:41:41,637 INFO L858 garLoopResultBuilder]: For program point aws_add_size_checkedEXIT(lines 2613 2621) no Hoare annotation was computed. [2021-12-18 00:41:41,637 INFO L858 garLoopResultBuilder]: For program point L6815-1(line 6815) no Hoare annotation was computed. [2021-12-18 00:41:41,637 INFO L854 garLoopResultBuilder]: At program point L6815(line 6815) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base|) 1) (not (= |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base| 0)) (not (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|)) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.offset|) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|) (= 0 |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.offset|) (<= (mod |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| 18446744073709551616) 4) (= 0 |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.offset|) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|)) [2021-12-18 00:41:41,637 INFO L854 garLoopResultBuilder]: At program point L6811-1(line 6811) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|) 1) (not (= |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base| 0)) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.offset|) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|) (= 0 |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.offset|) (<= (mod |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| 18446744073709551616) 4) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|)) [2021-12-18 00:41:41,637 INFO L854 garLoopResultBuilder]: At program point L6811(line 6811) the Hoare annotation is: (and (= |ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries#1| 4) (= (select |#valid| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|) 1) (not (= |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base| 0)) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.offset|) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|) (= 0 |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.offset|) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|)) [2021-12-18 00:41:41,637 INFO L861 garLoopResultBuilder]: At program point L10176(line 10176) the Hoare annotation is: true [2021-12-18 00:41:41,638 INFO L858 garLoopResultBuilder]: For program point L6815-3(line 6815) no Hoare annotation was computed. [2021-12-18 00:41:41,638 INFO L854 garLoopResultBuilder]: At program point L6815-2(line 6815) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base| 0))) (.cse1 (= 0 |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.offset|))) (or (and .cse0 (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.offset|) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|) (<= (+ |ULTIMATE.start_ensure_allocated_hash_table_#t~ret550#1| 1) 0) .cse1) (let ((.cse2 (select (select |#memory_int| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base|) |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.offset|))) (and (= (mod (+ (* .cse2 23) 8) (- 24)) 0) (= (select |#valid| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base|) 1) (<= (mod (div (+ (* .cse2 (- 1)) (- 29629528)) (- 24)) 18446744073709551616) 4) .cse0 (not (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|)) .cse1 (= 0 |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.offset|) (= |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base| |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|) (= |ULTIMATE.start_ensure_allocated_hash_table_#t~ret550#1| 0) (= |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.offset| |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset|))))) [2021-12-18 00:41:41,638 INFO L858 garLoopResultBuilder]: For program point L10135-2(line 10135) no Hoare annotation was computed. [2021-12-18 00:41:41,638 INFO L858 garLoopResultBuilder]: For program point L6840-1(line 6840) no Hoare annotation was computed. [2021-12-18 00:41:41,638 INFO L858 garLoopResultBuilder]: For program point L10164(line 10164) no Hoare annotation was computed. [2021-12-18 00:41:41,638 INFO L854 garLoopResultBuilder]: At program point L6840(line 6840) the Hoare annotation is: false [2021-12-18 00:41:41,638 INFO L854 garLoopResultBuilder]: At program point L10164-2(line 10164) the Hoare annotation is: false [2021-12-18 00:41:41,639 INFO L854 garLoopResultBuilder]: At program point L10135(line 10135) the Hoare annotation is: false [2021-12-18 00:41:41,639 INFO L854 garLoopResultBuilder]: At program point L10135-1(line 10135) the Hoare annotation is: false [2021-12-18 00:41:41,639 INFO L854 garLoopResultBuilder]: At program point L10156-1(lines 10156 10157) the Hoare annotation is: false [2021-12-18 00:41:41,639 INFO L858 garLoopResultBuilder]: For program point L10164-3(line 10164) no Hoare annotation was computed. [2021-12-18 00:41:41,639 INFO L858 garLoopResultBuilder]: For program point L10160(lines 10160 10174) no Hoare annotation was computed. [2021-12-18 00:41:41,639 INFO L858 garLoopResultBuilder]: For program point L10160-1(lines 10160 10174) no Hoare annotation was computed. [2021-12-18 00:41:41,639 INFO L854 garLoopResultBuilder]: At program point L10173(line 10173) the Hoare annotation is: false [2021-12-18 00:41:41,639 INFO L858 garLoopResultBuilder]: For program point L6816-1(line 6816) no Hoare annotation was computed. [2021-12-18 00:41:41,640 INFO L858 garLoopResultBuilder]: For program point L10173-1(line 10173) no Hoare annotation was computed. [2021-12-18 00:41:41,640 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-12-18 00:41:41,640 INFO L854 garLoopResultBuilder]: At program point L6816(line 6816) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base|) |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.offset|))) (and (= (mod (+ (* |ULTIMATE.start_ensure_allocated_hash_table_#t~mem551#1| 23) 8) (- 24)) 0) (not (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|)) (= 0 |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.offset|) (= 0 |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.offset|) (= |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base| |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base|) (= |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.offset| |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset|) (= (mod (+ (* .cse0 23) 8) (- 24)) 0) (= (select |#valid| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base|) 1) (<= (mod (div (+ (* .cse0 (- 1)) (- 29629528)) (- 24)) 18446744073709551616) 4) (not (= |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base| 0)) (<= (mod (div (+ (* |ULTIMATE.start_ensure_allocated_hash_table_#t~mem551#1| (- 1)) (- 29629528)) (- 24)) 18446744073709551616) 4) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|))) [2021-12-18 00:41:41,640 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-12-18 00:41:41,640 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-12-18 00:41:41,640 INFO L858 garLoopResultBuilder]: For program point L6812-1(line 6812) no Hoare annotation was computed. [2021-12-18 00:41:41,640 INFO L854 garLoopResultBuilder]: At program point L6812(line 6812) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|) 1) (not (= |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base| 0)) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.offset|) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|) (= 0 |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.offset|) (<= (mod |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| 18446744073709551616) 4) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|)) [2021-12-18 00:41:41,641 INFO L858 garLoopResultBuilder]: For program point L10132(lines 10132 10175) no Hoare annotation was computed. [2021-12-18 00:41:41,641 INFO L858 garLoopResultBuilder]: For program point L6841-1(line 6841) no Hoare annotation was computed. [2021-12-18 00:41:41,641 INFO L854 garLoopResultBuilder]: At program point L6841(line 6841) the Hoare annotation is: false [2021-12-18 00:41:41,641 INFO L854 garLoopResultBuilder]: At program point L6833(lines 6831 6834) the Hoare annotation is: false [2021-12-18 00:41:41,641 INFO L858 garLoopResultBuilder]: For program point L10161(lines 10161 10167) no Hoare annotation was computed. [2021-12-18 00:41:41,641 INFO L858 garLoopResultBuilder]: For program point L10161-2(lines 10160 10172) no Hoare annotation was computed. [2021-12-18 00:41:41,641 INFO L854 garLoopResultBuilder]: At program point L10141(line 10141) the Hoare annotation is: false [2021-12-18 00:41:41,641 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-12-18 00:41:41,642 INFO L858 garLoopResultBuilder]: For program point L10141-1(line 10141) no Hoare annotation was computed. [2021-12-18 00:41:41,642 INFO L854 garLoopResultBuilder]: At program point L10170(line 10170) the Hoare annotation is: false [2021-12-18 00:41:41,642 INFO L858 garLoopResultBuilder]: For program point L6809(lines 6809 6819) no Hoare annotation was computed. [2021-12-18 00:41:41,642 INFO L854 garLoopResultBuilder]: At program point L10162(line 10162) the Hoare annotation is: false [2021-12-18 00:41:41,642 INFO L854 garLoopResultBuilder]: At program point L10170-1(line 10170) the Hoare annotation is: false [2021-12-18 00:41:41,642 INFO L858 garLoopResultBuilder]: For program point L10170-2(line 10170) no Hoare annotation was computed. [2021-12-18 00:41:41,642 INFO L858 garLoopResultBuilder]: For program point L10154(lines 10154 10155) no Hoare annotation was computed. [2021-12-18 00:41:41,642 INFO L858 garLoopResultBuilder]: For program point L10162-1(line 10162) no Hoare annotation was computed. [2021-12-18 00:41:41,643 INFO L858 garLoopResultBuilder]: For program point L10154-2(lines 10154 10158) no Hoare annotation was computed. [2021-12-18 00:41:41,643 INFO L858 garLoopResultBuilder]: For program point L10154-3(lines 10154 10158) no Hoare annotation was computed. [2021-12-18 00:41:41,643 INFO L854 garLoopResultBuilder]: At program point L10138(line 10138) the Hoare annotation is: false [2021-12-18 00:41:41,643 INFO L854 garLoopResultBuilder]: At program point L6810(line 6810) the Hoare annotation is: (and (= |ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries#1| 4) (= (select |#valid| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|) 1) (not (= |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base| 0)) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.offset|) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|) (= 0 |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.offset|) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_create_harness_~#map~0#1.base|)) [2021-12-18 00:41:41,643 INFO L854 garLoopResultBuilder]: At program point L6843(lines 6837 6844) the Hoare annotation is: false [2021-12-18 00:41:41,643 INFO L858 garLoopResultBuilder]: For program point L6839-1(line 6839) no Hoare annotation was computed. [2021-12-18 00:41:41,643 INFO L854 garLoopResultBuilder]: At program point L6839(line 6839) the Hoare annotation is: false [2021-12-18 00:41:41,643 INFO L858 garLoopResultBuilder]: For program point L6810-1(line 6810) no Hoare annotation was computed. [2021-12-18 00:41:41,643 INFO L858 garLoopResultBuilder]: For program point L10138-1(line 10138) no Hoare annotation was computed. [2021-12-18 00:41:41,643 INFO L858 garLoopResultBuilder]: For program point L10159-2(line 10159) no Hoare annotation was computed. [2021-12-18 00:41:41,644 INFO L854 garLoopResultBuilder]: At program point L10159(line 10159) the Hoare annotation is: false [2021-12-18 00:41:41,644 INFO L854 garLoopResultBuilder]: At program point L10159-1(line 10159) the Hoare annotation is: false [2021-12-18 00:41:41,644 INFO L858 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2021-12-18 00:41:41,644 INFO L861 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 222 224) the Hoare annotation is: true [2021-12-18 00:41:41,644 INFO L858 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2021-12-18 00:41:41,644 INFO L858 garLoopResultBuilder]: For program point L223-3(lines 222 224) no Hoare annotation was computed. [2021-12-18 00:41:41,644 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 222 224) no Hoare annotation was computed. [2021-12-18 00:41:41,645 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-12-18 00:41:41,648 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 00:41:41,649 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-18 00:41:41,658 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-18 00:41:41,659 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-18 00:41:41,659 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-18 00:41:41,660 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-18 00:41:41,660 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_83,QUANTIFIED] [2021-12-18 00:41:41,660 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_3189,QUANTIFIED] [2021-12-18 00:41:41,660 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_83,QUANTIFIED] [2021-12-18 00:41:41,663 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-18 00:41:41,663 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-18 00:41:41,663 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-18 00:41:41,663 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-18 00:41:41,663 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_83,QUANTIFIED] [2021-12-18 00:41:41,663 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_3189,QUANTIFIED] [2021-12-18 00:41:41,664 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_83,QUANTIFIED] [2021-12-18 00:41:41,665 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-18 00:41:41,665 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-18 00:41:41,665 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-18 00:41:41,665 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-18 00:41:41,665 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_83,QUANTIFIED] [2021-12-18 00:41:41,665 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_3189,QUANTIFIED] [2021-12-18 00:41:41,666 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_83,QUANTIFIED] [2021-12-18 00:41:41,666 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-18 00:41:41,667 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-18 00:41:41,667 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-18 00:41:41,667 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-18 00:41:41,667 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_83,QUANTIFIED] [2021-12-18 00:41:41,667 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_3189,QUANTIFIED] [2021-12-18 00:41:41,667 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_83,QUANTIFIED] [2021-12-18 00:41:41,668 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 12:41:41 BoogieIcfgContainer [2021-12-18 00:41:41,668 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-18 00:41:41,669 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-18 00:41:41,669 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-18 00:41:41,669 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-18 00:41:41,670 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:40:14" (3/4) ... [2021-12-18 00:41:41,672 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-12-18 00:41:41,679 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure uninterpreted_equals [2021-12-18 00:41:41,679 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure bounded_malloc [2021-12-18 00:41:41,679 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __CPROVER_uninterpreted_equals [2021-12-18 00:41:41,679 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __CPROVER_uninterpreted_hasher [2021-12-18 00:41:41,679 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_hash_table_is_valid [2021-12-18 00:41:41,679 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_bool [2021-12-18 00:41:41,680 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_mem_release [2021-12-18 00:41:41,680 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure hash_table_state_required_bytes [2021-12-18 00:41:41,680 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure can_fail_calloc [2021-12-18 00:41:41,680 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure s_update_template_size [2021-12-18 00:41:41,680 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_allocator_is_valid [2021-12-18 00:41:41,680 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure s_hash_keys_eq [2021-12-18 00:41:41,680 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_mul_size_checked [2021-12-18 00:41:41,680 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_uint64_t [2021-12-18 00:41:41,680 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure s_hash_for [2021-12-18 00:41:41,681 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __CPROVER_overflow_plus [2021-12-18 00:41:41,681 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2021-12-18 00:41:41,681 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_hash_table_create [2021-12-18 00:41:41,681 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure hash_table_state_is_valid [2021-12-18 00:41:41,681 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure s_safe_eq_check [2021-12-18 00:41:41,681 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure s_alloc_state [2021-12-18 00:41:41,681 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure s_emplace_item [2021-12-18 00:41:41,681 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure s_find_entry [2021-12-18 00:41:41,681 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2021-12-18 00:41:41,682 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_raise_error [2021-12-18 00:41:41,682 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure can_fail_allocator [2021-12-18 00:41:41,682 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __CPROVER_overflow_mult [2021-12-18 00:41:41,682 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_is_power_of_two [2021-12-18 00:41:41,682 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_add_size_checked [2021-12-18 00:41:41,682 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2021-12-18 00:41:41,699 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 256 nodes and edges [2021-12-18 00:41:41,701 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 105 nodes and edges [2021-12-18 00:41:41,702 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 39 nodes and edges [2021-12-18 00:41:41,704 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2021-12-18 00:41:41,706 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2021-12-18 00:41:41,707 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-12-18 00:41:41,709 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-12-18 00:41:41,710 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-12-18 00:41:41,734 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && unknown-#memory_real-unknown == \old(unknown-#memory_real-unknown)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && \result + 1 <= 0) || (((tl_last_error == \old(tl_last_error) && (\exists v___CPROVER_overflow_mult_~#c~1.base_83 : int, v_ArrVal_3189 : int :: 0 == \old(\valid)[v___CPROVER_overflow_mult_~#c~1.base_83] && \valid == \old(\valid)[v___CPROVER_overflow_mult_~#c~1.base_83 := v_ArrVal_3189])) && \result == 0) && unknown-#memory_int-unknown[r][r] == \old(a) * \old(b)) [2021-12-18 00:41:41,736 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((tl_last_error == \old(tl_last_error) || (((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && unknown-#memory_real-unknown == \old(unknown-#memory_real-unknown)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$))) && \result + 1 <= 0) || ((tl_last_error == \old(tl_last_error) && (\exists v___CPROVER_overflow_mult_~#c~1.base_83 : int, v_ArrVal_3189 : int :: 0 == \old(\valid)[v___CPROVER_overflow_mult_~#c~1.base_83] && \valid == \old(\valid)[v___CPROVER_overflow_mult_~#c~1.base_83 := v_ArrVal_3189])) && unknown-#memory_int-unknown[r][r] == \old(b) + \old(a)) [2021-12-18 00:41:42,263 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-18 00:41:42,263 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-18 00:41:42,264 INFO L158 Benchmark]: Toolchain (without parser) took 92101.34ms. Allocated memory was 92.3MB in the beginning and 371.2MB in the end (delta: 278.9MB). Free memory was 51.5MB in the beginning and 246.1MB in the end (delta: -194.6MB). Peak memory consumption was 278.1MB. Max. memory is 16.1GB. [2021-12-18 00:41:42,264 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 92.3MB. Free memory is still 49.3MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-18 00:41:42,265 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2374.91ms. Allocated memory was 92.3MB in the beginning and 161.5MB in the end (delta: 69.2MB). Free memory was 51.3MB in the beginning and 91.7MB in the end (delta: -40.4MB). Peak memory consumption was 57.9MB. Max. memory is 16.1GB. [2021-12-18 00:41:42,265 INFO L158 Benchmark]: Boogie Procedure Inliner took 205.12ms. Allocated memory is still 161.5MB. Free memory was 91.7MB in the beginning and 77.0MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-12-18 00:41:42,265 INFO L158 Benchmark]: Boogie Preprocessor took 134.84ms. Allocated memory is still 161.5MB. Free memory was 77.0MB in the beginning and 66.5MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-18 00:41:42,266 INFO L158 Benchmark]: RCFGBuilder took 1692.86ms. Allocated memory was 161.5MB in the beginning and 197.1MB in the end (delta: 35.7MB). Free memory was 66.5MB in the beginning and 123.0MB in the end (delta: -56.4MB). Peak memory consumption was 31.3MB. Max. memory is 16.1GB. [2021-12-18 00:41:42,266 INFO L158 Benchmark]: TraceAbstraction took 87093.64ms. Allocated memory was 197.1MB in the beginning and 371.2MB in the end (delta: 174.1MB). Free memory was 123.0MB in the beginning and 160.2MB in the end (delta: -37.3MB). Peak memory consumption was 136.8MB. Max. memory is 16.1GB. [2021-12-18 00:41:42,266 INFO L158 Benchmark]: Witness Printer took 594.50ms. Allocated memory is still 371.2MB. Free memory was 160.2MB in the beginning and 246.1MB in the end (delta: -85.9MB). Peak memory consumption was 109.2MB. Max. memory is 16.1GB. [2021-12-18 00:41:42,268 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.23ms. Allocated memory is still 92.3MB. Free memory is still 49.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2374.91ms. Allocated memory was 92.3MB in the beginning and 161.5MB in the end (delta: 69.2MB). Free memory was 51.3MB in the beginning and 91.7MB in the end (delta: -40.4MB). Peak memory consumption was 57.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 205.12ms. Allocated memory is still 161.5MB. Free memory was 91.7MB in the beginning and 77.0MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 134.84ms. Allocated memory is still 161.5MB. Free memory was 77.0MB in the beginning and 66.5MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * RCFGBuilder took 1692.86ms. Allocated memory was 161.5MB in the beginning and 197.1MB in the end (delta: 35.7MB). Free memory was 66.5MB in the beginning and 123.0MB in the end (delta: -56.4MB). Peak memory consumption was 31.3MB. Max. memory is 16.1GB. * TraceAbstraction took 87093.64ms. Allocated memory was 197.1MB in the beginning and 371.2MB in the end (delta: 174.1MB). Free memory was 123.0MB in the beginning and 160.2MB in the end (delta: -37.3MB). Peak memory consumption was 136.8MB. Max. memory is 16.1GB. * Witness Printer took 594.50ms. Allocated memory is still 371.2MB. Free memory was 160.2MB in the beginning and 246.1MB in the end (delta: -85.9MB). Peak memory consumption was 109.2MB. 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$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_83,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_3189,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_83,QUANTIFIED] - 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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_83,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_3189,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_83,QUANTIFIED] - 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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_83,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_3189,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_83,QUANTIFIED] - 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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_83,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_3189,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_83,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 31 procedures, 349 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 87.0s, OverallIterations: 20, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 38.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.9s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6895 SdHoareTripleChecker+Valid, 35.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6098 mSDsluCounter, 41499 SdHoareTripleChecker+Invalid, 31.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 3280 IncrementalHoareTripleChecker+Unchecked, 33170 mSDsCounter, 3962 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 24409 IncrementalHoareTripleChecker+Invalid, 31651 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3962 mSolverCounterUnsat, 8329 mSDtfsCounter, 24409 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2455 GetRequests, 2144 SyntacticMatches, 17 SemanticMatches, 294 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1045 ImplicationChecksByTransitivity, 11.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=514occurred in iteration=18, InterpolantAutomatonStates: 238, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 20 MinimizatonAttempts, 1861 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 134 LocationsWithAnnotation, 3534 PreInvPairs, 3570 NumberOfFragments, 847 HoareAnnotationTreeSize, 3534 FomulaSimplifications, 1370 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 134 FomulaSimplificationsInter, 441 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 23.0s SatisfiabilityAnalysisTime, 19.8s InterpolantComputationTime, 3879 NumberOfCodeBlocks, 3879 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 3909 ConstructedInterpolants, 44 QuantifiedInterpolants, 8153 SizeOfPredicates, 72 NumberOfNonLiveVariables, 19010 ConjunctsInSsa, 448 ConjunctsInUnsatCore, 24 InterpolantComputations, 18 PerfectInterpolantSequences, 4500/4558 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 6934]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 9448]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 10176]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 9502]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7348]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 262]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7369]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 9365]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6831]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9154]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2637]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6837]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 7280]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 9348]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2497]: Loop Invariant [2021-12-18 00:41:42,281 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-18 00:41:42,281 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-18 00:41:42,281 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-18 00:41:42,281 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-18 00:41:42,282 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_83,QUANTIFIED] [2021-12-18 00:41:42,282 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_3189,QUANTIFIED] [2021-12-18 00:41:42,282 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_83,QUANTIFIED] [2021-12-18 00:41:42,283 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-18 00:41:42,283 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-18 00:41:42,283 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-18 00:41:42,283 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-18 00:41:42,283 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_83,QUANTIFIED] [2021-12-18 00:41:42,283 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_3189,QUANTIFIED] [2021-12-18 00:41:42,283 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_83,QUANTIFIED] Derived loop invariant: ((((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && unknown-#memory_real-unknown == \old(unknown-#memory_real-unknown)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && \result + 1 <= 0) || (((tl_last_error == \old(tl_last_error) && (\exists v___CPROVER_overflow_mult_~#c~1.base_83 : int, v_ArrVal_3189 : int :: 0 == \old(\valid)[v___CPROVER_overflow_mult_~#c~1.base_83] && \valid == \old(\valid)[v___CPROVER_overflow_mult_~#c~1.base_83 := v_ArrVal_3189])) && \result == 0) && unknown-#memory_int-unknown[r][r] == \old(a) * \old(b)) - InvariantResult [Line: 2541]: Loop Invariant [2021-12-18 00:41:42,284 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-18 00:41:42,284 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-18 00:41:42,284 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-18 00:41:42,285 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-18 00:41:42,285 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_83,QUANTIFIED] [2021-12-18 00:41:42,285 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_3189,QUANTIFIED] [2021-12-18 00:41:42,285 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_83,QUANTIFIED] [2021-12-18 00:41:42,286 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-18 00:41:42,286 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-18 00:41:42,286 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-18 00:41:42,286 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-18 00:41:42,286 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_83,QUANTIFIED] [2021-12-18 00:41:42,286 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_3189,QUANTIFIED] [2021-12-18 00:41:42,286 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_83,QUANTIFIED] Derived loop invariant: ((tl_last_error == \old(tl_last_error) || (((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && unknown-#memory_real-unknown == \old(unknown-#memory_real-unknown)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$))) && \result + 1 <= 0) || ((tl_last_error == \old(tl_last_error) && (\exists v___CPROVER_overflow_mult_~#c~1.base_83 : int, v_ArrVal_3189 : int :: 0 == \old(\valid)[v___CPROVER_overflow_mult_~#c~1.base_83] && \valid == \old(\valid)[v___CPROVER_overflow_mult_~#c~1.base_83 := v_ArrVal_3189])) && unknown-#memory_int-unknown[r][r] == \old(b) + \old(a)) - InvariantResult [Line: 7001]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 9484]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 9437]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2021-12-18 00:41:42,429 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE