./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_hash_table_find_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 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_find_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 b2aa49e297f60cfce052f243c4868c3f21a4b7a15679d0734b9f9fae5c35ea17 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 22:48:20,275 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 22:48:20,276 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 22:48:20,298 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 22:48:20,299 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 22:48:20,300 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 22:48:20,301 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 22:48:20,302 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 22:48:20,303 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 22:48:20,305 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 22:48:20,306 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 22:48:20,308 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 22:48:20,309 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 22:48:20,309 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 22:48:20,310 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 22:48:20,311 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 22:48:20,312 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 22:48:20,312 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 22:48:20,313 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 22:48:20,314 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 22:48:20,315 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 22:48:20,316 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 22:48:20,317 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 22:48:20,318 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 22:48:20,318 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 22:48:20,320 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 22:48:20,321 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 22:48:20,321 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 22:48:20,321 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 22:48:20,322 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 22:48:20,322 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 22:48:20,322 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 22:48:20,323 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 22:48:20,324 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 22:48:20,324 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 22:48:20,325 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 22:48:20,325 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 22:48:20,325 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 22:48:20,326 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 22:48:20,326 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 22:48:20,326 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 22:48:20,328 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 22:48:20,329 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-13 22:48:20,346 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 22:48:20,347 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 22:48:20,347 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 22:48:20,347 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 22:48:20,348 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 22:48:20,348 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 22:48:20,349 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 22:48:20,349 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 22:48:20,349 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 22:48:20,350 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 22:48:20,350 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 22:48:20,350 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 22:48:20,350 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 22:48:20,350 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 22:48:20,350 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 22:48:20,351 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 22:48:20,351 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 22:48:20,351 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 22:48:20,351 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 22:48:20,352 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 22:48:20,352 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 22:48:20,352 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 22:48:20,352 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 22:48:20,353 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 22:48:20,353 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 22:48:20,353 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 22:48:20,353 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 22:48:20,353 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 22:48:20,354 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 22:48:20,354 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 22:48:20,354 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 -> b2aa49e297f60cfce052f243c4868c3f21a4b7a15679d0734b9f9fae5c35ea17 [2022-07-13 22:48:20,540 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 22:48:20,565 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 22:48:20,567 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 22:48:20,579 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 22:48:20,580 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 22:48:20,581 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_find_harness.i [2022-07-13 22:48:20,637 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13cf681c8/b44d857b1261489fafebe3f666c341b4/FLAG276bcf502 [2022-07-13 22:48:21,190 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 22:48:21,191 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_find_harness.i [2022-07-13 22:48:21,222 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13cf681c8/b44d857b1261489fafebe3f666c341b4/FLAG276bcf502 [2022-07-13 22:48:21,389 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13cf681c8/b44d857b1261489fafebe3f666c341b4 [2022-07-13 22:48:21,393 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 22:48:21,396 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 22:48:21,399 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 22:48:21,399 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 22:48:21,402 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 22:48:21,402 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 10:48:21" (1/1) ... [2022-07-13 22:48:21,403 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d3d34c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:48:21, skipping insertion in model container [2022-07-13 22:48:21,403 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 10:48:21" (1/1) ... [2022-07-13 22:48:21,409 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 22:48:21,490 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 22:48:21,723 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_find_harness.i[4493,4506] [2022-07-13 22:48:21,729 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_find_harness.i[4553,4566] [2022-07-13 22:48:22,278 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:48:22,284 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:48:22,284 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:48:22,285 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:48:22,286 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:48:22,304 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:48:22,304 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:48:22,305 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:48:22,306 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:48:22,307 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:48:22,308 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:48:22,309 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:48:22,309 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:48:22,557 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-13 22:48:22,558 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-13 22:48:22,559 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-13 22:48:22,560 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-13 22:48:22,560 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-13 22:48:22,561 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-13 22:48:22,561 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-13 22:48:22,562 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-13 22:48:22,562 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-13 22:48:22,562 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-13 22:48:22,658 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-13 22:48:22,892 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:48:22,892 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:48:22,914 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:48:22,918 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:48:22,923 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:48:22,924 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:48:22,939 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:48:22,940 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:48:22,941 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:48:22,941 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:48:22,942 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:48:22,942 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:48:22,942 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:48:22,974 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 22:48:23,004 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 22:48:23,026 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_find_harness.i[4493,4506] [2022-07-13 22:48:23,026 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_find_harness.i[4553,4566] [2022-07-13 22:48:23,065 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:48:23,066 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:48:23,067 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:48:23,067 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:48:23,067 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:48:23,074 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:48:23,074 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:48:23,075 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:48:23,075 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:48:23,075 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:48:23,076 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:48:23,076 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:48:23,076 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:48:23,096 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-13 22:48:23,096 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-13 22:48:23,097 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-13 22:48:23,097 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-13 22:48:23,098 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-13 22:48:23,098 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-13 22:48:23,098 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-13 22:48:23,098 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-13 22:48:23,099 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-13 22:48:23,099 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-13 22:48:23,119 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-13 22:48:23,198 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:48:23,199 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:48:23,203 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:48:23,204 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:48:23,205 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:48:23,205 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:48:23,213 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:48:23,214 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:48:23,214 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:48:23,214 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:48:23,215 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:48:23,215 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:48:23,216 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:48:23,226 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 22:48:23,396 INFO L208 MainTranslator]: Completed translation [2022-07-13 22:48:23,396 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:48:23 WrapperNode [2022-07-13 22:48:23,396 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 22:48:23,397 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 22:48:23,397 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 22:48:23,397 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 22:48:23,402 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:48:23" (1/1) ... [2022-07-13 22:48:23,466 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:48:23" (1/1) ... [2022-07-13 22:48:23,540 INFO L137 Inliner]: procedures = 774, calls = 2455, calls flagged for inlining = 69, calls inlined = 20, statements flattened = 838 [2022-07-13 22:48:23,541 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 22:48:23,543 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 22:48:23,543 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 22:48:23,544 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 22:48:23,552 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:48:23" (1/1) ... [2022-07-13 22:48:23,552 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:48:23" (1/1) ... [2022-07-13 22:48:23,576 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:48:23" (1/1) ... [2022-07-13 22:48:23,577 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:48:23" (1/1) ... [2022-07-13 22:48:23,619 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:48:23" (1/1) ... [2022-07-13 22:48:23,628 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:48:23" (1/1) ... [2022-07-13 22:48:23,646 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:48:23" (1/1) ... [2022-07-13 22:48:23,658 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 22:48:23,659 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 22:48:23,659 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 22:48:23,659 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 22:48:23,664 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:48:23" (1/1) ... [2022-07-13 22:48:23,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 22:48:23,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:48:23,704 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-13 22:48:23,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-13 22:48:23,736 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-07-13 22:48:23,736 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 22:48:23,737 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2022-07-13 22:48:23,737 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2022-07-13 22:48:23,737 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-13 22:48:23,737 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-13 22:48:23,737 INFO L130 BoogieDeclarations]: Found specification of procedure hash_table_state_is_valid [2022-07-13 22:48:23,737 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_table_state_is_valid [2022-07-13 22:48:23,737 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 22:48:23,738 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 22:48:23,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-13 22:48:23,738 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 22:48:23,738 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 22:48:23,738 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2022-07-13 22:48:23,738 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2022-07-13 22:48:23,738 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mul_size_checked [2022-07-13 22:48:23,738 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mul_size_checked [2022-07-13 22:48:23,739 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 22:48:23,739 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_plus [2022-07-13 22:48:23,739 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_plus [2022-07-13 22:48:23,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-13 22:48:23,739 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-07-13 22:48:23,739 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-07-13 22:48:23,740 INFO L130 BoogieDeclarations]: Found specification of procedure aws_hash_table_find [2022-07-13 22:48:23,740 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_hash_table_find [2022-07-13 22:48:23,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 22:48:23,740 INFO L130 BoogieDeclarations]: Found specification of procedure s_hash_for [2022-07-13 22:48:23,740 INFO L138 BoogieDeclarations]: Found implementation of procedure s_hash_for [2022-07-13 22:48:23,740 INFO L130 BoogieDeclarations]: Found specification of procedure aws_is_power_of_two [2022-07-13 22:48:23,741 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_is_power_of_two [2022-07-13 22:48:23,741 INFO L130 BoogieDeclarations]: Found specification of procedure s_hash_keys_eq [2022-07-13 22:48:23,741 INFO L138 BoogieDeclarations]: Found implementation of procedure s_hash_keys_eq [2022-07-13 22:48:23,742 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_uninterpreted_equals [2022-07-13 22:48:23,742 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_uninterpreted_equals [2022-07-13 22:48:23,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 22:48:23,742 INFO L130 BoogieDeclarations]: Found specification of procedure hash_table_state_required_bytes [2022-07-13 22:48:23,742 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_table_state_required_bytes [2022-07-13 22:48:23,743 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_uninterpreted_hasher [2022-07-13 22:48:23,743 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_uninterpreted_hasher [2022-07-13 22:48:23,743 INFO L130 BoogieDeclarations]: Found specification of procedure s_safe_eq_check [2022-07-13 22:48:23,743 INFO L138 BoogieDeclarations]: Found implementation of procedure s_safe_eq_check [2022-07-13 22:48:23,744 INFO L130 BoogieDeclarations]: Found specification of procedure s_find_entry [2022-07-13 22:48:23,744 INFO L138 BoogieDeclarations]: Found implementation of procedure s_find_entry [2022-07-13 22:48:23,747 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-13 22:48:23,747 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-13 22:48:23,747 INFO L130 BoogieDeclarations]: Found specification of procedure aws_hash_table_is_valid [2022-07-13 22:48:23,748 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_hash_table_is_valid [2022-07-13 22:48:23,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-13 22:48:23,749 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_mult [2022-07-13 22:48:23,749 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_mult [2022-07-13 22:48:23,749 INFO L130 BoogieDeclarations]: Found specification of procedure aws_add_size_checked [2022-07-13 22:48:23,749 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_add_size_checked [2022-07-13 22:48:23,754 INFO L130 BoogieDeclarations]: Found specification of procedure uninterpreted_equals [2022-07-13 22:48:23,754 INFO L138 BoogieDeclarations]: Found implementation of procedure uninterpreted_equals [2022-07-13 22:48:23,755 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2022-07-13 22:48:23,755 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2022-07-13 22:48:23,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 22:48:24,117 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 22:48:24,119 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 22:48:24,253 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##5: assume !true; [2022-07-13 22:48:24,281 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume !true; [2022-07-13 22:48:24,429 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##8: assume !true; [2022-07-13 22:48:24,850 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 22:48:24,857 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 22:48:24,857 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2022-07-13 22:48:24,859 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 10:48:24 BoogieIcfgContainer [2022-07-13 22:48:24,859 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 22:48:24,860 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 22:48:24,861 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 22:48:24,863 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 22:48:24,864 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 10:48:21" (1/3) ... [2022-07-13 22:48:24,864 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c87da27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 10:48:24, skipping insertion in model container [2022-07-13 22:48:24,864 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:48:23" (2/3) ... [2022-07-13 22:48:24,865 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c87da27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 10:48:24, skipping insertion in model container [2022-07-13 22:48:24,865 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 10:48:24" (3/3) ... [2022-07-13 22:48:24,866 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_hash_table_find_harness.i [2022-07-13 22:48:24,877 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 22:48:24,878 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 22:48:24,920 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 22:48:24,925 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3c7431aa, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@352a5b7f [2022-07-13 22:48:24,925 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 22:48:24,929 INFO L276 IsEmpty]: Start isEmpty. Operand has 246 states, 157 states have (on average 1.2101910828025477) internal successors, (190), 155 states have internal predecessors, (190), 68 states have call successors, (68), 22 states have call predecessors, (68), 22 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2022-07-13 22:48:24,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2022-07-13 22:48:24,942 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:48:24,943 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:48:24,943 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:48:24,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:48:24,948 INFO L85 PathProgramCache]: Analyzing trace with hash 2109277801, now seen corresponding path program 1 times [2022-07-13 22:48:24,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:48:24,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23952722] [2022-07-13 22:48:24,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:48:24,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:48:25,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:25,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:48:25,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:25,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:48:25,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:25,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:48:25,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:25,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 22:48:25,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:25,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 22:48:25,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:48:25,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23952722] [2022-07-13 22:48:25,530 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2022-07-13 22:48:25,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1543762776] [2022-07-13 22:48:25,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:48:25,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:48:25,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:48:25,537 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:48:25,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-13 22:48:26,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:26,044 INFO L263 TraceCheckSpWp]: Trace formula consists of 2687 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-13 22:48:26,052 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:48:26,069 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 374 trivial. 0 not checked. [2022-07-13 22:48:26,069 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:48:26,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1543762776] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:48:26,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:48:26,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 22:48:26,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976495466] [2022-07-13 22:48:26,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:48:26,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-13 22:48:26,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:48:26,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-13 22:48:26,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 22:48:26,094 INFO L87 Difference]: Start difference. First operand has 246 states, 157 states have (on average 1.2101910828025477) internal successors, (190), 155 states have internal predecessors, (190), 68 states have call successors, (68), 22 states have call predecessors, (68), 22 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) Second operand has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-07-13 22:48:26,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:48:26,126 INFO L93 Difference]: Finished difference Result 486 states and 686 transitions. [2022-07-13 22:48:26,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-13 22:48:26,128 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 182 [2022-07-13 22:48:26,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:48:26,135 INFO L225 Difference]: With dead ends: 486 [2022-07-13 22:48:26,136 INFO L226 Difference]: Without dead ends: 239 [2022-07-13 22:48:26,139 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 22:48:26,141 INFO L413 NwaCegarLoop]: 318 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, 318 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 22:48:26,142 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 22:48:26,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2022-07-13 22:48:26,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2022-07-13 22:48:26,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 148 states have (on average 1.195945945945946) internal successors, (177), 149 states have internal predecessors, (177), 68 states have call successors, (68), 22 states have call predecessors, (68), 22 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2022-07-13 22:48:26,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 312 transitions. [2022-07-13 22:48:26,182 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 312 transitions. Word has length 182 [2022-07-13 22:48:26,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:48:26,183 INFO L495 AbstractCegarLoop]: Abstraction has 239 states and 312 transitions. [2022-07-13 22:48:26,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-07-13 22:48:26,184 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 312 transitions. [2022-07-13 22:48:26,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2022-07-13 22:48:26,186 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:48:26,187 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:48:26,209 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-13 22:48:26,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-07-13 22:48:26,407 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:48:26,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:48:26,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1716640621, now seen corresponding path program 1 times [2022-07-13 22:48:26,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:48:26,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139682420] [2022-07-13 22:48:26,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:48:26,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:48:26,490 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 22:48:26,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [483004056] [2022-07-13 22:48:26,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:48:26,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:48:26,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:48:26,508 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:48:26,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-13 22:48:26,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:26,978 INFO L263 TraceCheckSpWp]: Trace formula consists of 2687 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 22:48:26,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:48:27,082 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2022-07-13 22:48:27,082 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:48:27,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:48:27,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139682420] [2022-07-13 22:48:27,084 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 22:48:27,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [483004056] [2022-07-13 22:48:27,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [483004056] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:48:27,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:48:27,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 22:48:27,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872280603] [2022-07-13 22:48:27,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:48:27,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 22:48:27,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:48:27,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 22:48:27,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-13 22:48:27,089 INFO L87 Difference]: Start difference. First operand 239 states and 312 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 3 states have call successors, (31), 2 states have call predecessors, (31), 3 states have return successors, (28), 3 states have call predecessors, (28), 3 states have call successors, (28) [2022-07-13 22:48:27,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:48:27,269 INFO L93 Difference]: Finished difference Result 464 states and 608 transitions. [2022-07-13 22:48:27,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 22:48:27,270 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 3 states have call successors, (31), 2 states have call predecessors, (31), 3 states have return successors, (28), 3 states have call predecessors, (28), 3 states have call successors, (28) Word has length 182 [2022-07-13 22:48:27,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:48:27,273 INFO L225 Difference]: With dead ends: 464 [2022-07-13 22:48:27,273 INFO L226 Difference]: Without dead ends: 246 [2022-07-13 22:48:27,274 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-07-13 22:48:27,275 INFO L413 NwaCegarLoop]: 271 mSDtfsCounter, 325 mSDsluCounter, 764 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 1035 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 22:48:27,275 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 1035 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 22:48:27,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2022-07-13 22:48:27,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 246. [2022-07-13 22:48:27,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 153 states have (on average 1.196078431372549) internal successors, (183), 155 states have internal predecessors, (183), 69 states have call successors, (69), 22 states have call predecessors, (69), 23 states have return successors, (70), 68 states have call predecessors, (70), 68 states have call successors, (70) [2022-07-13 22:48:27,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 322 transitions. [2022-07-13 22:48:27,289 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 322 transitions. Word has length 182 [2022-07-13 22:48:27,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:48:27,289 INFO L495 AbstractCegarLoop]: Abstraction has 246 states and 322 transitions. [2022-07-13 22:48:27,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 3 states have call successors, (31), 2 states have call predecessors, (31), 3 states have return successors, (28), 3 states have call predecessors, (28), 3 states have call successors, (28) [2022-07-13 22:48:27,290 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 322 transitions. [2022-07-13 22:48:27,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2022-07-13 22:48:27,292 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:48:27,292 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:48:27,315 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-13 22:48:27,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2022-07-13 22:48:27,510 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:48:27,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:48:27,511 INFO L85 PathProgramCache]: Analyzing trace with hash 421077933, now seen corresponding path program 1 times [2022-07-13 22:48:27,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:48:27,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266160148] [2022-07-13 22:48:27,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:48:27,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:48:27,605 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 22:48:27,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [196439928] [2022-07-13 22:48:27,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:48:27,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:48:27,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:48:27,607 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:48:27,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-13 22:48:28,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:28,025 INFO L263 TraceCheckSpWp]: Trace formula consists of 2697 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-13 22:48:28,029 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:48:28,129 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 259 trivial. 0 not checked. [2022-07-13 22:48:28,130 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:48:28,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:48:28,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266160148] [2022-07-13 22:48:28,130 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 22:48:28,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [196439928] [2022-07-13 22:48:28,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [196439928] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:48:28,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:48:28,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 22:48:28,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720068844] [2022-07-13 22:48:28,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:48:28,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 22:48:28,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:48:28,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 22:48:28,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-13 22:48:28,132 INFO L87 Difference]: Start difference. First operand 246 states and 322 transitions. Second operand has 8 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 4 states have call successors, (29), 3 states have call predecessors, (29), 3 states have return successors, (26), 3 states have call predecessors, (26), 4 states have call successors, (26) [2022-07-13 22:48:28,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:48:28,361 INFO L93 Difference]: Finished difference Result 404 states and 531 transitions. [2022-07-13 22:48:28,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 22:48:28,361 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 4 states have call successors, (29), 3 states have call predecessors, (29), 3 states have return successors, (26), 3 states have call predecessors, (26), 4 states have call successors, (26) Word has length 182 [2022-07-13 22:48:28,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:48:28,363 INFO L225 Difference]: With dead ends: 404 [2022-07-13 22:48:28,363 INFO L226 Difference]: Without dead ends: 239 [2022-07-13 22:48:28,364 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-07-13 22:48:28,364 INFO L413 NwaCegarLoop]: 264 mSDtfsCounter, 321 mSDsluCounter, 1245 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 1509 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 22:48:28,365 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 1509 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 22:48:28,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2022-07-13 22:48:28,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2022-07-13 22:48:28,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 148 states have (on average 1.1891891891891893) internal successors, (176), 149 states have internal predecessors, (176), 68 states have call successors, (68), 22 states have call predecessors, (68), 22 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2022-07-13 22:48:28,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 311 transitions. [2022-07-13 22:48:28,376 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 311 transitions. Word has length 182 [2022-07-13 22:48:28,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:48:28,376 INFO L495 AbstractCegarLoop]: Abstraction has 239 states and 311 transitions. [2022-07-13 22:48:28,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 4 states have call successors, (29), 3 states have call predecessors, (29), 3 states have return successors, (26), 3 states have call predecessors, (26), 4 states have call successors, (26) [2022-07-13 22:48:28,377 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 311 transitions. [2022-07-13 22:48:28,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2022-07-13 22:48:28,378 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:48:28,379 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:48:28,401 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-13 22:48:28,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:48:28,601 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:48:28,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:48:28,601 INFO L85 PathProgramCache]: Analyzing trace with hash -238453589, now seen corresponding path program 1 times [2022-07-13 22:48:28,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:48:28,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77506574] [2022-07-13 22:48:28,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:48:28,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:48:28,666 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 22:48:28,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1431185026] [2022-07-13 22:48:28,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:48:28,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:48:28,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:48:28,667 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:48:28,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-13 22:48:29,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:29,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 2702 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-13 22:48:29,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:48:29,107 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2022-07-13 22:48:29,108 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:48:29,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:48:29,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77506574] [2022-07-13 22:48:29,108 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 22:48:29,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1431185026] [2022-07-13 22:48:29,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1431185026] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:48:29,108 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:48:29,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 22:48:29,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118323868] [2022-07-13 22:48:29,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:48:29,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 22:48:29,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:48:29,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 22:48:29,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 22:48:29,110 INFO L87 Difference]: Start difference. First operand 239 states and 311 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 2 states have call successors, (31), 2 states have call predecessors, (31), 3 states have return successors, (28), 3 states have call predecessors, (28), 2 states have call successors, (28) [2022-07-13 22:48:29,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:48:29,133 INFO L93 Difference]: Finished difference Result 474 states and 616 transitions. [2022-07-13 22:48:29,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 22:48:29,134 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 2 states have call successors, (31), 2 states have call predecessors, (31), 3 states have return successors, (28), 3 states have call predecessors, (28), 2 states have call successors, (28) Word has length 182 [2022-07-13 22:48:29,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:48:29,135 INFO L225 Difference]: With dead ends: 474 [2022-07-13 22:48:29,135 INFO L226 Difference]: Without dead ends: 244 [2022-07-13 22:48:29,136 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-13 22:48:29,136 INFO L413 NwaCegarLoop]: 308 mSDtfsCounter, 2 mSDsluCounter, 919 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1227 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 22:48:29,137 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1227 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 22:48:29,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2022-07-13 22:48:29,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 244. [2022-07-13 22:48:29,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 152 states have (on average 1.1842105263157894) internal successors, (180), 153 states have internal predecessors, (180), 68 states have call successors, (68), 22 states have call predecessors, (68), 23 states have return successors, (68), 68 states have call predecessors, (68), 67 states have call successors, (68) [2022-07-13 22:48:29,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 316 transitions. [2022-07-13 22:48:29,146 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 316 transitions. Word has length 182 [2022-07-13 22:48:29,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:48:29,146 INFO L495 AbstractCegarLoop]: Abstraction has 244 states and 316 transitions. [2022-07-13 22:48:29,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 2 states have call successors, (31), 2 states have call predecessors, (31), 3 states have return successors, (28), 3 states have call predecessors, (28), 2 states have call successors, (28) [2022-07-13 22:48:29,146 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 316 transitions. [2022-07-13 22:48:29,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2022-07-13 22:48:29,148 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:48:29,148 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:48:29,170 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-13 22:48:29,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:48:29,368 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:48:29,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:48:29,369 INFO L85 PathProgramCache]: Analyzing trace with hash -168770197, now seen corresponding path program 1 times [2022-07-13 22:48:29,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:48:29,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919386986] [2022-07-13 22:48:29,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:48:29,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:48:29,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:29,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:48:29,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:29,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:48:29,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:29,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:48:29,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:29,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 22:48:29,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:29,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 22:48:29,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:29,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:48:29,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:29,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:48:29,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:29,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:48:29,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:29,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-13 22:48:29,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:29,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 22:48:29,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:29,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:48:29,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:29,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 22:48:29,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:29,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-13 22:48:29,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:29,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-13 22:48:29,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:29,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-13 22:48:29,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:29,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-13 22:48:29,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:29,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-13 22:48:29,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:29,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-13 22:48:29,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:29,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:48:29,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:29,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:48:29,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:29,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:48:29,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:29,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-13 22:48:29,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:29,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-13 22:48:29,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:29,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-13 22:48:29,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:29,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-13 22:48:29,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:29,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-13 22:48:29,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:29,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-13 22:48:29,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:29,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-13 22:48:29,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:29,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-13 22:48:29,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:29,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-13 22:48:29,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:29,833 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 397 trivial. 0 not checked. [2022-07-13 22:48:29,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:48:29,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919386986] [2022-07-13 22:48:29,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919386986] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:48:29,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [318320738] [2022-07-13 22:48:29,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:48:29,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:48:29,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:48:29,835 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:48:29,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-13 22:48:30,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:30,309 INFO L263 TraceCheckSpWp]: Trace formula consists of 2710 conjuncts, 32 conjunts are in the unsatisfiable core [2022-07-13 22:48:30,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:48:30,428 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-13 22:48:30,614 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 198 proven. 0 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2022-07-13 22:48:30,614 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:48:30,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [318320738] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:48:30,614 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:48:30,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [13] total 21 [2022-07-13 22:48:30,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963406737] [2022-07-13 22:48:30,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:48:30,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-13 22:48:30,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:48:30,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-13 22:48:30,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2022-07-13 22:48:30,616 INFO L87 Difference]: Start difference. First operand 244 states and 316 transitions. Second operand has 11 states, 11 states have (on average 8.090909090909092) internal successors, (89), 9 states have internal predecessors, (89), 4 states have call successors, (33), 3 states have call predecessors, (33), 4 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) [2022-07-13 22:48:30,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:48:30,703 INFO L93 Difference]: Finished difference Result 474 states and 611 transitions. [2022-07-13 22:48:30,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 22:48:30,703 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.090909090909092) internal successors, (89), 9 states have internal predecessors, (89), 4 states have call successors, (33), 3 states have call predecessors, (33), 4 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) Word has length 194 [2022-07-13 22:48:30,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:48:30,705 INFO L225 Difference]: With dead ends: 474 [2022-07-13 22:48:30,705 INFO L226 Difference]: Without dead ends: 248 [2022-07-13 22:48:30,706 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=393, Unknown=0, NotChecked=0, Total=462 [2022-07-13 22:48:30,706 INFO L413 NwaCegarLoop]: 303 mSDtfsCounter, 35 mSDsluCounter, 1359 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 1662 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 79 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 22:48:30,707 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 1662 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 79 Unchecked, 0.1s Time] [2022-07-13 22:48:30,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2022-07-13 22:48:30,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 248. [2022-07-13 22:48:30,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 156 states have (on average 1.1794871794871795) internal successors, (184), 156 states have internal predecessors, (184), 68 states have call successors, (68), 23 states have call predecessors, (68), 23 states have return successors, (68), 68 states have call predecessors, (68), 67 states have call successors, (68) [2022-07-13 22:48:30,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 320 transitions. [2022-07-13 22:48:30,717 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 320 transitions. Word has length 194 [2022-07-13 22:48:30,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:48:30,718 INFO L495 AbstractCegarLoop]: Abstraction has 248 states and 320 transitions. [2022-07-13 22:48:30,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.090909090909092) internal successors, (89), 9 states have internal predecessors, (89), 4 states have call successors, (33), 3 states have call predecessors, (33), 4 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) [2022-07-13 22:48:30,718 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 320 transitions. [2022-07-13 22:48:30,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2022-07-13 22:48:30,719 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:48:30,720 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:48:30,740 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-07-13 22:48:30,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:48:30,940 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:48:30,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:48:30,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1760895517, now seen corresponding path program 1 times [2022-07-13 22:48:30,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:48:30,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231253893] [2022-07-13 22:48:30,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:48:30,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:48:30,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:31,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:48:31,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:31,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:48:31,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:31,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:48:31,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:31,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 22:48:31,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:31,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 22:48:31,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:31,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:48:31,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:31,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:48:31,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:31,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:48:31,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:31,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-13 22:48:31,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:31,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 22:48:31,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:31,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:48:31,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:31,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 22:48:31,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:31,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 22:48:31,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:31,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-13 22:48:31,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:31,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-13 22:48:31,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:31,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-13 22:48:31,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:31,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-13 22:48:31,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:31,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-13 22:48:31,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:31,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-13 22:48:31,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:31,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:48:31,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:31,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:48:31,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:31,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:48:31,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:31,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-13 22:48:31,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:31,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-13 22:48:31,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:31,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-13 22:48:31,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:31,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-13 22:48:31,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:31,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-13 22:48:31,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:31,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-13 22:48:31,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:31,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-13 22:48:31,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:31,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-07-13 22:48:31,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:31,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-13 22:48:31,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:31,277 INFO L134 CoverageAnalysis]: Checked inductivity of 413 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2022-07-13 22:48:31,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:48:31,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231253893] [2022-07-13 22:48:31,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231253893] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:48:31,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [260689146] [2022-07-13 22:48:31,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:48:31,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:48:31,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:48:31,279 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:48:31,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-13 22:48:31,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:31,754 INFO L263 TraceCheckSpWp]: Trace formula consists of 2734 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-13 22:48:31,758 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:48:32,562 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((aws_hash_table_is_valid_~map.base Int) (aws_hash_table_is_valid_~map.offset Int)) (not (= 0 (select (select |c_#memory_$Pointer$.offset| aws_hash_table_is_valid_~map.base) aws_hash_table_is_valid_~map.offset)))) (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 [2022-07-13 22:48:38,299 INFO L134 CoverageAnalysis]: Checked inductivity of 413 backedges. 196 proven. 0 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2022-07-13 22:48:38,300 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:48:38,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [260689146] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:48:38,300 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:48:38,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 16 [2022-07-13 22:48:38,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49790999] [2022-07-13 22:48:38,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:48:38,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 22:48:38,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:48:38,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 22:48:38,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=175, Unknown=3, NotChecked=26, Total=240 [2022-07-13 22:48:38,302 INFO L87 Difference]: Start difference. First operand 248 states and 320 transitions. Second operand has 8 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 3 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (31), 2 states have call predecessors, (31), 3 states have call successors, (31) [2022-07-13 22:48:38,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:48:38,460 INFO L93 Difference]: Finished difference Result 476 states and 619 transitions. [2022-07-13 22:48:38,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 22:48:38,460 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 3 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (31), 2 states have call predecessors, (31), 3 states have call successors, (31) Word has length 200 [2022-07-13 22:48:38,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:48:38,461 INFO L225 Difference]: With dead ends: 476 [2022-07-13 22:48:38,461 INFO L226 Difference]: Without dead ends: 251 [2022-07-13 22:48:38,462 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=51, Invalid=222, Unknown=3, NotChecked=30, Total=306 [2022-07-13 22:48:38,463 INFO L413 NwaCegarLoop]: 306 mSDtfsCounter, 5 mSDsluCounter, 1362 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1668 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 429 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 22:48:38,463 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1668 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 429 Unchecked, 0.1s Time] [2022-07-13 22:48:38,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2022-07-13 22:48:38,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 250. [2022-07-13 22:48:38,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 158 states have (on average 1.1772151898734178) internal successors, (186), 157 states have internal predecessors, (186), 68 states have call successors, (68), 24 states have call predecessors, (68), 23 states have return successors, (68), 68 states have call predecessors, (68), 67 states have call successors, (68) [2022-07-13 22:48:38,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 322 transitions. [2022-07-13 22:48:38,471 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 322 transitions. Word has length 200 [2022-07-13 22:48:38,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:48:38,472 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 322 transitions. [2022-07-13 22:48:38,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 3 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (31), 2 states have call predecessors, (31), 3 states have call successors, (31) [2022-07-13 22:48:38,473 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 322 transitions. [2022-07-13 22:48:38,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2022-07-13 22:48:38,474 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:48:38,474 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:48:38,497 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-13 22:48:38,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:48:38,675 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:48:38,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:48:38,676 INFO L85 PathProgramCache]: Analyzing trace with hash -661330404, now seen corresponding path program 1 times [2022-07-13 22:48:38,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:48:38,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141589154] [2022-07-13 22:48:38,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:48:38,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:48:38,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:38,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:48:38,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:38,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:48:38,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:38,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:48:38,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:38,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 22:48:38,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:38,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 22:48:38,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:38,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:48:38,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:38,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:48:38,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:38,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:48:38,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:38,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-13 22:48:38,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:38,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 22:48:38,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:38,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:48:38,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:38,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 22:48:38,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:38,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 22:48:38,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:38,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:48:38,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:39,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-13 22:48:39,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:39,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-13 22:48:39,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:39,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-13 22:48:39,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:39,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-13 22:48:39,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:39,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-13 22:48:39,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:39,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-13 22:48:39,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:39,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:48:39,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:39,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:48:39,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:39,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:48:39,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:39,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-13 22:48:39,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:39,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-13 22:48:39,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:39,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-13 22:48:39,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:39,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-13 22:48:39,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:39,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-13 22:48:39,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:39,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-13 22:48:39,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:39,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-07-13 22:48:39,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:39,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-13 22:48:39,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:39,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2022-07-13 22:48:39,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:39,118 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 375 trivial. 0 not checked. [2022-07-13 22:48:39,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:48:39,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141589154] [2022-07-13 22:48:39,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141589154] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:48:39,119 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:48:39,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-13 22:48:39,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457015268] [2022-07-13 22:48:39,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:48:39,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 22:48:39,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:48:39,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 22:48:39,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-13 22:48:39,121 INFO L87 Difference]: Start difference. First operand 250 states and 322 transitions. Second operand has 9 states, 8 states have (on average 9.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (32), 5 states have call predecessors, (32), 3 states have return successors, (29), 3 states have call predecessors, (29), 2 states have call successors, (29) [2022-07-13 22:48:39,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:48:39,876 INFO L93 Difference]: Finished difference Result 408 states and 531 transitions. [2022-07-13 22:48:39,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 22:48:39,877 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 9.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (32), 5 states have call predecessors, (32), 3 states have return successors, (29), 3 states have call predecessors, (29), 2 states have call successors, (29) Word has length 205 [2022-07-13 22:48:39,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:48:39,879 INFO L225 Difference]: With dead ends: 408 [2022-07-13 22:48:39,879 INFO L226 Difference]: Without dead ends: 262 [2022-07-13 22:48:39,880 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-07-13 22:48:39,880 INFO L413 NwaCegarLoop]: 243 mSDtfsCounter, 332 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 1085 mSolverCounterSat, 291 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 701 SdHoareTripleChecker+Invalid, 1376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 291 IncrementalHoareTripleChecker+Valid, 1085 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-13 22:48:39,880 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [370 Valid, 701 Invalid, 1376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [291 Valid, 1085 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-13 22:48:39,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2022-07-13 22:48:39,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 252. [2022-07-13 22:48:39,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 159 states have (on average 1.1761006289308176) internal successors, (187), 159 states have internal predecessors, (187), 68 states have call successors, (68), 24 states have call predecessors, (68), 24 states have return successors, (70), 68 states have call predecessors, (70), 67 states have call successors, (70) [2022-07-13 22:48:39,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 325 transitions. [2022-07-13 22:48:39,900 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 325 transitions. Word has length 205 [2022-07-13 22:48:39,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:48:39,902 INFO L495 AbstractCegarLoop]: Abstraction has 252 states and 325 transitions. [2022-07-13 22:48:39,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 9.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (32), 5 states have call predecessors, (32), 3 states have return successors, (29), 3 states have call predecessors, (29), 2 states have call successors, (29) [2022-07-13 22:48:39,902 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 325 transitions. [2022-07-13 22:48:39,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2022-07-13 22:48:39,905 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:48:39,905 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:48:39,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-13 22:48:39,906 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:48:39,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:48:39,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1796534111, now seen corresponding path program 1 times [2022-07-13 22:48:39,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:48:39,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202758938] [2022-07-13 22:48:39,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:48:39,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:48:39,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:40,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:48:40,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:40,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:48:40,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:40,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:48:40,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:40,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 22:48:40,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:40,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 22:48:40,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:40,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:48:40,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:40,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:48:40,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:40,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:48:40,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:40,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-13 22:48:40,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:40,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 22:48:40,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:40,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:48:40,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:40,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 22:48:40,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:40,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 22:48:40,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:40,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:48:40,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:40,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-13 22:48:40,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:40,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-13 22:48:40,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:40,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-13 22:48:40,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:40,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-13 22:48:40,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:40,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-13 22:48:40,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:40,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-13 22:48:40,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:40,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:48:40,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:40,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:48:40,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:40,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:48:40,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:40,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-13 22:48:40,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:40,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-13 22:48:40,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:40,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-13 22:48:40,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:40,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-13 22:48:40,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:40,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-13 22:48:40,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:40,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-13 22:48:40,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:40,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-07-13 22:48:40,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:40,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-13 22:48:40,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:40,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:48:40,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:40,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2022-07-13 22:48:40,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:40,563 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 407 trivial. 0 not checked. [2022-07-13 22:48:40,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:48:40,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202758938] [2022-07-13 22:48:40,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202758938] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:48:40,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:48:40,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-07-13 22:48:40,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765234248] [2022-07-13 22:48:40,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:48:40,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-13 22:48:40,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:48:40,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-13 22:48:40,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2022-07-13 22:48:40,566 INFO L87 Difference]: Start difference. First operand 252 states and 325 transitions. Second operand has 16 states, 14 states have (on average 5.5) internal successors, (77), 12 states have internal predecessors, (77), 6 states have call successors, (33), 6 states have call predecessors, (33), 3 states have return successors, (30), 4 states have call predecessors, (30), 5 states have call successors, (30) [2022-07-13 22:48:42,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:48:42,128 INFO L93 Difference]: Finished difference Result 424 states and 554 transitions. [2022-07-13 22:48:42,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-13 22:48:42,128 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 5.5) internal successors, (77), 12 states have internal predecessors, (77), 6 states have call successors, (33), 6 states have call predecessors, (33), 3 states have return successors, (30), 4 states have call predecessors, (30), 5 states have call successors, (30) Word has length 210 [2022-07-13 22:48:42,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:48:42,130 INFO L225 Difference]: With dead ends: 424 [2022-07-13 22:48:42,130 INFO L226 Difference]: Without dead ends: 269 [2022-07-13 22:48:42,131 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=134, Invalid=622, Unknown=0, NotChecked=0, Total=756 [2022-07-13 22:48:42,132 INFO L413 NwaCegarLoop]: 249 mSDtfsCounter, 372 mSDsluCounter, 974 mSDsCounter, 0 mSdLazyCounter, 2505 mSolverCounterSat, 316 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 1223 SdHoareTripleChecker+Invalid, 2821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 316 IncrementalHoareTripleChecker+Valid, 2505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-13 22:48:42,132 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 1223 Invalid, 2821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [316 Valid, 2505 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-07-13 22:48:42,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2022-07-13 22:48:42,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 255. [2022-07-13 22:48:42,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 161 states have (on average 1.173913043478261) internal successors, (189), 162 states have internal predecessors, (189), 68 states have call successors, (68), 24 states have call predecessors, (68), 25 states have return successors, (73), 68 states have call predecessors, (73), 67 states have call successors, (73) [2022-07-13 22:48:42,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 330 transitions. [2022-07-13 22:48:42,149 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 330 transitions. Word has length 210 [2022-07-13 22:48:42,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:48:42,157 INFO L495 AbstractCegarLoop]: Abstraction has 255 states and 330 transitions. [2022-07-13 22:48:42,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 5.5) internal successors, (77), 12 states have internal predecessors, (77), 6 states have call successors, (33), 6 states have call predecessors, (33), 3 states have return successors, (30), 4 states have call predecessors, (30), 5 states have call successors, (30) [2022-07-13 22:48:42,157 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 330 transitions. [2022-07-13 22:48:42,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2022-07-13 22:48:42,159 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:48:42,159 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:48:42,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-13 22:48:42,159 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:48:42,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:48:42,159 INFO L85 PathProgramCache]: Analyzing trace with hash -130056786, now seen corresponding path program 2 times [2022-07-13 22:48:42,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:48:42,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923743653] [2022-07-13 22:48:42,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:48:42,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:48:42,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:42,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:48:42,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:42,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:48:42,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:42,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:48:42,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:42,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 22:48:42,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:42,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 22:48:42,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:42,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:48:42,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:42,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:48:42,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:42,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:48:42,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:42,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-13 22:48:42,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:42,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 22:48:42,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:42,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:48:42,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:42,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 22:48:42,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:42,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 22:48:42,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:42,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:48:42,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:42,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-13 22:48:42,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:42,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-13 22:48:42,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:42,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-13 22:48:42,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:42,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-13 22:48:42,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:42,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-13 22:48:42,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:42,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-13 22:48:42,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:42,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:48:42,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:42,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:48:42,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:42,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:48:42,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:42,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-13 22:48:42,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:42,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-13 22:48:42,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:42,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-13 22:48:42,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:42,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-13 22:48:42,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:42,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-13 22:48:42,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:42,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 22:48:42,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:42,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:48:42,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:42,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-07-13 22:48:42,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:42,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-07-13 22:48:42,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:42,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2022-07-13 22:48:42,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:42,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:48:42,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:42,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2022-07-13 22:48:42,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:42,733 INFO L134 CoverageAnalysis]: Checked inductivity of 447 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 428 trivial. 0 not checked. [2022-07-13 22:48:42,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:48:42,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923743653] [2022-07-13 22:48:42,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923743653] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:48:42,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1607998694] [2022-07-13 22:48:42,733 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 22:48:42,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:48:42,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:48:42,735 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:48:42,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-13 22:48:43,139 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-13 22:48:43,139 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 22:48:43,145 INFO L263 TraceCheckSpWp]: Trace formula consists of 1784 conjuncts, 22 conjunts are in the unsatisfiable core [2022-07-13 22:48:43,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:48:43,242 INFO L134 CoverageAnalysis]: Checked inductivity of 447 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 447 trivial. 0 not checked. [2022-07-13 22:48:43,242 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:48:43,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1607998694] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:48:43,243 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:48:43,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 18 [2022-07-13 22:48:43,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710529878] [2022-07-13 22:48:43,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:48:43,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 22:48:43,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:48:43,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 22:48:43,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2022-07-13 22:48:43,244 INFO L87 Difference]: Start difference. First operand 255 states and 330 transitions. Second operand has 5 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2022-07-13 22:48:43,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:48:43,279 INFO L93 Difference]: Finished difference Result 263 states and 337 transitions. [2022-07-13 22:48:43,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 22:48:43,280 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 221 [2022-07-13 22:48:43,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:48:43,283 INFO L225 Difference]: With dead ends: 263 [2022-07-13 22:48:43,283 INFO L226 Difference]: Without dead ends: 261 [2022-07-13 22:48:43,284 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2022-07-13 22:48:43,285 INFO L413 NwaCegarLoop]: 310 mSDtfsCounter, 12 mSDsluCounter, 902 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 1212 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 [2022-07-13 22:48:43,285 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 1212 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 22:48:43,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2022-07-13 22:48:43,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 259. [2022-07-13 22:48:43,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 164 states have (on average 1.170731707317073) internal successors, (192), 165 states have internal predecessors, (192), 68 states have call successors, (68), 25 states have call predecessors, (68), 26 states have return successors, (73), 68 states have call predecessors, (73), 67 states have call successors, (73) [2022-07-13 22:48:43,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 333 transitions. [2022-07-13 22:48:43,298 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 333 transitions. Word has length 221 [2022-07-13 22:48:43,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:48:43,299 INFO L495 AbstractCegarLoop]: Abstraction has 259 states and 333 transitions. [2022-07-13 22:48:43,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2022-07-13 22:48:43,299 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 333 transitions. [2022-07-13 22:48:43,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2022-07-13 22:48:43,301 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:48:43,301 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:48:43,322 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-07-13 22:48:43,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:48:43,509 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:48:43,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:48:43,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1053277728, now seen corresponding path program 1 times [2022-07-13 22:48:43,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:48:43,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400544362] [2022-07-13 22:48:43,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:48:43,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:48:43,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:43,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:48:43,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:43,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:48:43,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:43,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:48:43,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:43,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 22:48:43,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:43,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 22:48:43,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:43,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:48:43,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:43,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:48:43,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:43,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:48:43,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:43,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-13 22:48:43,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:43,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 22:48:43,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:43,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:48:43,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:43,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 22:48:43,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:43,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 22:48:43,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:43,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:48:43,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:43,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-13 22:48:43,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:43,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-13 22:48:43,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:43,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-13 22:48:43,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:43,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-13 22:48:43,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:43,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-13 22:48:43,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:43,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-13 22:48:43,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:43,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:48:43,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:43,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:48:43,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:43,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:48:43,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:43,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-13 22:48:43,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:43,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-13 22:48:43,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:43,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-13 22:48:43,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:43,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-13 22:48:43,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:43,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-13 22:48:44,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:44,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 22:48:44,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:44,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:48:44,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:44,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-07-13 22:48:44,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:44,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-07-13 22:48:44,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:44,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2022-07-13 22:48:44,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:44,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:48:44,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:44,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2022-07-13 22:48:44,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:44,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2022-07-13 22:48:44,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:44,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2022-07-13 22:48:44,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:44,195 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 428 trivial. 0 not checked. [2022-07-13 22:48:44,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:48:44,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400544362] [2022-07-13 22:48:44,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400544362] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:48:44,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1591147597] [2022-07-13 22:48:44,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:48:44,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:48:44,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:48:44,197 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:48:44,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-13 22:48:44,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:44,768 INFO L263 TraceCheckSpWp]: Trace formula consists of 2879 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-13 22:48:44,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:48:44,891 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 32 proven. 9 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2022-07-13 22:48:44,891 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:48:45,086 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 447 trivial. 0 not checked. [2022-07-13 22:48:45,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1591147597] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-13 22:48:45,088 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-13 22:48:45,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [16, 8] total 24 [2022-07-13 22:48:45,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023314344] [2022-07-13 22:48:45,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:48:45,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 22:48:45,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:48:45,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 22:48:45,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=498, Unknown=0, NotChecked=0, Total=552 [2022-07-13 22:48:45,092 INFO L87 Difference]: Start difference. First operand 259 states and 333 transitions. Second operand has 5 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2022-07-13 22:48:45,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:48:45,152 INFO L93 Difference]: Finished difference Result 267 states and 340 transitions. [2022-07-13 22:48:45,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 22:48:45,152 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 234 [2022-07-13 22:48:45,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:48:45,154 INFO L225 Difference]: With dead ends: 267 [2022-07-13 22:48:45,154 INFO L226 Difference]: Without dead ends: 265 [2022-07-13 22:48:45,154 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 553 GetRequests, 530 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=542, Unknown=0, NotChecked=0, Total=600 [2022-07-13 22:48:45,155 INFO L413 NwaCegarLoop]: 312 mSDtfsCounter, 6 mSDsluCounter, 910 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 1222 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 22:48:45,155 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 1222 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 22:48:45,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2022-07-13 22:48:45,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 263. [2022-07-13 22:48:45,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 167 states have (on average 1.1676646706586826) internal successors, (195), 168 states have internal predecessors, (195), 68 states have call successors, (68), 26 states have call predecessors, (68), 27 states have return successors, (73), 68 states have call predecessors, (73), 67 states have call successors, (73) [2022-07-13 22:48:45,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 336 transitions. [2022-07-13 22:48:45,185 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 336 transitions. Word has length 234 [2022-07-13 22:48:45,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:48:45,186 INFO L495 AbstractCegarLoop]: Abstraction has 263 states and 336 transitions. [2022-07-13 22:48:45,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2022-07-13 22:48:45,187 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 336 transitions. [2022-07-13 22:48:45,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2022-07-13 22:48:45,190 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:48:45,190 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:48:45,228 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-13 22:48:45,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-07-13 22:48:45,395 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:48:45,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:48:45,396 INFO L85 PathProgramCache]: Analyzing trace with hash -2025730660, now seen corresponding path program 1 times [2022-07-13 22:48:45,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:48:45,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172835527] [2022-07-13 22:48:45,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:48:45,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:48:45,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:45,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:48:45,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:45,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:48:45,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:45,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:48:45,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:45,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 22:48:45,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:45,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 22:48:45,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:45,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:48:45,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:45,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:48:45,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:45,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:48:45,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:45,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-13 22:48:45,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:45,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 22:48:45,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:45,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:48:45,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:45,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 22:48:45,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:45,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 22:48:45,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:45,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:48:45,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:45,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-13 22:48:45,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:45,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-13 22:48:45,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:45,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-13 22:48:45,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:45,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-13 22:48:45,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:45,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-13 22:48:45,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:45,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-13 22:48:45,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:45,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:48:45,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:45,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:48:45,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:45,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:48:45,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:45,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-13 22:48:45,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:45,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-13 22:48:45,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:45,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-13 22:48:45,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:45,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-13 22:48:45,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:45,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-13 22:48:45,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:45,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 22:48:45,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:45,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:48:45,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:45,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-07-13 22:48:45,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:46,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-07-13 22:48:46,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:46,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-07-13 22:48:46,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:46,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:48:46,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:46,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:48:46,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:46,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 22:48:46,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:46,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2022-07-13 22:48:46,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:46,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2022-07-13 22:48:46,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:46,086 INFO L134 CoverageAnalysis]: Checked inductivity of 468 backedges. 14 proven. 17 refuted. 0 times theorem prover too weak. 437 trivial. 0 not checked. [2022-07-13 22:48:46,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:48:46,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172835527] [2022-07-13 22:48:46,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172835527] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:48:46,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1633124105] [2022-07-13 22:48:46,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:48:46,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:48:46,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:48:46,103 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:48:46,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-13 22:48:46,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:46,652 INFO L263 TraceCheckSpWp]: Trace formula consists of 2969 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 22:48:46,657 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:48:46,703 INFO L134 CoverageAnalysis]: Checked inductivity of 468 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 447 trivial. 0 not checked. [2022-07-13 22:48:46,703 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:48:46,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1633124105] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:48:46,703 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:48:46,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [16] total 19 [2022-07-13 22:48:46,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205132303] [2022-07-13 22:48:46,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:48:46,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 22:48:46,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:48:46,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 22:48:46,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2022-07-13 22:48:46,705 INFO L87 Difference]: Start difference. First operand 263 states and 336 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (34), 2 states have call predecessors, (34), 3 states have return successors, (32), 3 states have call predecessors, (32), 2 states have call successors, (32) [2022-07-13 22:48:46,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:48:46,726 INFO L93 Difference]: Finished difference Result 345 states and 437 transitions. [2022-07-13 22:48:46,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 22:48:46,727 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (34), 2 states have call predecessors, (34), 3 states have return successors, (32), 3 states have call predecessors, (32), 2 states have call successors, (32) Word has length 241 [2022-07-13 22:48:46,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:48:46,729 INFO L225 Difference]: With dead ends: 345 [2022-07-13 22:48:46,729 INFO L226 Difference]: Without dead ends: 272 [2022-07-13 22:48:46,729 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 310 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2022-07-13 22:48:46,730 INFO L413 NwaCegarLoop]: 312 mSDtfsCounter, 3 mSDsluCounter, 929 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1241 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 22:48:46,730 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1241 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 22:48:46,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2022-07-13 22:48:46,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 267. [2022-07-13 22:48:46,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 170 states have (on average 1.1647058823529413) internal successors, (198), 171 states have internal predecessors, (198), 68 states have call successors, (68), 26 states have call predecessors, (68), 28 states have return successors, (74), 69 states have call predecessors, (74), 67 states have call successors, (74) [2022-07-13 22:48:46,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 340 transitions. [2022-07-13 22:48:46,741 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 340 transitions. Word has length 241 [2022-07-13 22:48:46,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:48:46,741 INFO L495 AbstractCegarLoop]: Abstraction has 267 states and 340 transitions. [2022-07-13 22:48:46,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (34), 2 states have call predecessors, (34), 3 states have return successors, (32), 3 states have call predecessors, (32), 2 states have call successors, (32) [2022-07-13 22:48:46,742 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 340 transitions. [2022-07-13 22:48:46,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2022-07-13 22:48:46,743 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:48:46,743 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:48:46,767 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-13 22:48:46,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:48:46,959 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:48:46,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:48:46,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1682430622, now seen corresponding path program 1 times [2022-07-13 22:48:46,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:48:46,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969114471] [2022-07-13 22:48:46,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:48:46,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:48:47,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:47,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:48:47,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:47,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:48:47,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:47,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:48:47,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:47,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 22:48:47,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:47,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 22:48:47,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:47,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:48:47,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:47,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:48:47,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:47,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:48:47,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:47,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-13 22:48:47,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:47,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 22:48:47,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:47,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:48:47,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:47,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 22:48:47,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:47,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 22:48:47,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:47,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:48:47,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:47,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-13 22:48:47,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:47,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-13 22:48:47,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:47,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-13 22:48:47,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:47,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-13 22:48:47,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:47,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-13 22:48:47,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:47,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-13 22:48:47,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:47,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:48:47,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:47,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:48:47,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:47,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:48:47,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:47,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-13 22:48:47,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:47,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-13 22:48:47,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:47,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-13 22:48:47,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:47,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-13 22:48:47,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:47,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-13 22:48:47,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:47,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 22:48:47,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:47,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:48:47,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:47,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-07-13 22:48:47,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:47,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-07-13 22:48:47,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:47,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-07-13 22:48:47,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:47,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:48:47,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:47,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:48:47,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:47,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 22:48:47,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:47,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2022-07-13 22:48:47,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:47,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2022-07-13 22:48:47,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:47,618 INFO L134 CoverageAnalysis]: Checked inductivity of 468 backedges. 14 proven. 17 refuted. 0 times theorem prover too weak. 437 trivial. 0 not checked. [2022-07-13 22:48:47,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:48:47,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969114471] [2022-07-13 22:48:47,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969114471] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:48:47,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [822454467] [2022-07-13 22:48:47,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:48:47,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:48:47,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:48:47,620 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:48:47,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-13 22:48:48,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:48:48,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 2968 conjuncts, 96 conjunts are in the unsatisfiable core [2022-07-13 22:48:48,410 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:48:48,568 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-13 22:48:48,951 INFO L356 Elim1Store]: treesize reduction 45, result has 19.6 percent of original size [2022-07-13 22:48:48,952 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-13 22:48:48,974 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-13 22:48:49,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-07-13 22:48:49,153 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: |v_#memory_$Pointer$.base_95| input size 50 context size 50 output size 50 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:364) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:427) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:182) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:164) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:152) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:122) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:764) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:725) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:643) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:335) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:176) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:265) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:251) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-13 22:48:49,156 INFO L158 Benchmark]: Toolchain (without parser) took 27760.84ms. Allocated memory was 107.0MB in the beginning and 520.1MB in the end (delta: 413.1MB). Free memory was 64.5MB in the beginning and 382.2MB in the end (delta: -317.7MB). Peak memory consumption was 94.4MB. Max. memory is 16.1GB. [2022-07-13 22:48:49,157 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 107.0MB. Free memory was 61.5MB in the beginning and 61.4MB in the end (delta: 47.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 22:48:49,157 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1997.92ms. Allocated memory was 107.0MB in the beginning and 203.4MB in the end (delta: 96.5MB). Free memory was 64.3MB in the beginning and 143.3MB in the end (delta: -79.0MB). Peak memory consumption was 79.6MB. Max. memory is 16.1GB. [2022-07-13 22:48:49,157 INFO L158 Benchmark]: Boogie Procedure Inliner took 144.47ms. Allocated memory is still 203.4MB. Free memory was 143.3MB in the beginning and 130.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-13 22:48:49,157 INFO L158 Benchmark]: Boogie Preprocessor took 115.24ms. Allocated memory is still 203.4MB. Free memory was 130.7MB in the beginning and 123.3MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-13 22:48:49,157 INFO L158 Benchmark]: RCFGBuilder took 1200.14ms. Allocated memory is still 203.4MB. Free memory was 122.3MB in the beginning and 69.5MB in the end (delta: 52.7MB). Peak memory consumption was 52.7MB. Max. memory is 16.1GB. [2022-07-13 22:48:49,157 INFO L158 Benchmark]: TraceAbstraction took 24295.69ms. Allocated memory was 203.4MB in the beginning and 520.1MB in the end (delta: 316.7MB). Free memory was 69.5MB in the beginning and 382.2MB in the end (delta: -312.6MB). Peak memory consumption was 4.0MB. Max. memory is 16.1GB. [2022-07-13 22:48:49,158 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.10ms. Allocated memory is still 107.0MB. Free memory was 61.5MB in the beginning and 61.4MB in the end (delta: 47.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1997.92ms. Allocated memory was 107.0MB in the beginning and 203.4MB in the end (delta: 96.5MB). Free memory was 64.3MB in the beginning and 143.3MB in the end (delta: -79.0MB). Peak memory consumption was 79.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 144.47ms. Allocated memory is still 203.4MB. Free memory was 143.3MB in the beginning and 130.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 115.24ms. Allocated memory is still 203.4MB. Free memory was 130.7MB in the beginning and 123.3MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1200.14ms. Allocated memory is still 203.4MB. Free memory was 122.3MB in the beginning and 69.5MB in the end (delta: 52.7MB). Peak memory consumption was 52.7MB. Max. memory is 16.1GB. * TraceAbstraction took 24295.69ms. Allocated memory was 203.4MB in the beginning and 520.1MB in the end (delta: 316.7MB). Free memory was 69.5MB in the beginning and 382.2MB in the end (delta: -312.6MB). Peak memory consumption was 4.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: |v_#memory_$Pointer$.base_95| input size 50 context size 50 output size 50 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: |v_#memory_$Pointer$.base_95| input size 50 context size 50 output size 50: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:364) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-13 22:48:49,197 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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_find_harness.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.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 b2aa49e297f60cfce052f243c4868c3f21a4b7a15679d0734b9f9fae5c35ea17 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 22:48:50,898 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 22:48:50,901 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 22:48:50,935 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 22:48:50,935 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 22:48:50,937 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 22:48:50,940 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 22:48:50,943 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 22:48:50,945 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 22:48:50,949 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 22:48:50,950 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 22:48:50,954 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 22:48:50,955 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 22:48:50,956 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 22:48:50,957 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 22:48:50,960 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 22:48:50,961 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 22:48:50,962 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 22:48:50,963 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 22:48:50,969 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 22:48:50,970 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 22:48:50,971 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 22:48:50,973 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 22:48:50,973 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 22:48:50,974 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 22:48:50,981 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 22:48:50,981 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 22:48:50,981 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 22:48:50,982 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 22:48:50,983 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 22:48:50,984 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 22:48:50,984 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 22:48:50,985 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 22:48:50,986 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 22:48:50,987 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 22:48:50,988 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 22:48:50,988 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 22:48:50,990 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 22:48:50,990 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 22:48:50,990 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 22:48:50,991 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 22:48:50,992 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 22:48:50,997 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-07-13 22:48:51,027 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 22:48:51,028 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 22:48:51,028 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 22:48:51,029 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 22:48:51,029 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 22:48:51,029 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 22:48:51,030 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 22:48:51,030 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 22:48:51,030 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 22:48:51,031 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 22:48:51,031 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 22:48:51,031 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 22:48:51,032 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 22:48:51,039 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 22:48:51,039 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-13 22:48:51,039 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-13 22:48:51,039 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-13 22:48:51,040 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 22:48:51,040 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 22:48:51,040 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 22:48:51,040 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 22:48:51,040 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 22:48:51,041 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 22:48:51,041 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 22:48:51,041 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 22:48:51,041 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 22:48:51,041 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 22:48:51,042 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-13 22:48:51,042 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-13 22:48:51,042 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 22:48:51,042 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 22:48:51,042 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 22:48:51,043 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-13 22:48:51,043 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 -> b2aa49e297f60cfce052f243c4868c3f21a4b7a15679d0734b9f9fae5c35ea17 [2022-07-13 22:48:51,318 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 22:48:51,348 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 22:48:51,351 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 22:48:51,352 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 22:48:51,352 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 22:48:51,353 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_find_harness.i [2022-07-13 22:48:51,411 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e3d72c99/1738a3d3541a4f0e8b1cec46b3f03d4c/FLAGbf59948d9 [2022-07-13 22:48:51,934 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 22:48:51,934 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_find_harness.i [2022-07-13 22:48:51,957 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e3d72c99/1738a3d3541a4f0e8b1cec46b3f03d4c/FLAGbf59948d9 [2022-07-13 22:48:52,399 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e3d72c99/1738a3d3541a4f0e8b1cec46b3f03d4c [2022-07-13 22:48:52,400 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 22:48:52,401 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 22:48:52,403 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 22:48:52,403 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 22:48:52,406 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 22:48:52,406 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 10:48:52" (1/1) ... [2022-07-13 22:48:52,407 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27952471 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:48:52, skipping insertion in model container [2022-07-13 22:48:52,407 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 10:48:52" (1/1) ... [2022-07-13 22:48:52,411 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 22:48:52,523 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 22:48:52,733 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_find_harness.i[4493,4506] [2022-07-13 22:48:52,739 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_find_harness.i[4553,4566] [2022-07-13 22:48:53,286 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:48:53,287 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:48:53,287 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:48:53,288 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:48:53,288 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:48:53,298 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:48:53,299 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:48:53,300 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:48:53,301 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:48:53,302 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:48:53,302 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:48:53,302 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:48:53,303 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:48:53,531 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-13 22:48:53,532 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-13 22:48:53,533 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-13 22:48:53,534 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-13 22:48:53,534 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-13 22:48:53,535 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-13 22:48:53,535 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-13 22:48:53,536 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-13 22:48:53,536 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-13 22:48:53,537 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-13 22:48:53,628 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-13 22:48:53,637 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator has thrown an exception: java.lang.ArithmeticException: BigInteger out of int range at java.base/java.math.BigInteger.intValueExact(BigInteger.java:4784) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.checkIfNecessaryMemoryModelAdaption(CHandler.java:1009) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:968) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:279) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.result.ExpressionResultTransformer.transformDispatchDecaySwitchRexBoolToInt(ExpressionResultTransformer.java:177) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.handleFunctionCallGivenNameAndArguments(FunctionHandler.java:675) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.handleFunctionCallExpression(FunctionHandler.java:509) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1454) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:267) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1397) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:220) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1081) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:232) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.handleFunctionDefinition(FunctionHandler.java:371) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1470) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:155) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.processTUchild(CHandler.java:3276) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:2361) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:601) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:134) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.translate(MainTranslator.java:192) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.run(MainTranslator.java:115) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.(MainTranslator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver.finish(CACSL2BoogieTranslatorObserver.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-13 22:48:53,641 INFO L158 Benchmark]: Toolchain (without parser) took 1239.40ms. Allocated memory was 52.4MB in the beginning and 81.8MB in the end (delta: 29.4MB). Free memory was 30.6MB in the beginning and 48.3MB in the end (delta: -17.7MB). Peak memory consumption was 19.2MB. Max. memory is 16.1GB. [2022-07-13 22:48:53,642 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 52.4MB. Free memory was 34.5MB in the beginning and 34.5MB in the end (delta: 1.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 22:48:53,642 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1236.58ms. Allocated memory was 52.4MB in the beginning and 81.8MB in the end (delta: 29.4MB). Free memory was 30.4MB in the beginning and 48.3MB in the end (delta: -18.0MB). Peak memory consumption was 19.2MB. Max. memory is 16.1GB. [2022-07-13 22:48:53,643 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 52.4MB. Free memory was 34.5MB in the beginning and 34.5MB in the end (delta: 1.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1236.58ms. Allocated memory was 52.4MB in the beginning and 81.8MB in the end (delta: 29.4MB). Free memory was 30.4MB in the beginning and 48.3MB in the end (delta: -18.0MB). Peak memory consumption was 19.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - ExceptionOrErrorResult: ArithmeticException: BigInteger out of int range de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: ArithmeticException: BigInteger out of int range: java.base/java.math.BigInteger.intValueExact(BigInteger.java:4784) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: ArithmeticException: BigInteger out of int range