./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/aws-c-common/aws_ring_buffer_clean_up_harness.i --full-output --preprocessor.use.memory.slicer true --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version abd6749d Calling Ultimate with: /root/.sdkman/candidates/java/current/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 ../../../trunk/examples/svcomp/aws-c-common/aws_ring_buffer_clean_up_harness.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --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 a6e7035c8f6176239a6155d5f2c0d89271e8311db2fdadeed7cf9912856a8711 --preprocessor.use.memory.slicer true --- Real Ultimate output --- This is Ultimate 0.2.3-?-abd6749-m [2023-11-23 07:43:55,248 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 07:43:55,308 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2023-11-23 07:43:55,315 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 07:43:55,315 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 07:43:55,338 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 07:43:55,339 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 07:43:55,339 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 07:43:55,340 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-23 07:43:55,340 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-23 07:43:55,340 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 07:43:55,340 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 07:43:55,341 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 07:43:55,341 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 07:43:55,341 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 07:43:55,342 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 07:43:55,342 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 07:43:55,342 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 07:43:55,343 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 07:43:55,343 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 07:43:55,343 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 07:43:55,349 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 07:43:55,351 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 07:43:55,352 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 07:43:55,355 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 07:43:55,356 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 07:43:55,356 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 07:43:55,356 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 07:43:55,356 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 07:43:55,356 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 07:43:55,357 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 07:43:55,357 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 07:43:55,357 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-23 07:43:55,357 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 07:43:55,357 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 07:43:55,358 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-23 07:43:55,358 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 07:43:55,359 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-23 07:43:55,359 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 07:43:55,359 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 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 -> a6e7035c8f6176239a6155d5f2c0d89271e8311db2fdadeed7cf9912856a8711 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> true [2023-11-23 07:43:55,530 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 07:43:55,546 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 07:43:55,548 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 07:43:55,549 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 07:43:55,549 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 07:43:55,550 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/aws-c-common/aws_ring_buffer_clean_up_harness.i [2023-11-23 07:43:56,736 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 07:43:57,168 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 07:43:57,168 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_ring_buffer_clean_up_harness.i [2023-11-23 07:43:57,205 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c69d28c66/d9e3fe22324646e79d4a20a9b85f3457/FLAGd1af16020 [2023-11-23 07:43:57,219 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c69d28c66/d9e3fe22324646e79d4a20a9b85f3457 [2023-11-23 07:43:57,222 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 07:43:57,225 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 07:43:57,226 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 07:43:57,226 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 07:43:57,230 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 07:43:57,231 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 07:43:57" (1/1) ... [2023-11-23 07:43:57,232 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fbbe5f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:43:57, skipping insertion in model container [2023-11-23 07:43:57,232 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 07:43:57" (1/1) ... [2023-11-23 07:43:57,305 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 07:43:57,531 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_ring_buffer_clean_up_harness.i[4498,4511] [2023-11-23 07:43:57,538 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_ring_buffer_clean_up_harness.i[4558,4571] [2023-11-23 07:43:58,159 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:43:58,160 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:43:58,160 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:43:58,161 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:43:58,162 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:43:58,169 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:43:58,169 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:43:58,170 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:43:58,171 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:43:58,401 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 07:43:58,402 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 07:43:58,403 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 07:43:58,405 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 07:43:58,409 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 07:43:58,409 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 07:43:58,410 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 07:43:58,410 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 07:43:58,412 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 07:43:58,413 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 07:43:58,605 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:43:58,606 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:43:58,666 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 07:43:58,719 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 07:43:58,735 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_ring_buffer_clean_up_harness.i[4498,4511] [2023-11-23 07:43:58,735 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_ring_buffer_clean_up_harness.i[4558,4571] [2023-11-23 07:43:58,769 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:43:58,769 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:43:58,770 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:43:58,770 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:43:58,771 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:43:58,775 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:43:58,776 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:43:58,776 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:43:58,777 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:43:58,810 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 07:43:58,811 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 07:43:58,812 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 07:43:58,812 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 07:43:58,813 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 07:43:58,814 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 07:43:58,815 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 07:43:58,815 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 07:43:58,816 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 07:43:58,816 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 07:43:58,870 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : "+r"(index)); [8269] [2023-11-23 07:43:58,872 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:43:58,872 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:43:58,900 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : : "r"(pBuf) : "memory"); [8995-9006] [2023-11-23 07:43:58,962 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 07:43:59,059 WARN L675 CHandler]: The function __atomic_fetch_or is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:43:59,060 WARN L675 CHandler]: The function __atomic_fetch_sub is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:43:59,060 WARN L675 CHandler]: The function __atomic_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:43:59,060 WARN L675 CHandler]: The function __atomic_fetch_xor is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:43:59,060 WARN L675 CHandler]: The function htons is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:43:59,060 WARN L675 CHandler]: The function ntohl is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:43:59,060 WARN L675 CHandler]: The function __atomic_compare_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:43:59,060 WARN L675 CHandler]: The function __atomic_fetch_add is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:43:59,060 WARN L675 CHandler]: The function fprintf is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:43:59,060 WARN L675 CHandler]: The function htonl is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:43:59,061 WARN L675 CHandler]: The function __atomic_store_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:43:59,061 WARN L675 CHandler]: The function ntohs is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:43:59,061 WARN L675 CHandler]: The function predicate is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:43:59,061 WARN L675 CHandler]: The function __atomic_load_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:43:59,061 WARN L675 CHandler]: The function memcmp is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:43:59,061 WARN L675 CHandler]: The function __atomic_thread_fence is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:43:59,061 WARN L675 CHandler]: The function __atomic_fetch_and is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:43:59,061 WARN L675 CHandler]: The function memchr is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:43:59,067 INFO L206 MainTranslator]: Completed translation [2023-11-23 07:43:59,068 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:43:59 WrapperNode [2023-11-23 07:43:59,068 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 07:43:59,069 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 07:43:59,069 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 07:43:59,069 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 07:43:59,074 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:43:59" (1/1) ... [2023-11-23 07:43:59,146 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:43:59" (1/1) ... [2023-11-23 07:43:59,253 INFO L138 Inliner]: procedures = 690, calls = 2875, calls flagged for inlining = 57, calls inlined = 6, statements flattened = 811 [2023-11-23 07:43:59,254 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 07:43:59,255 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 07:43:59,255 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 07:43:59,255 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 07:43:59,264 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:43:59" (1/1) ... [2023-11-23 07:43:59,264 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:43:59" (1/1) ... [2023-11-23 07:43:59,276 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:43:59" (1/1) ... [2023-11-23 07:43:59,346 INFO L188 MemorySlicer]: Split 524 memory accesses to 7 slices as follows [2, 0, 256, 236, 6, 21, 3]. 49 percent of accesses are in the largest equivalence class. The 502 initializations are split as follows [2, 0, 256, 236, 5, 0, 3]. The 4 writes are split as follows [0, 0, 0, 0, 0, 4, 0]. [2023-11-23 07:43:59,347 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:43:59" (1/1) ... [2023-11-23 07:43:59,347 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:43:59" (1/1) ... [2023-11-23 07:43:59,368 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:43:59" (1/1) ... [2023-11-23 07:43:59,379 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:43:59" (1/1) ... [2023-11-23 07:43:59,394 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:43:59" (1/1) ... [2023-11-23 07:43:59,398 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:43:59" (1/1) ... [2023-11-23 07:43:59,413 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 07:43:59,418 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 07:43:59,418 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 07:43:59,418 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 07:43:59,419 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:43:59" (1/1) ... [2023-11-23 07:43:59,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 07:43:59,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:43:59,449 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) [2023-11-23 07:43:59,465 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 [2023-11-23 07:43:59,490 INFO L130 BoogieDeclarations]: Found specification of procedure __atomic_store_n [2023-11-23 07:43:59,490 INFO L130 BoogieDeclarations]: Found specification of procedure __atomic_load_n [2023-11-23 07:43:59,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 07:43:59,491 INFO L130 BoogieDeclarations]: Found specification of procedure aws_atomic_load_ptr [2023-11-23 07:43:59,491 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_atomic_load_ptr [2023-11-23 07:43:59,491 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-23 07:43:59,491 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-23 07:43:59,491 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-23 07:43:59,491 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 07:43:59,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-23 07:43:59,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-23 07:43:59,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-23 07:43:59,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2023-11-23 07:43:59,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2023-11-23 07:43:59,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2023-11-23 07:43:59,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2023-11-23 07:43:59,493 INFO L130 BoogieDeclarations]: Found specification of procedure aws_atomic_priv_xlate_order [2023-11-23 07:43:59,493 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_atomic_priv_xlate_order [2023-11-23 07:43:59,493 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 07:43:59,493 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 07:43:59,494 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2023-11-23 07:43:59,494 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2023-11-23 07:43:59,494 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mem_release [2023-11-23 07:43:59,494 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mem_release [2023-11-23 07:43:59,494 INFO L130 BoogieDeclarations]: Found specification of procedure aws_atomic_store_ptr [2023-11-23 07:43:59,494 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_atomic_store_ptr [2023-11-23 07:43:59,495 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2023-11-23 07:43:59,495 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2023-11-23 07:43:59,495 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2023-11-23 07:43:59,495 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#3 [2023-11-23 07:43:59,495 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#4 [2023-11-23 07:43:59,495 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#5 [2023-11-23 07:43:59,495 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#6 [2023-11-23 07:43:59,496 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2023-11-23 07:43:59,496 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2023-11-23 07:43:59,496 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2023-11-23 07:43:59,496 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#3 [2023-11-23 07:43:59,496 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#4 [2023-11-23 07:43:59,496 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#5 [2023-11-23 07:43:59,497 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#6 [2023-11-23 07:43:59,497 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-23 07:43:59,497 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-23 07:43:59,497 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-23 07:43:59,497 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-23 07:43:59,497 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-23 07:43:59,497 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-23 07:43:59,497 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2023-11-23 07:43:59,497 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2023-11-23 07:43:59,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2023-11-23 07:43:59,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2023-11-23 07:43:59,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-23 07:43:59,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-23 07:43:59,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-11-23 07:43:59,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2023-11-23 07:43:59,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2023-11-23 07:43:59,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2023-11-23 07:43:59,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2023-11-23 07:43:59,499 INFO L130 BoogieDeclarations]: Found specification of procedure aws_ring_buffer_check_atomic_ptr [2023-11-23 07:43:59,499 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_ring_buffer_check_atomic_ptr [2023-11-23 07:43:59,499 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2023-11-23 07:43:59,499 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2023-11-23 07:43:59,499 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2023-11-23 07:43:59,499 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2023-11-23 07:43:59,499 INFO L130 BoogieDeclarations]: Found specification of procedure aws_atomic_store_ptr_explicit [2023-11-23 07:43:59,500 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_atomic_store_ptr_explicit [2023-11-23 07:43:59,500 INFO L130 BoogieDeclarations]: Found specification of procedure aws_ring_buffer_is_valid [2023-11-23 07:43:59,500 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_ring_buffer_is_valid [2023-11-23 07:43:59,500 INFO L130 BoogieDeclarations]: Found specification of procedure aws_atomic_load_ptr_explicit [2023-11-23 07:43:59,500 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_atomic_load_ptr_explicit [2023-11-23 07:43:59,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-23 07:43:59,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-23 07:43:59,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-23 07:43:59,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-23 07:43:59,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-23 07:43:59,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2023-11-23 07:43:59,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2023-11-23 07:43:59,764 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 07:43:59,766 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 07:44:00,637 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 07:44:00,791 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 07:44:00,791 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-23 07:44:00,792 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:44:00 BoogieIcfgContainer [2023-11-23 07:44:00,792 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 07:44:00,794 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 07:44:00,794 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 07:44:00,797 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 07:44:00,798 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 07:43:57" (1/3) ... [2023-11-23 07:44:00,799 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b79b104 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 07:44:00, skipping insertion in model container [2023-11-23 07:44:00,799 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:43:59" (2/3) ... [2023-11-23 07:44:00,800 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b79b104 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 07:44:00, skipping insertion in model container [2023-11-23 07:44:00,800 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:44:00" (3/3) ... [2023-11-23 07:44:00,804 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_ring_buffer_clean_up_harness.i [2023-11-23 07:44:00,820 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 07:44:00,821 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-23 07:44:00,865 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 07:44:00,873 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=LoopHeads, 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@35d8f303, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 07:44:00,878 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-11-23 07:44:00,882 INFO L276 IsEmpty]: Start isEmpty. Operand has 121 states, 73 states have (on average 1.2602739726027397) internal successors, (92), 74 states have internal predecessors, (92), 32 states have call successors, (32), 14 states have call predecessors, (32), 14 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-11-23 07:44:00,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-11-23 07:44:00,889 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:44:00,889 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2023-11-23 07:44:00,890 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting aws_atomic_priv_xlate_orderErr0ASSERT_VIOLATIONERROR_FUNCTION === [aws_atomic_priv_xlate_orderErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:44:00,896 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:44:00,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1317155855, now seen corresponding path program 1 times [2023-11-23 07:44:00,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:44:00,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55569024] [2023-11-23 07:44:00,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:44:00,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:44:01,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:01,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:01,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:01,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:44:01,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:01,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:01,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:01,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-23 07:44:01,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:01,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 07:44:01,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:01,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-23 07:44:01,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:01,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 07:44:01,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:01,603 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-11-23 07:44:01,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:44:01,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55569024] [2023-11-23 07:44:01,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55569024] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:44:01,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 07:44:01,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-23 07:44:01,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368370534] [2023-11-23 07:44:01,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:44:01,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 07:44:01,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:44:01,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 07:44:01,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 07:44:01,647 INFO L87 Difference]: Start difference. First operand has 121 states, 73 states have (on average 1.2602739726027397) internal successors, (92), 74 states have internal predecessors, (92), 32 states have call successors, (32), 14 states have call predecessors, (32), 14 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-23 07:44:01,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:44:01,992 INFO L93 Difference]: Finished difference Result 236 states and 330 transitions. [2023-11-23 07:44:01,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 07:44:01,994 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 47 [2023-11-23 07:44:01,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:44:02,001 INFO L225 Difference]: With dead ends: 236 [2023-11-23 07:44:02,001 INFO L226 Difference]: Without dead ends: 121 [2023-11-23 07:44:02,004 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 07:44:02,005 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 72 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 07:44:02,006 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 84 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 07:44:02,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-11-23 07:44:02,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2023-11-23 07:44:02,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 71 states have (on average 1.2112676056338028) internal successors, (86), 73 states have internal predecessors, (86), 32 states have call successors, (32), 14 states have call predecessors, (32), 14 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2023-11-23 07:44:02,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 149 transitions. [2023-11-23 07:44:02,038 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 149 transitions. Word has length 47 [2023-11-23 07:44:02,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:44:02,039 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 149 transitions. [2023-11-23 07:44:02,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-23 07:44:02,039 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 149 transitions. [2023-11-23 07:44:02,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-11-23 07:44:02,040 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:44:02,041 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2023-11-23 07:44:02,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-23 07:44:02,041 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting aws_atomic_priv_xlate_orderErr0ASSERT_VIOLATIONERROR_FUNCTION === [aws_atomic_priv_xlate_orderErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:44:02,042 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:44:02,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1081696627, now seen corresponding path program 1 times [2023-11-23 07:44:02,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:44:02,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344913074] [2023-11-23 07:44:02,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:44:02,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:44:02,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:02,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:02,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:02,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:44:02,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:02,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:02,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:02,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-23 07:44:02,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:02,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 07:44:02,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:02,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-23 07:44:02,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:02,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 07:44:02,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:02,645 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-11-23 07:44:02,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:44:02,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344913074] [2023-11-23 07:44:02,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344913074] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:44:02,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 07:44:02,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-23 07:44:02,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769996854] [2023-11-23 07:44:02,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:44:02,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-23 07:44:02,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:44:02,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-23 07:44:02,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-23 07:44:02,648 INFO L87 Difference]: Start difference. First operand 119 states and 149 transitions. Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-23 07:44:03,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:44:03,447 INFO L93 Difference]: Finished difference Result 226 states and 297 transitions. [2023-11-23 07:44:03,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-23 07:44:03,448 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 47 [2023-11-23 07:44:03,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:44:03,449 INFO L225 Difference]: With dead ends: 226 [2023-11-23 07:44:03,449 INFO L226 Difference]: Without dead ends: 128 [2023-11-23 07:44:03,450 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2023-11-23 07:44:03,451 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 106 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-23 07:44:03,451 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 303 Invalid, 656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 618 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-23 07:44:03,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2023-11-23 07:44:03,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 126. [2023-11-23 07:44:03,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 77 states have (on average 1.2337662337662338) internal successors, (95), 79 states have internal predecessors, (95), 32 states have call successors, (32), 15 states have call predecessors, (32), 15 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2023-11-23 07:44:03,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 158 transitions. [2023-11-23 07:44:03,461 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 158 transitions. Word has length 47 [2023-11-23 07:44:03,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:44:03,462 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 158 transitions. [2023-11-23 07:44:03,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-23 07:44:03,462 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 158 transitions. [2023-11-23 07:44:03,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-11-23 07:44:03,463 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:44:03,464 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2023-11-23 07:44:03,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-23 07:44:03,464 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting aws_atomic_priv_xlate_orderErr0ASSERT_VIOLATIONERROR_FUNCTION === [aws_atomic_priv_xlate_orderErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:44:03,464 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:44:03,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1172181947, now seen corresponding path program 1 times [2023-11-23 07:44:03,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:44:03,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731307334] [2023-11-23 07:44:03,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:44:03,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:44:03,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:03,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:03,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:03,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:44:03,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:03,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:03,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:03,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-23 07:44:03,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:03,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 07:44:03,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:03,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-23 07:44:03,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:03,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 07:44:03,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:03,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-23 07:44:03,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:03,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:03,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:03,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:03,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:03,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-23 07:44:03,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:03,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:03,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:03,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:03,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:03,943 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-23 07:44:03,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:44:03,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731307334] [2023-11-23 07:44:03,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731307334] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:44:03,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1889115315] [2023-11-23 07:44:03,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:44:03,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:44:03,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:44:03,958 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) [2023-11-23 07:44:03,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-23 07:44:04,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:04,358 INFO L262 TraceCheckSpWp]: Trace formula consists of 2546 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-23 07:44:04,364 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:44:04,462 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-23 07:44:04,462 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 07:44:04,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1889115315] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:44:04,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 07:44:04,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2023-11-23 07:44:04,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007585786] [2023-11-23 07:44:04,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:44:04,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 07:44:04,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:44:04,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 07:44:04,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2023-11-23 07:44:04,465 INFO L87 Difference]: Start difference. First operand 126 states and 158 transitions. Second operand has 7 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-11-23 07:44:04,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:44:04,846 INFO L93 Difference]: Finished difference Result 126 states and 158 transitions. [2023-11-23 07:44:04,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-23 07:44:04,847 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 77 [2023-11-23 07:44:04,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:44:04,849 INFO L225 Difference]: With dead ends: 126 [2023-11-23 07:44:04,849 INFO L226 Difference]: Without dead ends: 123 [2023-11-23 07:44:04,850 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2023-11-23 07:44:04,850 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 22 mSDsluCounter, 640 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 775 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 07:44:04,851 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 775 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 07:44:04,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2023-11-23 07:44:04,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2023-11-23 07:44:04,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 75 states have (on average 1.2266666666666666) internal successors, (92), 76 states have internal predecessors, (92), 32 states have call successors, (32), 15 states have call predecessors, (32), 15 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2023-11-23 07:44:04,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 155 transitions. [2023-11-23 07:44:04,859 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 155 transitions. Word has length 77 [2023-11-23 07:44:04,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:44:04,859 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 155 transitions. [2023-11-23 07:44:04,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-11-23 07:44:04,859 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 155 transitions. [2023-11-23 07:44:04,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2023-11-23 07:44:04,864 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:44:04,864 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2023-11-23 07:44:04,882 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-23 07:44:05,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:44:05,083 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [aws_atomic_priv_xlate_orderErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:44:05,083 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:44:05,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1137034530, now seen corresponding path program 1 times [2023-11-23 07:44:05,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:44:05,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477301049] [2023-11-23 07:44:05,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:44:05,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:44:05,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:05,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:05,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:05,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:44:05,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:05,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:05,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:05,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-23 07:44:05,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:05,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 07:44:05,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:05,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-23 07:44:05,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:05,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 07:44:05,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:05,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-23 07:44:05,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:05,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:05,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:05,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:05,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:05,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-23 07:44:05,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:05,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:05,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:05,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:05,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:05,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 07:44:05,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:05,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:05,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:05,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:05,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:05,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:05,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:05,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-23 07:44:05,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:05,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:05,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:05,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:05,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:05,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 07:44:05,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:05,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 07:44:05,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:05,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-23 07:44:05,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:05,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-23 07:44:05,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:05,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:05,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:05,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:05,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:05,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:05,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:05,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-23 07:44:05,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:05,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:05,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:05,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:05,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:05,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 07:44:05,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:05,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 07:44:05,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:05,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2023-11-23 07:44:05,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:05,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2023-11-23 07:44:05,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:05,776 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2023-11-23 07:44:05,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:44:05,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477301049] [2023-11-23 07:44:05,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477301049] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:44:05,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1395250234] [2023-11-23 07:44:05,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:44:05,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:44:05,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:44:05,778 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) [2023-11-23 07:44:05,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-23 07:44:06,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:06,293 INFO L262 TraceCheckSpWp]: Trace formula consists of 3007 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-23 07:44:06,302 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:44:06,331 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2023-11-23 07:44:06,332 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 07:44:06,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1395250234] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:44:06,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 07:44:06,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2023-11-23 07:44:06,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982799507] [2023-11-23 07:44:06,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:44:06,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 07:44:06,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:44:06,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 07:44:06,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-11-23 07:44:06,334 INFO L87 Difference]: Start difference. First operand 123 states and 155 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2023-11-23 07:44:06,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:44:06,552 INFO L93 Difference]: Finished difference Result 209 states and 266 transitions. [2023-11-23 07:44:06,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 07:44:06,552 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 184 [2023-11-23 07:44:06,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:44:06,555 INFO L225 Difference]: With dead ends: 209 [2023-11-23 07:44:06,555 INFO L226 Difference]: Without dead ends: 127 [2023-11-23 07:44:06,556 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2023-11-23 07:44:06,556 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 3 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 07:44:06,558 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 389 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 07:44:06,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2023-11-23 07:44:06,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125. [2023-11-23 07:44:06,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 77 states have (on average 1.2207792207792207) internal successors, (94), 78 states have internal predecessors, (94), 32 states have call successors, (32), 15 states have call predecessors, (32), 15 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2023-11-23 07:44:06,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 157 transitions. [2023-11-23 07:44:06,573 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 157 transitions. Word has length 184 [2023-11-23 07:44:06,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:44:06,574 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 157 transitions. [2023-11-23 07:44:06,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2023-11-23 07:44:06,575 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 157 transitions. [2023-11-23 07:44:06,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2023-11-23 07:44:06,580 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:44:06,580 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2023-11-23 07:44:06,600 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-23 07:44:06,784 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,SelfDestructingSolverStorable3 [2023-11-23 07:44:06,784 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [aws_atomic_priv_xlate_orderErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:44:06,785 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:44:06,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1503297694, now seen corresponding path program 1 times [2023-11-23 07:44:06,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:44:06,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347735553] [2023-11-23 07:44:06,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:44:06,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:44:06,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:07,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:07,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:07,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:44:07,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:07,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:07,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:07,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-23 07:44:07,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:07,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 07:44:07,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:07,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-23 07:44:07,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:07,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 07:44:07,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:07,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-23 07:44:07,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:07,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:07,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:07,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:07,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:07,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-23 07:44:07,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:07,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:07,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:07,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:07,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:07,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 07:44:07,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:07,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:07,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:07,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:07,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:07,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:07,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:07,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-23 07:44:07,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:07,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:07,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:07,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:07,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:07,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 07:44:07,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:07,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 07:44:07,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:07,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-23 07:44:07,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:07,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-23 07:44:07,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:07,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:07,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:07,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:07,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:07,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:07,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:07,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-23 07:44:07,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:07,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:07,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:07,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:07,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:07,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 07:44:07,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:07,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 07:44:07,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:07,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2023-11-23 07:44:07,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:07,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2023-11-23 07:44:07,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:07,375 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2023-11-23 07:44:07,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:44:07,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347735553] [2023-11-23 07:44:07,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347735553] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:44:07,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [70424879] [2023-11-23 07:44:07,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:44:07,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:44:07,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:44:07,377 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) [2023-11-23 07:44:07,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-23 07:44:07,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:07,829 INFO L262 TraceCheckSpWp]: Trace formula consists of 2997 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-23 07:44:07,835 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:44:07,963 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2023-11-23 07:44:07,963 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 07:44:07,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [70424879] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:44:07,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 07:44:07,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2023-11-23 07:44:07,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810261319] [2023-11-23 07:44:07,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:44:07,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 07:44:07,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:44:07,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 07:44:07,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2023-11-23 07:44:07,966 INFO L87 Difference]: Start difference. First operand 125 states and 157 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 4 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (28), 4 states have call predecessors, (28), 4 states have call successors, (28) [2023-11-23 07:44:08,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:44:08,182 INFO L93 Difference]: Finished difference Result 211 states and 266 transitions. [2023-11-23 07:44:08,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 07:44:08,183 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 4 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (28), 4 states have call predecessors, (28), 4 states have call successors, (28) Word has length 184 [2023-11-23 07:44:08,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:44:08,184 INFO L225 Difference]: With dead ends: 211 [2023-11-23 07:44:08,184 INFO L226 Difference]: Without dead ends: 127 [2023-11-23 07:44:08,185 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2023-11-23 07:44:08,185 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 29 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 07:44:08,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 424 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 07:44:08,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2023-11-23 07:44:08,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2023-11-23 07:44:08,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 78 states have (on average 1.2179487179487178) internal successors, (95), 80 states have internal predecessors, (95), 32 states have call successors, (32), 15 states have call predecessors, (32), 16 states have return successors, (32), 31 states have call predecessors, (32), 31 states have call successors, (32) [2023-11-23 07:44:08,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 159 transitions. [2023-11-23 07:44:08,193 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 159 transitions. Word has length 184 [2023-11-23 07:44:08,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:44:08,193 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 159 transitions. [2023-11-23 07:44:08,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 4 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (28), 4 states have call predecessors, (28), 4 states have call successors, (28) [2023-11-23 07:44:08,194 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 159 transitions. [2023-11-23 07:44:08,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2023-11-23 07:44:08,195 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:44:08,195 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2023-11-23 07:44:08,214 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-23 07:44:08,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:44:08,412 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [aws_atomic_priv_xlate_orderErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:44:08,412 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:44:08,413 INFO L85 PathProgramCache]: Analyzing trace with hash 597014277, now seen corresponding path program 1 times [2023-11-23 07:44:08,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:44:08,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177344928] [2023-11-23 07:44:08,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:44:08,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:44:08,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:08,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:08,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:08,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:44:08,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:08,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:08,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:08,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-23 07:44:08,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:08,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 07:44:08,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:08,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-23 07:44:08,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:08,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 07:44:08,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:08,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-23 07:44:08,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:08,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:08,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:08,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:08,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:08,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-23 07:44:08,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:08,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:08,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:08,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:08,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:08,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 07:44:08,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:08,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:08,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:08,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:08,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:08,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:08,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:08,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-23 07:44:08,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:08,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:08,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:08,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:08,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:08,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 07:44:08,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:08,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 07:44:08,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:08,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-23 07:44:08,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:08,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-23 07:44:08,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:09,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:09,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:09,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:09,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:09,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:09,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:09,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-23 07:44:09,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:09,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:09,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:09,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:09,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:09,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 07:44:09,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:09,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 07:44:09,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:09,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2023-11-23 07:44:09,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:09,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2023-11-23 07:44:09,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:09,063 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2023-11-23 07:44:09,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:44:09,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177344928] [2023-11-23 07:44:09,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177344928] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:44:09,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1555823872] [2023-11-23 07:44:09,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:44:09,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:44:09,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:44:09,065 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) [2023-11-23 07:44:09,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-23 07:44:09,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:09,543 INFO L262 TraceCheckSpWp]: Trace formula consists of 3013 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-23 07:44:09,548 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:44:09,640 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2023-11-23 07:44:09,640 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 07:44:09,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1555823872] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:44:09,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 07:44:09,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2023-11-23 07:44:09,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065111939] [2023-11-23 07:44:09,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:44:09,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 07:44:09,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:44:09,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 07:44:09,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2023-11-23 07:44:09,642 INFO L87 Difference]: Start difference. First operand 127 states and 159 transitions. Second operand has 7 states, 6 states have (on average 11.166666666666666) internal successors, (67), 7 states have internal predecessors, (67), 5 states have call successors, (27), 2 states have call predecessors, (27), 3 states have return successors, (26), 4 states have call predecessors, (26), 5 states have call successors, (26) [2023-11-23 07:44:09,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:44:09,962 INFO L93 Difference]: Finished difference Result 184 states and 229 transitions. [2023-11-23 07:44:09,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 07:44:09,962 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.166666666666666) internal successors, (67), 7 states have internal predecessors, (67), 5 states have call successors, (27), 2 states have call predecessors, (27), 3 states have return successors, (26), 4 states have call predecessors, (26), 5 states have call successors, (26) Word has length 186 [2023-11-23 07:44:09,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:44:09,964 INFO L225 Difference]: With dead ends: 184 [2023-11-23 07:44:09,964 INFO L226 Difference]: Without dead ends: 123 [2023-11-23 07:44:09,965 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2023-11-23 07:44:09,965 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 35 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 07:44:09,965 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 639 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 07:44:09,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2023-11-23 07:44:09,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2023-11-23 07:44:09,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 75 states have (on average 1.2133333333333334) internal successors, (91), 76 states have internal predecessors, (91), 32 states have call successors, (32), 15 states have call predecessors, (32), 15 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2023-11-23 07:44:09,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 154 transitions. [2023-11-23 07:44:09,973 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 154 transitions. Word has length 186 [2023-11-23 07:44:09,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:44:09,974 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 154 transitions. [2023-11-23 07:44:09,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.166666666666666) internal successors, (67), 7 states have internal predecessors, (67), 5 states have call successors, (27), 2 states have call predecessors, (27), 3 states have return successors, (26), 4 states have call predecessors, (26), 5 states have call successors, (26) [2023-11-23 07:44:09,974 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 154 transitions. [2023-11-23 07:44:09,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2023-11-23 07:44:09,975 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:44:09,976 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2023-11-23 07:44:09,994 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-23 07:44:10,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:44:10,192 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [aws_atomic_priv_xlate_orderErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:44:10,192 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:44:10,192 INFO L85 PathProgramCache]: Analyzing trace with hash 162107774, now seen corresponding path program 1 times [2023-11-23 07:44:10,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:44:10,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548611309] [2023-11-23 07:44:10,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:44:10,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:44:10,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:10,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:10,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:10,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:44:10,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:10,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:10,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:10,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-23 07:44:10,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:10,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 07:44:10,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:10,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-23 07:44:10,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:10,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 07:44:10,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:10,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-23 07:44:10,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:10,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:10,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:10,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:10,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:10,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-23 07:44:10,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:10,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:10,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:10,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:10,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:10,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 07:44:10,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:10,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:10,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:10,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:10,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:10,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:10,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:10,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-23 07:44:10,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:10,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:10,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:10,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:10,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:10,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 07:44:10,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:10,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 07:44:10,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:10,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-23 07:44:10,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:10,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-23 07:44:10,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:10,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:10,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:10,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:10,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:10,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:10,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:10,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-23 07:44:10,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:10,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:10,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:10,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:10,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:10,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 07:44:10,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:10,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 07:44:10,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:10,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2023-11-23 07:44:10,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:10,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2023-11-23 07:44:10,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:10,802 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2023-11-23 07:44:10,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:44:10,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548611309] [2023-11-23 07:44:10,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548611309] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:44:10,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1041527497] [2023-11-23 07:44:10,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:44:10,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:44:10,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:44:10,804 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) [2023-11-23 07:44:10,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-23 07:44:11,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:11,258 INFO L262 TraceCheckSpWp]: Trace formula consists of 3029 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-23 07:44:11,262 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:44:11,302 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2023-11-23 07:44:11,303 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 07:44:11,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1041527497] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:44:11,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 07:44:11,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 9 [2023-11-23 07:44:11,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682029623] [2023-11-23 07:44:11,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:44:11,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 07:44:11,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:44:11,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 07:44:11,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-23 07:44:11,304 INFO L87 Difference]: Start difference. First operand 123 states and 154 transitions. Second operand has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2023-11-23 07:44:11,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:44:11,586 INFO L93 Difference]: Finished difference Result 231 states and 290 transitions. [2023-11-23 07:44:11,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 07:44:11,586 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) Word has length 188 [2023-11-23 07:44:11,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:44:11,587 INFO L225 Difference]: With dead ends: 231 [2023-11-23 07:44:11,587 INFO L226 Difference]: Without dead ends: 125 [2023-11-23 07:44:11,588 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2023-11-23 07:44:11,589 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 4 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 07:44:11,589 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 618 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 07:44:11,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2023-11-23 07:44:11,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2023-11-23 07:44:11,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 75 states have (on average 1.2) internal successors, (90), 76 states have internal predecessors, (90), 32 states have call successors, (32), 15 states have call predecessors, (32), 15 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2023-11-23 07:44:11,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 153 transitions. [2023-11-23 07:44:11,596 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 153 transitions. Word has length 188 [2023-11-23 07:44:11,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:44:11,597 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 153 transitions. [2023-11-23 07:44:11,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2023-11-23 07:44:11,597 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 153 transitions. [2023-11-23 07:44:11,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2023-11-23 07:44:11,599 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:44:11,599 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2023-11-23 07:44:11,639 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-23 07:44:11,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:44:11,812 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [aws_atomic_priv_xlate_orderErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:44:11,813 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:44:11,813 INFO L85 PathProgramCache]: Analyzing trace with hash -30893714, now seen corresponding path program 1 times [2023-11-23 07:44:11,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:44:11,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096345841] [2023-11-23 07:44:11,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:44:11,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:44:11,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:12,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:12,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:12,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:44:12,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:12,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:12,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:12,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-23 07:44:12,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:12,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 07:44:12,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:12,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-23 07:44:12,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:12,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 07:44:12,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:12,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-23 07:44:12,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:12,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:12,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:12,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:12,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:12,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-23 07:44:12,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:12,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:12,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:12,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:12,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:12,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-23 07:44:12,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:12,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:12,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:12,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:12,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:12,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:12,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:12,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-23 07:44:12,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:12,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:12,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:12,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:12,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:12,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 07:44:12,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:12,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 07:44:12,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:12,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-23 07:44:12,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:12,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2023-11-23 07:44:12,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:12,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:12,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:12,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:12,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:12,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:12,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:12,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-23 07:44:12,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:12,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:12,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:12,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:12,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:12,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 07:44:12,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:12,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 07:44:12,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:12,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2023-11-23 07:44:12,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:12,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2023-11-23 07:44:12,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:12,468 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2023-11-23 07:44:12,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:44:12,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096345841] [2023-11-23 07:44:12,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096345841] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:44:12,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [614995818] [2023-11-23 07:44:12,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:44:12,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:44:12,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:44:12,470 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) [2023-11-23 07:44:12,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-23 07:44:12,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:12,962 INFO L262 TraceCheckSpWp]: Trace formula consists of 3033 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-23 07:44:12,967 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:44:13,027 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2023-11-23 07:44:13,027 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 07:44:13,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [614995818] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:44:13,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 07:44:13,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 14 [2023-11-23 07:44:13,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260412637] [2023-11-23 07:44:13,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:44:13,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 07:44:13,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:44:13,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 07:44:13,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2023-11-23 07:44:13,030 INFO L87 Difference]: Start difference. First operand 123 states and 153 transitions. Second operand has 7 states, 6 states have (on average 10.833333333333334) internal successors, (65), 7 states have internal predecessors, (65), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2023-11-23 07:44:13,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:44:13,410 INFO L93 Difference]: Finished difference Result 231 states and 288 transitions. [2023-11-23 07:44:13,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 07:44:13,411 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.833333333333334) internal successors, (65), 7 states have internal predecessors, (65), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) Word has length 190 [2023-11-23 07:44:13,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:44:13,412 INFO L225 Difference]: With dead ends: 231 [2023-11-23 07:44:13,413 INFO L226 Difference]: Without dead ends: 125 [2023-11-23 07:44:13,414 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2023-11-23 07:44:13,415 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 14 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 07:44:13,415 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 598 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 07:44:13,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2023-11-23 07:44:13,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2023-11-23 07:44:13,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 75 states have (on average 1.1866666666666668) internal successors, (89), 76 states have internal predecessors, (89), 32 states have call successors, (32), 15 states have call predecessors, (32), 15 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2023-11-23 07:44:13,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 152 transitions. [2023-11-23 07:44:13,422 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 152 transitions. Word has length 190 [2023-11-23 07:44:13,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:44:13,422 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 152 transitions. [2023-11-23 07:44:13,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 10.833333333333334) internal successors, (65), 7 states have internal predecessors, (65), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2023-11-23 07:44:13,423 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 152 transitions. [2023-11-23 07:44:13,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2023-11-23 07:44:13,424 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:44:13,424 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2023-11-23 07:44:13,448 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-23 07:44:13,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:44:13,640 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [aws_atomic_priv_xlate_orderErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:44:13,641 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:44:13,641 INFO L85 PathProgramCache]: Analyzing trace with hash 635912950, now seen corresponding path program 1 times [2023-11-23 07:44:13,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:44:13,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850922563] [2023-11-23 07:44:13,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:44:13,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:44:13,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:14,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:14,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:14,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:44:14,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:14,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:14,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:14,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-23 07:44:14,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:14,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 07:44:14,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:14,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-23 07:44:14,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:14,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 07:44:14,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:14,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-23 07:44:14,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:14,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:14,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:14,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:14,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:14,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-23 07:44:14,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:14,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:14,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:14,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:14,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:14,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-23 07:44:14,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:14,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:14,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:14,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:14,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:14,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:14,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:14,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-23 07:44:14,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:14,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:14,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:14,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:14,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:14,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 07:44:14,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:14,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 07:44:14,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:14,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-23 07:44:14,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:14,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-11-23 07:44:14,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:14,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:14,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:14,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:14,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:14,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:14,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:14,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-23 07:44:14,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:14,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:14,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:14,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:14,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:14,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 07:44:14,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:14,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 07:44:14,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:14,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2023-11-23 07:44:14,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:14,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2023-11-23 07:44:14,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:14,341 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 6 proven. 40 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2023-11-23 07:44:14,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:44:14,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850922563] [2023-11-23 07:44:14,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850922563] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:44:14,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1694848540] [2023-11-23 07:44:14,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:44:14,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:44:14,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:44:14,343 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) [2023-11-23 07:44:14,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-23 07:44:14,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:14,814 INFO L262 TraceCheckSpWp]: Trace formula consists of 3037 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-23 07:44:14,817 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:44:14,895 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2023-11-23 07:44:14,896 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 07:44:14,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1694848540] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:44:14,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 07:44:14,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2023-11-23 07:44:14,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855356024] [2023-11-23 07:44:14,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:44:14,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 07:44:14,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:44:14,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 07:44:14,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2023-11-23 07:44:14,898 INFO L87 Difference]: Start difference. First operand 123 states and 152 transitions. Second operand has 7 states, 6 states have (on average 11.166666666666666) internal successors, (67), 7 states have internal predecessors, (67), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2023-11-23 07:44:15,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:44:15,224 INFO L93 Difference]: Finished difference Result 231 states and 286 transitions. [2023-11-23 07:44:15,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 07:44:15,224 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.166666666666666) internal successors, (67), 7 states have internal predecessors, (67), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) Word has length 192 [2023-11-23 07:44:15,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:44:15,225 INFO L225 Difference]: With dead ends: 231 [2023-11-23 07:44:15,225 INFO L226 Difference]: Without dead ends: 125 [2023-11-23 07:44:15,226 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2023-11-23 07:44:15,226 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 12 mSDsluCounter, 592 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 07:44:15,227 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 714 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 07:44:15,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2023-11-23 07:44:15,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2023-11-23 07:44:15,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 75 states have (on average 1.1733333333333333) internal successors, (88), 76 states have internal predecessors, (88), 32 states have call successors, (32), 15 states have call predecessors, (32), 15 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2023-11-23 07:44:15,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 151 transitions. [2023-11-23 07:44:15,233 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 151 transitions. Word has length 192 [2023-11-23 07:44:15,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:44:15,233 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 151 transitions. [2023-11-23 07:44:15,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.166666666666666) internal successors, (67), 7 states have internal predecessors, (67), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2023-11-23 07:44:15,234 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 151 transitions. [2023-11-23 07:44:15,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2023-11-23 07:44:15,235 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:44:15,235 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2023-11-23 07:44:15,257 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-11-23 07:44:15,456 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 [2023-11-23 07:44:15,457 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [aws_atomic_priv_xlate_orderErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:44:15,457 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:44:15,457 INFO L85 PathProgramCache]: Analyzing trace with hash 98117998, now seen corresponding path program 1 times [2023-11-23 07:44:15,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:44:15,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481387438] [2023-11-23 07:44:15,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:44:15,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:44:15,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:15,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:15,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:15,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:44:15,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:15,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:15,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:15,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-23 07:44:15,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:15,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 07:44:15,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:15,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-23 07:44:15,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:15,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 07:44:15,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:15,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-23 07:44:15,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:15,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:15,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:15,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:15,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:15,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-23 07:44:15,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:15,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:15,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:15,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:15,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:15,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-23 07:44:15,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:16,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:16,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:16,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:16,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:16,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:16,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:16,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-23 07:44:16,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:16,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:16,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:16,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:16,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:16,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 07:44:16,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:16,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 07:44:16,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:16,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-23 07:44:16,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:16,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-23 07:44:16,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:16,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:16,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:16,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:16,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:16,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:16,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:16,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-23 07:44:16,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:16,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:16,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:16,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:16,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:16,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 07:44:16,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:16,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 07:44:16,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:16,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2023-11-23 07:44:16,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:16,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2023-11-23 07:44:16,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:16,166 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 6 proven. 40 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2023-11-23 07:44:16,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:44:16,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481387438] [2023-11-23 07:44:16,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481387438] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:44:16,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1922960804] [2023-11-23 07:44:16,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:44:16,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:44:16,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:44:16,168 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) [2023-11-23 07:44:16,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-23 07:44:16,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:16,637 INFO L262 TraceCheckSpWp]: Trace formula consists of 3041 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-23 07:44:16,641 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:44:16,700 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2023-11-23 07:44:16,701 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 07:44:16,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1922960804] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:44:16,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 07:44:16,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2023-11-23 07:44:16,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373343524] [2023-11-23 07:44:16,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:44:16,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 07:44:16,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:44:16,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 07:44:16,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2023-11-23 07:44:16,703 INFO L87 Difference]: Start difference. First operand 123 states and 151 transitions. Second operand has 7 states, 6 states have (on average 11.5) internal successors, (69), 7 states have internal predecessors, (69), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2023-11-23 07:44:16,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:44:16,968 INFO L93 Difference]: Finished difference Result 231 states and 284 transitions. [2023-11-23 07:44:16,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 07:44:16,969 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.5) internal successors, (69), 7 states have internal predecessors, (69), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) Word has length 194 [2023-11-23 07:44:16,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:44:16,970 INFO L225 Difference]: With dead ends: 231 [2023-11-23 07:44:16,970 INFO L226 Difference]: Without dead ends: 125 [2023-11-23 07:44:16,971 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2023-11-23 07:44:16,971 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 14 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 07:44:16,971 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 592 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 07:44:16,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2023-11-23 07:44:16,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2023-11-23 07:44:16,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 75 states have (on average 1.16) internal successors, (87), 76 states have internal predecessors, (87), 32 states have call successors, (32), 15 states have call predecessors, (32), 15 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2023-11-23 07:44:16,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 150 transitions. [2023-11-23 07:44:16,977 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 150 transitions. Word has length 194 [2023-11-23 07:44:16,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:44:16,978 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 150 transitions. [2023-11-23 07:44:16,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.5) internal successors, (69), 7 states have internal predecessors, (69), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2023-11-23 07:44:16,978 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 150 transitions. [2023-11-23 07:44:16,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2023-11-23 07:44:16,980 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:44:16,980 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2023-11-23 07:44:17,019 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-23 07:44:17,200 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 [2023-11-23 07:44:17,200 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [aws_atomic_priv_xlate_orderErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:44:17,201 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:44:17,201 INFO L85 PathProgramCache]: Analyzing trace with hash -312297874, now seen corresponding path program 1 times [2023-11-23 07:44:17,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:44:17,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762909753] [2023-11-23 07:44:17,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:44:17,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:44:17,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:17,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:17,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:17,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:44:17,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:17,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:17,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:17,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-23 07:44:17,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:17,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 07:44:17,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:17,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-23 07:44:17,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:17,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 07:44:17,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:17,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-23 07:44:17,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:17,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:17,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:17,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:17,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:17,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-23 07:44:17,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:17,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:17,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:17,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:17,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:17,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-23 07:44:17,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:17,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:17,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:17,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:17,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:17,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:17,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:17,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-23 07:44:17,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:17,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:17,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:17,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:17,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:17,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 07:44:17,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:17,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 07:44:17,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:17,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2023-11-23 07:44:17,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:17,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2023-11-23 07:44:17,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:17,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:17,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:17,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:17,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:17,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:17,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:17,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-23 07:44:17,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:17,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:17,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:17,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:17,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:17,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 07:44:17,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:17,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 07:44:17,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:17,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2023-11-23 07:44:17,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:17,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2023-11-23 07:44:17,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:17,879 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 6 proven. 40 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2023-11-23 07:44:17,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:44:17,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762909753] [2023-11-23 07:44:17,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762909753] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:44:17,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1906228357] [2023-11-23 07:44:17,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:44:17,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:44:17,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:44:17,881 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) [2023-11-23 07:44:17,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-23 07:44:18,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:18,395 INFO L262 TraceCheckSpWp]: Trace formula consists of 3045 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-23 07:44:18,398 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:44:18,430 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2023-11-23 07:44:18,430 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 07:44:18,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1906228357] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:44:18,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 07:44:18,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 9 [2023-11-23 07:44:18,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679421044] [2023-11-23 07:44:18,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:44:18,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 07:44:18,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:44:18,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 07:44:18,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-23 07:44:18,433 INFO L87 Difference]: Start difference. First operand 123 states and 150 transitions. Second operand has 6 states, 5 states have (on average 14.0) internal successors, (70), 6 states have internal predecessors, (70), 3 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2023-11-23 07:44:18,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:44:18,734 INFO L93 Difference]: Finished difference Result 209 states and 263 transitions. [2023-11-23 07:44:18,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 07:44:18,735 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.0) internal successors, (70), 6 states have internal predecessors, (70), 3 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) Word has length 196 [2023-11-23 07:44:18,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:44:18,736 INFO L225 Difference]: With dead ends: 209 [2023-11-23 07:44:18,736 INFO L226 Difference]: Without dead ends: 123 [2023-11-23 07:44:18,736 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2023-11-23 07:44:18,737 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 4 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 626 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 07:44:18,737 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 626 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 07:44:18,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2023-11-23 07:44:18,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2023-11-23 07:44:18,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 75 states have (on average 1.1466666666666667) internal successors, (86), 76 states have internal predecessors, (86), 32 states have call successors, (32), 15 states have call predecessors, (32), 15 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2023-11-23 07:44:18,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 149 transitions. [2023-11-23 07:44:18,741 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 149 transitions. Word has length 196 [2023-11-23 07:44:18,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:44:18,742 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 149 transitions. [2023-11-23 07:44:18,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.0) internal successors, (70), 6 states have internal predecessors, (70), 3 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2023-11-23 07:44:18,742 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 149 transitions. [2023-11-23 07:44:18,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2023-11-23 07:44:18,743 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:44:18,743 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2023-11-23 07:44:18,758 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-11-23 07:44:18,952 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 [2023-11-23 07:44:18,952 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [aws_atomic_priv_xlate_orderErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:44:18,952 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:44:18,953 INFO L85 PathProgramCache]: Analyzing trace with hash 2091704238, now seen corresponding path program 1 times [2023-11-23 07:44:18,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:44:18,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326825241] [2023-11-23 07:44:18,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:44:18,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:44:18,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:19,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:19,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:19,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:44:19,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:19,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:19,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:19,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-23 07:44:19,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:19,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 07:44:19,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:19,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-23 07:44:19,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:19,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 07:44:19,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:19,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-23 07:44:19,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:19,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:19,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:19,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:19,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:19,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-23 07:44:19,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:19,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:19,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:19,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:19,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:19,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-23 07:44:19,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:19,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:19,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:19,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:19,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:19,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:19,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:19,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-23 07:44:19,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:19,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:19,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:19,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:19,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:19,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 07:44:19,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:19,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 07:44:19,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:19,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-11-23 07:44:19,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:19,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2023-11-23 07:44:19,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:19,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:19,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:19,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:19,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:19,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:19,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:19,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-23 07:44:19,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:19,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:19,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:19,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:19,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:19,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 07:44:19,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:19,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 07:44:19,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:19,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2023-11-23 07:44:19,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:19,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2023-11-23 07:44:19,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:19,603 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 8 proven. 43 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2023-11-23 07:44:19,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:44:19,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326825241] [2023-11-23 07:44:19,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326825241] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:44:19,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [378253493] [2023-11-23 07:44:19,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:44:19,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:44:19,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:44:19,605 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) [2023-11-23 07:44:19,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-23 07:44:20,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:20,083 INFO L262 TraceCheckSpWp]: Trace formula consists of 3053 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-23 07:44:20,087 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:44:20,148 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2023-11-23 07:44:20,148 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 07:44:20,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [378253493] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:44:20,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 07:44:20,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 14 [2023-11-23 07:44:20,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595426649] [2023-11-23 07:44:20,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:44:20,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 07:44:20,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:44:20,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 07:44:20,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2023-11-23 07:44:20,150 INFO L87 Difference]: Start difference. First operand 123 states and 149 transitions. Second operand has 7 states, 6 states have (on average 12.0) internal successors, (72), 7 states have internal predecessors, (72), 3 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2023-11-23 07:44:20,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:44:20,415 INFO L93 Difference]: Finished difference Result 209 states and 261 transitions. [2023-11-23 07:44:20,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 07:44:20,416 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 12.0) internal successors, (72), 7 states have internal predecessors, (72), 3 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) Word has length 200 [2023-11-23 07:44:20,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:44:20,416 INFO L225 Difference]: With dead ends: 209 [2023-11-23 07:44:20,417 INFO L226 Difference]: Without dead ends: 123 [2023-11-23 07:44:20,417 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2023-11-23 07:44:20,417 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 11 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 721 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 07:44:20,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 721 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 07:44:20,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2023-11-23 07:44:20,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2023-11-23 07:44:20,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 75 states have (on average 1.1333333333333333) internal successors, (85), 76 states have internal predecessors, (85), 32 states have call successors, (32), 15 states have call predecessors, (32), 15 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2023-11-23 07:44:20,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 148 transitions. [2023-11-23 07:44:20,425 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 148 transitions. Word has length 200 [2023-11-23 07:44:20,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:44:20,426 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 148 transitions. [2023-11-23 07:44:20,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 12.0) internal successors, (72), 7 states have internal predecessors, (72), 3 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2023-11-23 07:44:20,427 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 148 transitions. [2023-11-23 07:44:20,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2023-11-23 07:44:20,428 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:44:20,428 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2023-11-23 07:44:20,443 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-11-23 07:44:20,636 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 [2023-11-23 07:44:20,636 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [aws_atomic_priv_xlate_orderErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:44:20,637 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:44:20,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1699768978, now seen corresponding path program 1 times [2023-11-23 07:44:20,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:44:20,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657986780] [2023-11-23 07:44:20,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:44:20,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:44:20,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:21,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:21,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:21,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:44:21,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:21,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:21,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:21,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-23 07:44:21,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:21,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 07:44:21,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:21,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-23 07:44:21,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:21,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 07:44:21,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:21,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-23 07:44:21,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:21,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:21,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:21,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:21,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:21,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-23 07:44:21,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:21,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:21,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:21,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:21,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:21,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-23 07:44:21,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:21,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:21,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:21,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:21,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:21,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:21,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:21,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-23 07:44:21,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:21,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:21,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:21,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:21,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:21,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-23 07:44:21,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:21,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-23 07:44:21,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:21,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-23 07:44:21,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:21,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-23 07:44:21,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:21,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:21,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:21,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:21,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:21,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:21,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:21,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-23 07:44:21,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:21,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:21,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:21,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:21,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:21,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-23 07:44:21,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:21,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-23 07:44:21,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:21,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2023-11-23 07:44:21,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:21,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2023-11-23 07:44:21,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:21,328 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 10 proven. 46 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2023-11-23 07:44:21,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:44:21,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657986780] [2023-11-23 07:44:21,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657986780] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:44:21,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [113591391] [2023-11-23 07:44:21,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:44:21,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:44:21,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:44:21,345 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 07:44:21,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-23 07:44:21,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:21,855 INFO L262 TraceCheckSpWp]: Trace formula consists of 3061 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-23 07:44:21,859 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:44:21,913 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2023-11-23 07:44:21,914 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 07:44:21,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [113591391] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:44:21,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 07:44:21,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 14 [2023-11-23 07:44:21,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318640229] [2023-11-23 07:44:21,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:44:21,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 07:44:21,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:44:21,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 07:44:21,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2023-11-23 07:44:21,916 INFO L87 Difference]: Start difference. First operand 123 states and 148 transitions. Second operand has 7 states, 6 states have (on average 12.333333333333334) internal successors, (74), 7 states have internal predecessors, (74), 3 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2023-11-23 07:44:22,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:44:22,267 INFO L93 Difference]: Finished difference Result 209 states and 259 transitions. [2023-11-23 07:44:22,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 07:44:22,268 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 12.333333333333334) internal successors, (74), 7 states have internal predecessors, (74), 3 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) Word has length 204 [2023-11-23 07:44:22,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:44:22,269 INFO L225 Difference]: With dead ends: 209 [2023-11-23 07:44:22,269 INFO L226 Difference]: Without dead ends: 123 [2023-11-23 07:44:22,270 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2023-11-23 07:44:22,270 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 9 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 07:44:22,270 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 717 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 07:44:22,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2023-11-23 07:44:22,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2023-11-23 07:44:22,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 75 states have (on average 1.12) internal successors, (84), 76 states have internal predecessors, (84), 32 states have call successors, (32), 15 states have call predecessors, (32), 15 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2023-11-23 07:44:22,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 147 transitions. [2023-11-23 07:44:22,276 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 147 transitions. Word has length 204 [2023-11-23 07:44:22,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:44:22,276 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 147 transitions. [2023-11-23 07:44:22,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 12.333333333333334) internal successors, (74), 7 states have internal predecessors, (74), 3 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2023-11-23 07:44:22,277 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 147 transitions. [2023-11-23 07:44:22,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2023-11-23 07:44:22,278 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:44:22,278 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2023-11-23 07:44:22,298 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-11-23 07:44:22,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-11-23 07:44:22,492 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [aws_atomic_priv_xlate_orderErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:44:22,492 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:44:22,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1231676590, now seen corresponding path program 1 times [2023-11-23 07:44:22,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:44:22,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035922534] [2023-11-23 07:44:22,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:44:22,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:44:22,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:23,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:23,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:23,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:44:23,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:23,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:23,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:23,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-23 07:44:23,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:23,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 07:44:23,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:23,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-23 07:44:23,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:23,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 07:44:23,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:23,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-23 07:44:23,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:23,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:23,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:23,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:23,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:23,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-23 07:44:23,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:23,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:23,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:23,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:23,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:23,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-23 07:44:23,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:23,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:23,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:23,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:23,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:23,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:23,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:23,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-23 07:44:23,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:23,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:23,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:23,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:23,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:23,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 07:44:23,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:23,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-23 07:44:23,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:23,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2023-11-23 07:44:23,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:23,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2023-11-23 07:44:23,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:23,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:23,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:23,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:23,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:23,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:23,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:23,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-23 07:44:23,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:23,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:23,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:23,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:23,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:23,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 07:44:23,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:23,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-23 07:44:23,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:23,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2023-11-23 07:44:23,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:23,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2023-11-23 07:44:23,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:23,359 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 12 proven. 49 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2023-11-23 07:44:23,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:44:23,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035922534] [2023-11-23 07:44:23,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035922534] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:44:23,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [132845069] [2023-11-23 07:44:23,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:44:23,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:44:23,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:44:23,365 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 07:44:23,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-23 07:44:23,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:23,835 INFO L262 TraceCheckSpWp]: Trace formula consists of 3069 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-23 07:44:23,841 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:44:23,908 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2023-11-23 07:44:23,909 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 07:44:23,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [132845069] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:44:23,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 07:44:23,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 14 [2023-11-23 07:44:23,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218100094] [2023-11-23 07:44:23,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:44:23,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 07:44:23,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:44:23,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 07:44:23,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2023-11-23 07:44:23,911 INFO L87 Difference]: Start difference. First operand 123 states and 147 transitions. Second operand has 7 states, 6 states have (on average 12.666666666666666) internal successors, (76), 7 states have internal predecessors, (76), 3 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2023-11-23 07:44:24,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:44:24,144 INFO L93 Difference]: Finished difference Result 209 states and 257 transitions. [2023-11-23 07:44:24,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 07:44:24,145 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 12.666666666666666) internal successors, (76), 7 states have internal predecessors, (76), 3 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) Word has length 208 [2023-11-23 07:44:24,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:44:24,146 INFO L225 Difference]: With dead ends: 209 [2023-11-23 07:44:24,146 INFO L226 Difference]: Without dead ends: 123 [2023-11-23 07:44:24,146 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2023-11-23 07:44:24,147 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 7 mSDsluCounter, 591 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 713 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 07:44:24,147 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 713 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 07:44:24,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2023-11-23 07:44:24,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2023-11-23 07:44:24,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 75 states have (on average 1.1066666666666667) internal successors, (83), 76 states have internal predecessors, (83), 32 states have call successors, (32), 15 states have call predecessors, (32), 15 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2023-11-23 07:44:24,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 146 transitions. [2023-11-23 07:44:24,151 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 146 transitions. Word has length 208 [2023-11-23 07:44:24,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:44:24,152 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 146 transitions. [2023-11-23 07:44:24,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 12.666666666666666) internal successors, (76), 7 states have internal predecessors, (76), 3 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2023-11-23 07:44:24,152 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 146 transitions. [2023-11-23 07:44:24,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2023-11-23 07:44:24,153 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:44:24,153 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2023-11-23 07:44:24,169 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-11-23 07:44:24,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-11-23 07:44:24,369 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [aws_atomic_priv_xlate_orderErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:44:24,369 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:44:24,369 INFO L85 PathProgramCache]: Analyzing trace with hash 203684974, now seen corresponding path program 1 times [2023-11-23 07:44:24,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:44:24,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081002889] [2023-11-23 07:44:24,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:44:24,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:44:24,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:24,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:24,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:24,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:44:24,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:24,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:24,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:24,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-23 07:44:24,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:24,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 07:44:24,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:24,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-23 07:44:24,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:24,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 07:44:24,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:24,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-23 07:44:24,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:24,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:24,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:24,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:24,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:24,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-23 07:44:24,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:24,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:24,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:24,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:24,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:24,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-23 07:44:24,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:24,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:24,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:24,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:24,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:24,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:24,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:24,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 07:44:24,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:24,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:24,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:24,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:24,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:24,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 07:44:24,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:24,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 07:44:24,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:24,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2023-11-23 07:44:24,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:24,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-11-23 07:44:24,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:24,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:24,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:24,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:24,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:24,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:24,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:24,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 07:44:24,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:24,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:24,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:24,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:24,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:24,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 07:44:24,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:24,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 07:44:24,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:24,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2023-11-23 07:44:24,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:24,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2023-11-23 07:44:25,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:25,045 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2023-11-23 07:44:25,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:44:25,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081002889] [2023-11-23 07:44:25,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081002889] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:44:25,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 07:44:25,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 07:44:25,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408687435] [2023-11-23 07:44:25,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:44:25,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 07:44:25,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:44:25,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 07:44:25,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 07:44:25,047 INFO L87 Difference]: Start difference. First operand 123 states and 146 transitions. Second operand has 6 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (23), 4 states have call predecessors, (23), 2 states have return successors, (22), 2 states have call predecessors, (22), 1 states have call successors, (22) [2023-11-23 07:44:25,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:44:25,638 INFO L93 Difference]: Finished difference Result 163 states and 191 transitions. [2023-11-23 07:44:25,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 07:44:25,638 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (23), 4 states have call predecessors, (23), 2 states have return successors, (22), 2 states have call predecessors, (22), 1 states have call successors, (22) Word has length 212 [2023-11-23 07:44:25,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:44:25,639 INFO L225 Difference]: With dead ends: 163 [2023-11-23 07:44:25,639 INFO L226 Difference]: Without dead ends: 126 [2023-11-23 07:44:25,641 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-23 07:44:25,641 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 112 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-23 07:44:25,641 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 164 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-23 07:44:25,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2023-11-23 07:44:25,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2023-11-23 07:44:25,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 76 states have (on average 1.105263157894737) internal successors, (84), 77 states have internal predecessors, (84), 32 states have call successors, (32), 15 states have call predecessors, (32), 15 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2023-11-23 07:44:25,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 147 transitions. [2023-11-23 07:44:25,646 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 147 transitions. Word has length 212 [2023-11-23 07:44:25,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:44:25,646 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 147 transitions. [2023-11-23 07:44:25,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (23), 4 states have call predecessors, (23), 2 states have return successors, (22), 2 states have call predecessors, (22), 1 states have call successors, (22) [2023-11-23 07:44:25,647 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 147 transitions. [2023-11-23 07:44:25,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2023-11-23 07:44:25,648 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:44:25,648 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2023-11-23 07:44:25,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-23 07:44:25,648 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [aws_atomic_priv_xlate_orderErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:44:25,648 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:44:25,649 INFO L85 PathProgramCache]: Analyzing trace with hash -124365197, now seen corresponding path program 1 times [2023-11-23 07:44:25,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:44:25,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356726905] [2023-11-23 07:44:25,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:44:25,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:44:25,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:26,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:26,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:26,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:44:26,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:26,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:26,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:26,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-23 07:44:26,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:26,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 07:44:26,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:26,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-23 07:44:26,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:26,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 07:44:26,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:26,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-23 07:44:26,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:26,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:26,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:26,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:26,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:26,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-23 07:44:26,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:26,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:26,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:26,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:26,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:26,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-23 07:44:26,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:26,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:26,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:26,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:26,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:26,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:26,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:26,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 07:44:26,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:26,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:26,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:26,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:26,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:26,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 07:44:26,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:26,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 07:44:26,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:26,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2023-11-23 07:44:26,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:26,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-11-23 07:44:26,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:26,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:26,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:26,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:26,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:26,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:26,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:26,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 07:44:26,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:26,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:26,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:26,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:26,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:26,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 07:44:26,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:26,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 07:44:26,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:26,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2023-11-23 07:44:26,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:26,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2023-11-23 07:44:26,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:26,353 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2023-11-23 07:44:26,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:44:26,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356726905] [2023-11-23 07:44:26,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356726905] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:44:26,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [529185994] [2023-11-23 07:44:26,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:44:26,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:44:26,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:44:26,354 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 07:44:26,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-11-23 07:44:26,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:26,981 INFO L262 TraceCheckSpWp]: Trace formula consists of 3096 conjuncts, 59 conjunts are in the unsatisfiable core [2023-11-23 07:44:26,989 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:44:27,067 INFO L378 Elim1Store]: Elim1 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 19 treesize of output 1 [2023-11-23 07:44:27,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2023-11-23 07:44:28,027 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2023-11-23 07:44:28,028 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 07:44:28,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [529185994] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:44:28,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 07:44:28,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [7] total 23 [2023-11-23 07:44:28,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002757773] [2023-11-23 07:44:28,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:44:28,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-23 07:44:28,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:44:28,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-23 07:44:28,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=442, Unknown=0, NotChecked=0, Total=506 [2023-11-23 07:44:28,030 INFO L87 Difference]: Start difference. First operand 124 states and 147 transitions. Second operand has 18 states, 13 states have (on average 7.384615384615385) internal successors, (96), 15 states have internal predecessors, (96), 9 states have call successors, (29), 3 states have call predecessors, (29), 8 states have return successors, (29), 11 states have call predecessors, (29), 9 states have call successors, (29) [2023-11-23 07:44:30,666 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:44:33,965 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:44:35,982 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:44:38,713 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:44:40,736 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:44:42,757 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:44:44,824 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:44:44,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:44:44,833 INFO L93 Difference]: Finished difference Result 239 states and 282 transitions. [2023-11-23 07:44:44,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-23 07:44:44,834 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 13 states have (on average 7.384615384615385) internal successors, (96), 15 states have internal predecessors, (96), 9 states have call successors, (29), 3 states have call predecessors, (29), 8 states have return successors, (29), 11 states have call predecessors, (29), 9 states have call successors, (29) Word has length 213 [2023-11-23 07:44:44,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:44:44,835 INFO L225 Difference]: With dead ends: 239 [2023-11-23 07:44:44,835 INFO L226 Difference]: Without dead ends: 156 [2023-11-23 07:44:44,836 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 251 SyntacticMatches, 12 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=70, Invalid=482, Unknown=0, NotChecked=0, Total=552 [2023-11-23 07:44:44,837 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 53 mSDsluCounter, 625 mSDsCounter, 0 mSdLazyCounter, 772 mSolverCounterSat, 8 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 723 SdHoareTripleChecker+Invalid, 787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 772 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.7s IncrementalHoareTripleChecker+Time [2023-11-23 07:44:44,837 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 723 Invalid, 787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 772 Invalid, 7 Unknown, 0 Unchecked, 16.7s Time] [2023-11-23 07:44:44,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2023-11-23 07:44:44,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2023-11-23 07:44:44,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 100 states have (on average 1.11) internal successors, (111), 102 states have internal predecessors, (111), 34 states have call successors, (34), 19 states have call predecessors, (34), 21 states have return successors, (36), 34 states have call predecessors, (36), 33 states have call successors, (36) [2023-11-23 07:44:44,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 181 transitions. [2023-11-23 07:44:44,847 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 181 transitions. Word has length 213 [2023-11-23 07:44:44,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:44:44,848 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 181 transitions. [2023-11-23 07:44:44,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 13 states have (on average 7.384615384615385) internal successors, (96), 15 states have internal predecessors, (96), 9 states have call successors, (29), 3 states have call predecessors, (29), 8 states have return successors, (29), 11 states have call predecessors, (29), 9 states have call successors, (29) [2023-11-23 07:44:44,848 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 181 transitions. [2023-11-23 07:44:44,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2023-11-23 07:44:44,849 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:44:44,849 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2023-11-23 07:44:44,872 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-11-23 07:44:45,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-11-23 07:44:45,061 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [aws_atomic_priv_xlate_orderErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:44:45,061 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:44:45,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1476705909, now seen corresponding path program 1 times [2023-11-23 07:44:45,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:44:45,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786731658] [2023-11-23 07:44:45,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:44:45,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:44:45,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:47,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:47,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:47,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:44:47,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:47,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:47,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:47,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-23 07:44:47,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:47,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 07:44:47,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:47,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-23 07:44:47,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:47,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 07:44:47,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:47,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-23 07:44:47,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:47,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:47,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:47,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:47,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:47,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-23 07:44:47,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:47,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:47,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:47,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:47,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:47,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-23 07:44:47,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:47,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:47,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:47,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:47,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:47,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:47,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:47,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 07:44:47,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:47,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:47,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:47,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:47,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:47,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 07:44:47,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:47,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 07:44:47,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:47,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2023-11-23 07:44:47,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:47,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-11-23 07:44:47,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:47,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:47,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:47,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:47,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:47,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:47,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:47,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 07:44:47,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:47,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:47,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:47,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:44:47,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:47,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 07:44:47,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:47,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 07:44:47,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:47,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2023-11-23 07:44:47,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:47,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2023-11-23 07:44:47,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:47,369 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2023-11-23 07:44:47,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:44:47,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786731658] [2023-11-23 07:44:47,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786731658] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:44:47,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [238751892] [2023-11-23 07:44:47,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:44:47,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:44:47,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:44:47,371 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 07:44:47,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-11-23 07:44:48,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:44:48,023 INFO L262 TraceCheckSpWp]: Trace formula consists of 3091 conjuncts, 55 conjunts are in the unsatisfiable core [2023-11-23 07:44:48,028 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:44:48,109 INFO L378 Elim1Store]: Elim1 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 19 treesize of output 1 [2023-11-23 07:44:48,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2023-11-23 07:44:49,178 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 163 proven. 6 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2023-11-23 07:44:49,178 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 07:44:49,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [238751892] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:44:49,934 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-23 07:44:49,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 19] total 30 [2023-11-23 07:44:49,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650877797] [2023-11-23 07:44:49,934 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-23 07:44:49,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-11-23 07:44:49,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:44:49,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-11-23 07:44:49,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1436, Unknown=0, NotChecked=0, Total=1560 [2023-11-23 07:44:49,937 INFO L87 Difference]: Start difference. First operand 156 states and 181 transitions. Second operand has 30 states, 22 states have (on average 6.818181818181818) internal successors, (150), 24 states have internal predecessors, (150), 13 states have call successors, (51), 7 states have call predecessors, (51), 10 states have return successors, (50), 13 states have call predecessors, (50), 12 states have call successors, (50) [2023-11-23 07:44:54,583 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:44:56,782 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:44:58,912 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:45:03,042 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:45:05,051 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:45:07,146 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:45:09,156 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:45:11,165 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:45:13,172 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:45:13,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:45:13,739 INFO L93 Difference]: Finished difference Result 299 states and 353 transitions. [2023-11-23 07:45:13,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-11-23 07:45:13,740 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 22 states have (on average 6.818181818181818) internal successors, (150), 24 states have internal predecessors, (150), 13 states have call successors, (51), 7 states have call predecessors, (51), 10 states have return successors, (50), 13 states have call predecessors, (50), 12 states have call successors, (50) Word has length 213 [2023-11-23 07:45:13,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:45:13,741 INFO L225 Difference]: With dead ends: 299 [2023-11-23 07:45:13,741 INFO L226 Difference]: Without dead ends: 159 [2023-11-23 07:45:13,743 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 464 GetRequests, 388 SyntacticMatches, 13 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 838 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=353, Invalid=3807, Unknown=0, NotChecked=0, Total=4160 [2023-11-23 07:45:13,743 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 241 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 2661 mSolverCounterSat, 134 mSolverCounterUnsat, 17 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 2812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 2661 IncrementalHoareTripleChecker+Invalid, 17 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.9s IncrementalHoareTripleChecker+Time [2023-11-23 07:45:13,744 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 516 Invalid, 2812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 2661 Invalid, 17 Unknown, 0 Unchecked, 22.9s Time] [2023-11-23 07:45:13,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2023-11-23 07:45:13,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 157. [2023-11-23 07:45:13,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 101 states have (on average 1.108910891089109) internal successors, (112), 103 states have internal predecessors, (112), 34 states have call successors, (34), 19 states have call predecessors, (34), 21 states have return successors, (35), 34 states have call predecessors, (35), 33 states have call successors, (35) [2023-11-23 07:45:13,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 181 transitions. [2023-11-23 07:45:13,761 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 181 transitions. Word has length 213 [2023-11-23 07:45:13,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:45:13,761 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 181 transitions. [2023-11-23 07:45:13,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 22 states have (on average 6.818181818181818) internal successors, (150), 24 states have internal predecessors, (150), 13 states have call successors, (51), 7 states have call predecessors, (51), 10 states have return successors, (50), 13 states have call predecessors, (50), 12 states have call successors, (50) [2023-11-23 07:45:13,762 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 181 transitions. [2023-11-23 07:45:13,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2023-11-23 07:45:13,763 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:45:13,763 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2023-11-23 07:45:13,785 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-11-23 07:45:13,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:45:13,984 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [aws_atomic_priv_xlate_orderErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:45:13,984 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:45:13,984 INFO L85 PathProgramCache]: Analyzing trace with hash 228504972, now seen corresponding path program 2 times [2023-11-23 07:45:13,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:45:13,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163216233] [2023-11-23 07:45:13,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:45:13,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:45:14,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:14,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:45:14,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:14,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:45:14,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:14,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:45:14,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:14,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-23 07:45:14,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:14,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 07:45:14,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:14,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-23 07:45:14,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:14,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 07:45:14,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:14,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-23 07:45:14,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:14,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:45:14,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:14,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:45:14,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:14,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-23 07:45:14,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:14,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:45:14,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:14,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:45:14,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:14,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-23 07:45:14,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:14,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:45:14,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:14,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:45:14,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:14,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:45:14,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:14,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 07:45:14,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:14,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:45:14,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:14,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:45:14,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:14,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 07:45:14,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:14,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 07:45:14,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:14,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2023-11-23 07:45:14,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:14,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-11-23 07:45:14,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:14,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:45:14,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:14,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:45:14,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:14,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:45:14,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:14,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 07:45:14,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:14,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:45:14,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:14,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:45:14,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:14,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 07:45:14,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:14,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 07:45:14,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:14,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2023-11-23 07:45:14,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:14,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2023-11-23 07:45:14,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:14,787 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2023-11-23 07:45:14,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:45:14,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163216233] [2023-11-23 07:45:14,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163216233] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:45:14,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2004926145] [2023-11-23 07:45:14,788 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-23 07:45:14,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:45:14,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:45:14,805 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 07:45:14,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-11-23 07:45:15,613 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-23 07:45:15,613 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-23 07:45:15,627 INFO L262 TraceCheckSpWp]: Trace formula consists of 3100 conjuncts, 43 conjunts are in the unsatisfiable core [2023-11-23 07:45:15,632 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:45:15,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-23 07:45:15,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-23 07:45:15,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:45:15,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2023-11-23 07:45:15,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:45:15,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-11-23 07:45:15,903 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2023-11-23 07:45:15,903 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 07:45:16,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 90 [2023-11-23 07:45:16,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 100 [2023-11-23 07:45:16,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2023-11-23 07:45:16,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 56 [2023-11-23 07:45:16,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 50 [2023-11-23 07:45:16,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 56 [2023-11-23 07:45:16,416 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2023-11-23 07:45:16,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2004926145] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 07:45:16,417 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 07:45:16,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 10] total 25 [2023-11-23 07:45:16,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489239231] [2023-11-23 07:45:16,417 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 07:45:16,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-11-23 07:45:16,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:45:16,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-23 07:45:16,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=541, Unknown=0, NotChecked=0, Total=600 [2023-11-23 07:45:16,419 INFO L87 Difference]: Start difference. First operand 157 states and 181 transitions. Second operand has 25 states, 23 states have (on average 4.304347826086956) internal successors, (99), 21 states have internal predecessors, (99), 6 states have call successors, (42), 6 states have call predecessors, (42), 4 states have return successors, (38), 7 states have call predecessors, (38), 4 states have call successors, (38) [2023-11-23 07:45:18,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:45:18,976 INFO L93 Difference]: Finished difference Result 217 states and 251 transitions. [2023-11-23 07:45:18,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-23 07:45:18,976 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 4.304347826086956) internal successors, (99), 21 states have internal predecessors, (99), 6 states have call successors, (42), 6 states have call predecessors, (42), 4 states have return successors, (38), 7 states have call predecessors, (38), 4 states have call successors, (38) Word has length 214 [2023-11-23 07:45:18,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:45:18,977 INFO L225 Difference]: With dead ends: 217 [2023-11-23 07:45:18,977 INFO L226 Difference]: Without dead ends: 180 [2023-11-23 07:45:18,978 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 514 GetRequests, 478 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=154, Invalid=1252, Unknown=0, NotChecked=0, Total=1406 [2023-11-23 07:45:18,979 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 172 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 2037 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 2136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 2037 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-11-23 07:45:18,980 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 535 Invalid, 2136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 2037 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2023-11-23 07:45:18,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2023-11-23 07:45:18,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 162. [2023-11-23 07:45:18,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 105 states have (on average 1.1047619047619048) internal successors, (116), 107 states have internal predecessors, (116), 34 states have call successors, (34), 20 states have call predecessors, (34), 22 states have return successors, (35), 34 states have call predecessors, (35), 33 states have call successors, (35) [2023-11-23 07:45:18,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 185 transitions. [2023-11-23 07:45:18,989 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 185 transitions. Word has length 214 [2023-11-23 07:45:18,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:45:18,990 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 185 transitions. [2023-11-23 07:45:18,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 4.304347826086956) internal successors, (99), 21 states have internal predecessors, (99), 6 states have call successors, (42), 6 states have call predecessors, (42), 4 states have return successors, (38), 7 states have call predecessors, (38), 4 states have call successors, (38) [2023-11-23 07:45:18,990 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 185 transitions. [2023-11-23 07:45:18,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2023-11-23 07:45:18,991 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:45:18,991 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2023-11-23 07:45:19,011 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-11-23 07:45:19,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-11-23 07:45:19,201 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [aws_atomic_priv_xlate_orderErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:45:19,202 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:45:19,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1561908968, now seen corresponding path program 1 times [2023-11-23 07:45:19,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:45:19,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089521779] [2023-11-23 07:45:19,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:45:19,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:45:19,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:19,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:45:19,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:19,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:45:19,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:19,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:45:19,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:19,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-23 07:45:19,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:19,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 07:45:19,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:19,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-23 07:45:19,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:19,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 07:45:19,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:19,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-23 07:45:19,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:19,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:45:19,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:19,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:45:19,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:19,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-23 07:45:19,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:19,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:45:19,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:19,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:45:19,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:19,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-23 07:45:19,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:19,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:45:19,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:19,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:45:19,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:19,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:45:19,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:19,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 07:45:19,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:19,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:45:19,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:19,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:45:19,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:19,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 07:45:19,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:19,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 07:45:19,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:19,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2023-11-23 07:45:19,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:19,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-11-23 07:45:19,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:19,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:45:19,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:19,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:45:19,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:19,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:45:19,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:19,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 07:45:19,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:19,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:45:19,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:19,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:45:19,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:19,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 07:45:19,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:19,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 07:45:19,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:19,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2023-11-23 07:45:19,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:19,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2023-11-23 07:45:19,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:19,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2023-11-23 07:45:19,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:19,943 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2023-11-23 07:45:19,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:45:19,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089521779] [2023-11-23 07:45:19,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089521779] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:45:19,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [380790876] [2023-11-23 07:45:19,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:45:19,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:45:19,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:45:19,961 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 07:45:19,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-11-23 07:45:20,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:20,475 INFO L262 TraceCheckSpWp]: Trace formula consists of 3127 conjuncts, 37 conjunts are in the unsatisfiable core [2023-11-23 07:45:20,480 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:45:20,533 INFO L378 Elim1Store]: Elim1 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 19 treesize of output 1 [2023-11-23 07:45:20,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2023-11-23 07:45:21,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2023-11-23 07:45:21,413 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2023-11-23 07:45:21,413 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 07:45:21,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [380790876] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:45:21,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 07:45:21,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [9] total 18 [2023-11-23 07:45:21,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033961623] [2023-11-23 07:45:21,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:45:21,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-23 07:45:21,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:45:21,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-23 07:45:21,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2023-11-23 07:45:21,414 INFO L87 Difference]: Start difference. First operand 162 states and 185 transitions. Second operand has 11 states, 9 states have (on average 7.111111111111111) internal successors, (64), 10 states have internal predecessors, (64), 8 states have call successors, (24), 3 states have call predecessors, (24), 4 states have return successors, (23), 8 states have call predecessors, (23), 8 states have call successors, (23) [2023-11-23 07:45:23,608 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:45:25,743 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:45:27,752 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:45:30,029 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:45:32,037 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:45:34,053 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:45:36,075 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:45:36,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:45:36,078 INFO L93 Difference]: Finished difference Result 209 states and 236 transitions. [2023-11-23 07:45:36,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-23 07:45:36,079 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 7.111111111111111) internal successors, (64), 10 states have internal predecessors, (64), 8 states have call successors, (24), 3 states have call predecessors, (24), 4 states have return successors, (23), 8 states have call predecessors, (23), 8 states have call successors, (23) Word has length 221 [2023-11-23 07:45:36,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:45:36,080 INFO L225 Difference]: With dead ends: 209 [2023-11-23 07:45:36,080 INFO L226 Difference]: Without dead ends: 162 [2023-11-23 07:45:36,080 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 261 SyntacticMatches, 19 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2023-11-23 07:45:36,081 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 26 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 6 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.6s IncrementalHoareTripleChecker+Time [2023-11-23 07:45:36,081 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 749 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 440 Invalid, 7 Unknown, 0 Unchecked, 14.6s Time] [2023-11-23 07:45:36,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2023-11-23 07:45:36,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2023-11-23 07:45:36,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 105 states have (on average 1.0952380952380953) internal successors, (115), 107 states have internal predecessors, (115), 34 states have call successors, (34), 20 states have call predecessors, (34), 22 states have return successors, (35), 34 states have call predecessors, (35), 33 states have call successors, (35) [2023-11-23 07:45:36,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 184 transitions. [2023-11-23 07:45:36,089 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 184 transitions. Word has length 221 [2023-11-23 07:45:36,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:45:36,090 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 184 transitions. [2023-11-23 07:45:36,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 7.111111111111111) internal successors, (64), 10 states have internal predecessors, (64), 8 states have call successors, (24), 3 states have call predecessors, (24), 4 states have return successors, (23), 8 states have call predecessors, (23), 8 states have call successors, (23) [2023-11-23 07:45:36,090 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 184 transitions. [2023-11-23 07:45:36,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2023-11-23 07:45:36,091 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:45:36,091 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2023-11-23 07:45:36,116 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-11-23 07:45:36,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:45:36,316 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [aws_atomic_priv_xlate_orderErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:45:36,317 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:45:36,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1946327109, now seen corresponding path program 1 times [2023-11-23 07:45:36,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:45:36,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784700916] [2023-11-23 07:45:36,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:45:36,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:45:36,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:36,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:45:36,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:36,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:45:36,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:36,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:45:36,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:36,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-23 07:45:36,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:36,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 07:45:36,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:36,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-23 07:45:36,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:36,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 07:45:36,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:36,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-23 07:45:36,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:36,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:45:36,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:36,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:45:36,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:36,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-23 07:45:36,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:36,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:45:36,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:36,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:45:36,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:36,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-23 07:45:36,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:36,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:45:36,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:36,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:45:36,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:36,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:45:36,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:36,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 07:45:36,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:36,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:45:36,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:36,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:45:36,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:36,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 07:45:36,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:36,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 07:45:36,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:36,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2023-11-23 07:45:36,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:36,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-11-23 07:45:36,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:36,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:45:36,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:36,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:45:36,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:36,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:45:36,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:36,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 07:45:36,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:36,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:45:36,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:36,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:45:36,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:36,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 07:45:36,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:36,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 07:45:36,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:36,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2023-11-23 07:45:36,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:36,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2023-11-23 07:45:36,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:36,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:45:36,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:36,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 07:45:36,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:36,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2023-11-23 07:45:36,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:36,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2023-11-23 07:45:36,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:36,985 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 304 trivial. 0 not checked. [2023-11-23 07:45:36,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:45:36,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784700916] [2023-11-23 07:45:36,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784700916] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:45:36,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1432334604] [2023-11-23 07:45:36,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:45:36,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:45:36,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:45:36,986 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 07:45:36,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-11-23 07:45:37,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:37,570 INFO L262 TraceCheckSpWp]: Trace formula consists of 3180 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-23 07:45:37,574 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:45:37,633 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 64 proven. 2 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2023-11-23 07:45:37,634 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 07:45:37,879 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2023-11-23 07:45:37,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1432334604] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 07:45:37,879 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 07:45:37,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 18 [2023-11-23 07:45:37,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077069155] [2023-11-23 07:45:37,879 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 07:45:37,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-23 07:45:37,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:45:37,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-23 07:45:37,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2023-11-23 07:45:37,881 INFO L87 Difference]: Start difference. First operand 162 states and 184 transitions. Second operand has 18 states, 15 states have (on average 7.466666666666667) internal successors, (112), 13 states have internal predecessors, (112), 4 states have call successors, (39), 5 states have call predecessors, (39), 5 states have return successors, (40), 6 states have call predecessors, (40), 4 states have call successors, (40) [2023-11-23 07:45:39,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:45:39,904 INFO L93 Difference]: Finished difference Result 283 states and 326 transitions. [2023-11-23 07:45:39,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-23 07:45:39,905 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 7.466666666666667) internal successors, (112), 13 states have internal predecessors, (112), 4 states have call successors, (39), 5 states have call predecessors, (39), 5 states have return successors, (40), 6 states have call predecessors, (40), 4 states have call successors, (40) Word has length 239 [2023-11-23 07:45:39,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:45:39,906 INFO L225 Difference]: With dead ends: 283 [2023-11-23 07:45:39,906 INFO L226 Difference]: Without dead ends: 165 [2023-11-23 07:45:39,907 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 572 GetRequests, 545 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=694, Unknown=0, NotChecked=0, Total=812 [2023-11-23 07:45:39,907 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 118 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 1295 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 1379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 1295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-11-23 07:45:39,907 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 516 Invalid, 1379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 1295 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-11-23 07:45:39,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2023-11-23 07:45:39,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 163. [2023-11-23 07:45:39,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 106 states have (on average 1.0754716981132075) internal successors, (114), 108 states have internal predecessors, (114), 34 states have call successors, (34), 20 states have call predecessors, (34), 22 states have return successors, (35), 34 states have call predecessors, (35), 33 states have call successors, (35) [2023-11-23 07:45:39,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 183 transitions. [2023-11-23 07:45:39,917 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 183 transitions. Word has length 239 [2023-11-23 07:45:39,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:45:39,917 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 183 transitions. [2023-11-23 07:45:39,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 7.466666666666667) internal successors, (112), 13 states have internal predecessors, (112), 4 states have call successors, (39), 5 states have call predecessors, (39), 5 states have return successors, (40), 6 states have call predecessors, (40), 4 states have call successors, (40) [2023-11-23 07:45:39,917 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 183 transitions. [2023-11-23 07:45:39,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2023-11-23 07:45:39,918 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:45:39,918 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2023-11-23 07:45:39,938 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2023-11-23 07:45:40,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:45:40,139 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [aws_atomic_priv_xlate_orderErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:45:40,139 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:45:40,139 INFO L85 PathProgramCache]: Analyzing trace with hash 947930244, now seen corresponding path program 1 times [2023-11-23 07:45:40,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:45:40,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827322775] [2023-11-23 07:45:40,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:45:40,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:45:40,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:40,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:45:40,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:40,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:45:40,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:40,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:45:40,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:40,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-23 07:45:40,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:40,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 07:45:40,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:40,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-23 07:45:40,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:40,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-23 07:45:40,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:40,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-23 07:45:40,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:40,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:45:40,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:40,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:45:40,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:40,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-23 07:45:40,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:40,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:45:40,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:40,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:45:40,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:40,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-23 07:45:40,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:40,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:45:40,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:40,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:45:40,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:40,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:45:40,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:40,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 07:45:40,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:40,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:45:40,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:40,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:45:40,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:40,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 07:45:40,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:40,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 07:45:40,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:40,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2023-11-23 07:45:40,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:40,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-11-23 07:45:40,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:40,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:45:40,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:40,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:45:40,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:40,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:45:40,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:40,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 07:45:40,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:40,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:45:40,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:40,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:45:40,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:40,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 07:45:40,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:40,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 07:45:40,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:40,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2023-11-23 07:45:40,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:40,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2023-11-23 07:45:40,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:40,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:45:40,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:40,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 07:45:40,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:40,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2023-11-23 07:45:40,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:40,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2023-11-23 07:45:40,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:40,864 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 304 trivial. 0 not checked. [2023-11-23 07:45:40,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:45:40,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827322775] [2023-11-23 07:45:40,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827322775] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:45:40,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1935440562] [2023-11-23 07:45:40,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:45:40,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:45:40,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:45:40,873 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 07:45:40,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-11-23 07:45:41,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:45:41,352 INFO L262 TraceCheckSpWp]: Trace formula consists of 3194 conjuncts, 124 conjunts are in the unsatisfiable core [2023-11-23 07:45:41,358 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:45:41,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-23 07:45:41,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:45:41,543 INFO L349 Elim1Store]: treesize reduction 37, result has 31.5 percent of original size [2023-11-23 07:45:41,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 31 [2023-11-23 07:45:41,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-23 07:45:42,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2023-11-23 07:45:42,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 47 [2023-11-23 07:45:42,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 73 [2023-11-23 07:45:42,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 30 [2023-11-23 07:45:58,317 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_old(#memory_$Pointer$#5.offset)| |c_#Ultimate.C_memset#5_#ptr.base|)) (.cse4 (select |c_#memory_$Pointer$#5.offset| |c_#Ultimate.C_memset#5_#ptr.base|)) (.cse0 (select |c_old(#memory_$Pointer$#5.base)| |c_#Ultimate.C_memset#5_#ptr.base|))) (or (exists ((|v_#Ultimate.C_memset#5_#t~loopctr1362_29| Int) (|v_#Ultimate.C_memset#5_#t~loopctr1362_30| Int)) (let ((.cse1 (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_30| |c_#Ultimate.C_memset#5_#ptr.offset|)) (.cse2 (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_29| |c_#Ultimate.C_memset#5_#ptr.offset|))) (and (= |c_#memory_$Pointer$#5.base| (store |c_old(#memory_$Pointer$#5.base)| |c_#Ultimate.C_memset#5_#ptr.base| (store (store .cse0 .cse1 0) .cse2 0))) (<= |v_#Ultimate.C_memset#5_#t~loopctr1362_29| 0) (<= |v_#Ultimate.C_memset#5_#t~loopctr1362_29| (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_30| 1)) (<= |v_#Ultimate.C_memset#5_#t~loopctr1362_30| (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_29| 1)) (not (= |v_#Ultimate.C_memset#5_#t~loopctr1362_30| |v_#Ultimate.C_memset#5_#t~loopctr1362_29|)) (= (store |c_old(#memory_$Pointer$#5.offset)| |c_#Ultimate.C_memset#5_#ptr.base| (store (store .cse3 .cse1 (select .cse4 .cse1)) .cse2 (select .cse4 .cse2))) |c_#memory_$Pointer$#5.offset|)))) (exists ((|v_#Ultimate.C_memset#5_#t~loopctr1362_28| Int) (|v_#Ultimate.C_memset#5_#t~loopctr1362_31| Int)) (let ((.cse5 (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_28| |c_#Ultimate.C_memset#5_#ptr.offset|)) (.cse6 (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_31| |c_#Ultimate.C_memset#5_#ptr.offset|))) (and (= (store |c_old(#memory_$Pointer$#5.offset)| |c_#Ultimate.C_memset#5_#ptr.base| (store (store .cse3 .cse5 (select .cse4 .cse5)) .cse6 (select .cse4 .cse6))) |c_#memory_$Pointer$#5.offset|) (<= |v_#Ultimate.C_memset#5_#t~loopctr1362_31| (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_28| 1)) (= |c_#memory_$Pointer$#5.base| (store |c_old(#memory_$Pointer$#5.base)| |c_#Ultimate.C_memset#5_#ptr.base| (store (store .cse0 .cse5 0) .cse6 0))) (not (= |v_#Ultimate.C_memset#5_#t~loopctr1362_31| |v_#Ultimate.C_memset#5_#t~loopctr1362_28|)) (<= |v_#Ultimate.C_memset#5_#t~loopctr1362_28| 0)))) (exists ((|v_#Ultimate.C_memset#5_#t~loopctr1362_28| Int) (|v_#Ultimate.C_memset#5_#t~loopctr1362_31| Int) (|v_#Ultimate.C_memset#5_#t~loopctr1362_30| Int)) (let ((.cse7 (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_28| |c_#Ultimate.C_memset#5_#ptr.offset|)) (.cse8 (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_30| |c_#Ultimate.C_memset#5_#ptr.offset|)) (.cse9 (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_31| |c_#Ultimate.C_memset#5_#ptr.offset|))) (and (<= |v_#Ultimate.C_memset#5_#t~loopctr1362_31| (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_30| 1)) (not (= |v_#Ultimate.C_memset#5_#t~loopctr1362_31| |v_#Ultimate.C_memset#5_#t~loopctr1362_30|)) (= |c_#memory_$Pointer$#5.offset| (store |c_old(#memory_$Pointer$#5.offset)| |c_#Ultimate.C_memset#5_#ptr.base| (store (store (store .cse3 .cse7 (select .cse4 .cse7)) .cse8 (select .cse4 .cse8)) .cse9 (select .cse4 .cse9)))) (= (store |c_old(#memory_$Pointer$#5.base)| |c_#Ultimate.C_memset#5_#ptr.base| (store (store (store .cse0 .cse7 0) .cse8 0) .cse9 0)) |c_#memory_$Pointer$#5.base|) (not (= |v_#Ultimate.C_memset#5_#t~loopctr1362_31| |v_#Ultimate.C_memset#5_#t~loopctr1362_28|)) (<= |v_#Ultimate.C_memset#5_#t~loopctr1362_28| 0) (<= |v_#Ultimate.C_memset#5_#t~loopctr1362_30| (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_28| 1)) (not (= |v_#Ultimate.C_memset#5_#t~loopctr1362_30| |v_#Ultimate.C_memset#5_#t~loopctr1362_28|))))) (exists ((|v_#Ultimate.C_memset#5_#t~loopctr1362_28| Int) (|v_#Ultimate.C_memset#5_#t~loopctr1362_29| Int) (|v_#Ultimate.C_memset#5_#t~loopctr1362_30| Int)) (let ((.cse10 (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_29| |c_#Ultimate.C_memset#5_#ptr.offset|)) (.cse11 (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_30| |c_#Ultimate.C_memset#5_#ptr.offset|)) (.cse12 (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_28| |c_#Ultimate.C_memset#5_#ptr.offset|))) (and (<= |v_#Ultimate.C_memset#5_#t~loopctr1362_29| (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_28| 1)) (= |c_#memory_$Pointer$#5.base| (store |c_old(#memory_$Pointer$#5.base)| |c_#Ultimate.C_memset#5_#ptr.base| (store (store (store .cse0 .cse10 0) .cse11 0) .cse12 0))) (<= |v_#Ultimate.C_memset#5_#t~loopctr1362_28| (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_30| 1)) (<= |v_#Ultimate.C_memset#5_#t~loopctr1362_30| (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_29| 1)) (not (= |v_#Ultimate.C_memset#5_#t~loopctr1362_30| |v_#Ultimate.C_memset#5_#t~loopctr1362_29|)) (not (= |v_#Ultimate.C_memset#5_#t~loopctr1362_29| |v_#Ultimate.C_memset#5_#t~loopctr1362_28|)) (<= |v_#Ultimate.C_memset#5_#t~loopctr1362_28| 0) (= (store |c_old(#memory_$Pointer$#5.offset)| |c_#Ultimate.C_memset#5_#ptr.base| (store (store (store .cse3 .cse10 (select .cse4 .cse10)) .cse11 (select .cse4 .cse11)) .cse12 (select .cse4 .cse12))) |c_#memory_$Pointer$#5.offset|) (not (= |v_#Ultimate.C_memset#5_#t~loopctr1362_30| |v_#Ultimate.C_memset#5_#t~loopctr1362_28|))))) (exists ((|v_#Ultimate.C_memset#5_#t~loopctr1362_28| Int) (|v_#Ultimate.C_memset#5_#t~loopctr1362_29| Int) (|v_#Ultimate.C_memset#5_#t~loopctr1362_31| Int) (|v_#Ultimate.C_memset#5_#t~loopctr1362_30| Int)) (let ((.cse13 (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_28| |c_#Ultimate.C_memset#5_#ptr.offset|)) (.cse14 (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_29| |c_#Ultimate.C_memset#5_#ptr.offset|)) (.cse15 (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_30| |c_#Ultimate.C_memset#5_#ptr.offset|)) (.cse16 (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_31| |c_#Ultimate.C_memset#5_#ptr.offset|))) (and (<= |v_#Ultimate.C_memset#5_#t~loopctr1362_31| (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_30| 1)) (not (= |v_#Ultimate.C_memset#5_#t~loopctr1362_31| |v_#Ultimate.C_memset#5_#t~loopctr1362_30|)) (<= |v_#Ultimate.C_memset#5_#t~loopctr1362_29| (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_28| 1)) (not (= |v_#Ultimate.C_memset#5_#t~loopctr1362_31| |v_#Ultimate.C_memset#5_#t~loopctr1362_29|)) (<= |v_#Ultimate.C_memset#5_#t~loopctr1362_30| (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_29| 1)) (not (= |v_#Ultimate.C_memset#5_#t~loopctr1362_30| |v_#Ultimate.C_memset#5_#t~loopctr1362_29|)) (= |c_#memory_$Pointer$#5.base| (store |c_old(#memory_$Pointer$#5.base)| |c_#Ultimate.C_memset#5_#ptr.base| (store (store (store (store .cse0 .cse13 0) .cse14 0) .cse15 0) .cse16 0))) (not (= |v_#Ultimate.C_memset#5_#t~loopctr1362_29| |v_#Ultimate.C_memset#5_#t~loopctr1362_28|)) (not (= |v_#Ultimate.C_memset#5_#t~loopctr1362_31| |v_#Ultimate.C_memset#5_#t~loopctr1362_28|)) (<= |v_#Ultimate.C_memset#5_#t~loopctr1362_28| 0) (= (store |c_old(#memory_$Pointer$#5.offset)| |c_#Ultimate.C_memset#5_#ptr.base| (store (store (store (store .cse3 .cse13 (select .cse4 .cse13)) .cse14 (select .cse4 .cse14)) .cse15 (select .cse4 .cse15)) .cse16 (select .cse4 .cse16))) |c_#memory_$Pointer$#5.offset|) (not (= |v_#Ultimate.C_memset#5_#t~loopctr1362_30| |v_#Ultimate.C_memset#5_#t~loopctr1362_28|))))) (exists ((|v_#Ultimate.C_memset#5_#t~loopctr1362_30| Int)) (let ((.cse17 (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_30| |c_#Ultimate.C_memset#5_#ptr.offset|))) (and (= |c_#memory_$Pointer$#5.base| (store |c_old(#memory_$Pointer$#5.base)| |c_#Ultimate.C_memset#5_#ptr.base| (store .cse0 .cse17 0))) (= (store |c_old(#memory_$Pointer$#5.offset)| |c_#Ultimate.C_memset#5_#ptr.base| (store .cse3 .cse17 (select .cse4 .cse17))) |c_#memory_$Pointer$#5.offset|) (<= |v_#Ultimate.C_memset#5_#t~loopctr1362_30| 0)))) (exists ((|v_#Ultimate.C_memset#5_#t~loopctr1362_29| Int) (|v_#Ultimate.C_memset#5_#t~loopctr1362_31| Int) (|v_#Ultimate.C_memset#5_#t~loopctr1362_30| Int)) (let ((.cse18 (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_30| 1)) (.cse19 (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_29| |c_#Ultimate.C_memset#5_#ptr.offset|)) (.cse20 (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_30| |c_#Ultimate.C_memset#5_#ptr.offset|)) (.cse21 (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_31| |c_#Ultimate.C_memset#5_#ptr.offset|))) (and (<= |v_#Ultimate.C_memset#5_#t~loopctr1362_31| .cse18) (not (= |v_#Ultimate.C_memset#5_#t~loopctr1362_31| |v_#Ultimate.C_memset#5_#t~loopctr1362_30|)) (<= |v_#Ultimate.C_memset#5_#t~loopctr1362_29| .cse18) (not (= |v_#Ultimate.C_memset#5_#t~loopctr1362_31| |v_#Ultimate.C_memset#5_#t~loopctr1362_29|)) (<= |v_#Ultimate.C_memset#5_#t~loopctr1362_30| (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_29| 1)) (= (store |c_old(#memory_$Pointer$#5.offset)| |c_#Ultimate.C_memset#5_#ptr.base| (store (store (store .cse3 .cse19 (select .cse4 .cse19)) .cse20 (select .cse4 .cse20)) .cse21 (select .cse4 .cse21))) |c_#memory_$Pointer$#5.offset|) (not (= |v_#Ultimate.C_memset#5_#t~loopctr1362_30| |v_#Ultimate.C_memset#5_#t~loopctr1362_29|)) (= |c_#memory_$Pointer$#5.base| (store |c_old(#memory_$Pointer$#5.base)| |c_#Ultimate.C_memset#5_#ptr.base| (store (store (store .cse0 .cse19 0) .cse20 0) .cse21 0))) (<= |v_#Ultimate.C_memset#5_#t~loopctr1362_30| 0)))) (exists ((|v_#Ultimate.C_memset#5_#t~loopctr1362_28| Int) (|v_#Ultimate.C_memset#5_#t~loopctr1362_29| Int) (|v_#Ultimate.C_memset#5_#t~loopctr1362_31| Int)) (let ((.cse22 (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_28| |c_#Ultimate.C_memset#5_#ptr.offset|)) (.cse23 (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_29| |c_#Ultimate.C_memset#5_#ptr.offset|)) (.cse24 (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_31| |c_#Ultimate.C_memset#5_#ptr.offset|))) (and (= (store |c_old(#memory_$Pointer$#5.offset)| |c_#Ultimate.C_memset#5_#ptr.base| (store (store (store .cse3 .cse22 (select .cse4 .cse22)) .cse23 (select .cse4 .cse23)) .cse24 (select .cse4 .cse24))) |c_#memory_$Pointer$#5.offset|) (<= |v_#Ultimate.C_memset#5_#t~loopctr1362_31| (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_29| 1)) (<= |v_#Ultimate.C_memset#5_#t~loopctr1362_29| (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_28| 1)) (not (= |v_#Ultimate.C_memset#5_#t~loopctr1362_31| |v_#Ultimate.C_memset#5_#t~loopctr1362_29|)) (not (= |v_#Ultimate.C_memset#5_#t~loopctr1362_29| |v_#Ultimate.C_memset#5_#t~loopctr1362_28|)) (not (= |v_#Ultimate.C_memset#5_#t~loopctr1362_31| |v_#Ultimate.C_memset#5_#t~loopctr1362_28|)) (<= |v_#Ultimate.C_memset#5_#t~loopctr1362_28| 0) (= (store |c_old(#memory_$Pointer$#5.base)| |c_#Ultimate.C_memset#5_#ptr.base| (store (store (store .cse0 .cse22 0) .cse23 0) .cse24 0)) |c_#memory_$Pointer$#5.base|)))) (exists ((|v_#Ultimate.C_memset#5_#t~loopctr1362_29| Int) (|v_#Ultimate.C_memset#5_#t~loopctr1362_31| Int) (|v_#Ultimate.C_memset#5_#t~loopctr1362_30| Int)) (let ((.cse25 (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_29| |c_#Ultimate.C_memset#5_#ptr.offset|)) (.cse26 (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_30| |c_#Ultimate.C_memset#5_#ptr.offset|)) (.cse27 (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_31| |c_#Ultimate.C_memset#5_#ptr.offset|))) (and (<= |v_#Ultimate.C_memset#5_#t~loopctr1362_31| (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_30| 1)) (not (= |v_#Ultimate.C_memset#5_#t~loopctr1362_31| |v_#Ultimate.C_memset#5_#t~loopctr1362_30|)) (<= |v_#Ultimate.C_memset#5_#t~loopctr1362_29| 0) (not (= |v_#Ultimate.C_memset#5_#t~loopctr1362_31| |v_#Ultimate.C_memset#5_#t~loopctr1362_29|)) (<= |v_#Ultimate.C_memset#5_#t~loopctr1362_30| (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_29| 1)) (= (store |c_old(#memory_$Pointer$#5.offset)| |c_#Ultimate.C_memset#5_#ptr.base| (store (store (store .cse3 .cse25 (select .cse4 .cse25)) .cse26 (select .cse4 .cse26)) .cse27 (select .cse4 .cse27))) |c_#memory_$Pointer$#5.offset|) (not (= |v_#Ultimate.C_memset#5_#t~loopctr1362_30| |v_#Ultimate.C_memset#5_#t~loopctr1362_29|)) (= |c_#memory_$Pointer$#5.base| (store |c_old(#memory_$Pointer$#5.base)| |c_#Ultimate.C_memset#5_#ptr.base| (store (store (store .cse0 .cse25 0) .cse26 0) .cse27 0)))))) (exists ((|v_#Ultimate.C_memset#5_#t~loopctr1362_28| Int) (|v_#Ultimate.C_memset#5_#t~loopctr1362_31| Int) (|v_#Ultimate.C_memset#5_#t~loopctr1362_30| Int)) (let ((.cse28 (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_28| |c_#Ultimate.C_memset#5_#ptr.offset|)) (.cse29 (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_30| |c_#Ultimate.C_memset#5_#ptr.offset|)) (.cse30 (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_31| |c_#Ultimate.C_memset#5_#ptr.offset|))) (and (<= |v_#Ultimate.C_memset#5_#t~loopctr1362_31| (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_30| 1)) (not (= |v_#Ultimate.C_memset#5_#t~loopctr1362_31| |v_#Ultimate.C_memset#5_#t~loopctr1362_30|)) (= |c_#memory_$Pointer$#5.offset| (store |c_old(#memory_$Pointer$#5.offset)| |c_#Ultimate.C_memset#5_#ptr.base| (store (store (store .cse3 .cse28 (select .cse4 .cse28)) .cse29 (select .cse4 .cse29)) .cse30 (select .cse4 .cse30)))) (= (store |c_old(#memory_$Pointer$#5.base)| |c_#Ultimate.C_memset#5_#ptr.base| (store (store (store .cse0 .cse28 0) .cse29 0) .cse30 0)) |c_#memory_$Pointer$#5.base|) (<= |v_#Ultimate.C_memset#5_#t~loopctr1362_30| (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_31| 1)) (<= |v_#Ultimate.C_memset#5_#t~loopctr1362_31| (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_28| 1)) (not (= |v_#Ultimate.C_memset#5_#t~loopctr1362_31| |v_#Ultimate.C_memset#5_#t~loopctr1362_28|)) (<= |v_#Ultimate.C_memset#5_#t~loopctr1362_28| 0) (not (= |v_#Ultimate.C_memset#5_#t~loopctr1362_30| |v_#Ultimate.C_memset#5_#t~loopctr1362_28|))))) (exists ((|v_#Ultimate.C_memset#5_#t~loopctr1362_31| Int) (|v_#Ultimate.C_memset#5_#t~loopctr1362_30| Int)) (let ((.cse31 (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_30| |c_#Ultimate.C_memset#5_#ptr.offset|)) (.cse32 (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_31| |c_#Ultimate.C_memset#5_#ptr.offset|))) (and (<= |v_#Ultimate.C_memset#5_#t~loopctr1362_31| (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_30| 1)) (not (= |v_#Ultimate.C_memset#5_#t~loopctr1362_31| |v_#Ultimate.C_memset#5_#t~loopctr1362_30|)) (= |c_#memory_$Pointer$#5.offset| (store |c_old(#memory_$Pointer$#5.offset)| |c_#Ultimate.C_memset#5_#ptr.base| (store (store .cse3 .cse31 (select .cse4 .cse31)) .cse32 (select .cse4 .cse32)))) (= |c_#memory_$Pointer$#5.base| (store |c_old(#memory_$Pointer$#5.base)| |c_#Ultimate.C_memset#5_#ptr.base| (store (store .cse0 .cse31 0) .cse32 0))) (<= |v_#Ultimate.C_memset#5_#t~loopctr1362_30| 0)))) (exists ((|v_#Ultimate.C_memset#5_#t~loopctr1362_31| Int) (|v_#Ultimate.C_memset#5_#t~loopctr1362_30| Int)) (let ((.cse33 (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_30| |c_#Ultimate.C_memset#5_#ptr.offset|)) (.cse34 (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_31| |c_#Ultimate.C_memset#5_#ptr.offset|))) (and (<= |v_#Ultimate.C_memset#5_#t~loopctr1362_31| (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_30| 1)) (<= |v_#Ultimate.C_memset#5_#t~loopctr1362_31| 0) (not (= |v_#Ultimate.C_memset#5_#t~loopctr1362_31| |v_#Ultimate.C_memset#5_#t~loopctr1362_30|)) (= |c_#memory_$Pointer$#5.offset| (store |c_old(#memory_$Pointer$#5.offset)| |c_#Ultimate.C_memset#5_#ptr.base| (store (store .cse3 .cse33 (select .cse4 .cse33)) .cse34 (select .cse4 .cse34)))) (= |c_#memory_$Pointer$#5.base| (store |c_old(#memory_$Pointer$#5.base)| |c_#Ultimate.C_memset#5_#ptr.base| (store (store .cse0 .cse33 0) .cse34 0))) (<= |v_#Ultimate.C_memset#5_#t~loopctr1362_30| (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_31| 1))))) (exists ((|v_#Ultimate.C_memset#5_#t~loopctr1362_29| Int) (|v_#Ultimate.C_memset#5_#t~loopctr1362_31| Int)) (let ((.cse35 (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_29| |c_#Ultimate.C_memset#5_#ptr.offset|)) (.cse36 (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_31| |c_#Ultimate.C_memset#5_#ptr.offset|))) (and (<= |v_#Ultimate.C_memset#5_#t~loopctr1362_31| 0) (<= |v_#Ultimate.C_memset#5_#t~loopctr1362_29| (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_31| 1)) (<= |v_#Ultimate.C_memset#5_#t~loopctr1362_31| (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_29| 1)) (= |c_#memory_$Pointer$#5.offset| (store |c_old(#memory_$Pointer$#5.offset)| |c_#Ultimate.C_memset#5_#ptr.base| (store (store .cse3 .cse35 (select .cse4 .cse35)) .cse36 (select .cse4 .cse36)))) (not (= |v_#Ultimate.C_memset#5_#t~loopctr1362_31| |v_#Ultimate.C_memset#5_#t~loopctr1362_29|)) (= |c_#memory_$Pointer$#5.base| (store |c_old(#memory_$Pointer$#5.base)| |c_#Ultimate.C_memset#5_#ptr.base| (store (store .cse0 .cse35 0) .cse36 0)))))) (exists ((|v_#Ultimate.C_memset#5_#t~loopctr1362_31| Int) (|v_#Ultimate.C_memset#5_#t~loopctr1362_30| Int)) (let ((.cse37 (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_30| |c_#Ultimate.C_memset#5_#ptr.offset|)) (.cse38 (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_31| |c_#Ultimate.C_memset#5_#ptr.offset|))) (and (<= |v_#Ultimate.C_memset#5_#t~loopctr1362_31| (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_30| 1)) (not (= |v_#Ultimate.C_memset#5_#t~loopctr1362_31| |v_#Ultimate.C_memset#5_#t~loopctr1362_30|)) (= |c_#memory_$Pointer$#5.offset| (store |c_old(#memory_$Pointer$#5.offset)| |c_#Ultimate.C_memset#5_#ptr.base| (store (store .cse3 .cse37 (select .cse4 .cse37)) .cse38 (select .cse4 .cse38)))) (= |c_#memory_$Pointer$#5.base| (store |c_old(#memory_$Pointer$#5.base)| |c_#Ultimate.C_memset#5_#ptr.base| (store (store .cse0 .cse37 0) .cse38 0))) (<= |v_#Ultimate.C_memset#5_#t~loopctr1362_30| (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_31| 1)) (<= |v_#Ultimate.C_memset#5_#t~loopctr1362_30| 0)))) (exists ((|v_#Ultimate.C_memset#5_#t~loopctr1362_31| Int)) (let ((.cse39 (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_31| |c_#Ultimate.C_memset#5_#ptr.offset|))) (and (= (store |c_old(#memory_$Pointer$#5.offset)| |c_#Ultimate.C_memset#5_#ptr.base| (store .cse3 .cse39 (select .cse4 .cse39))) |c_#memory_$Pointer$#5.offset|) (<= |v_#Ultimate.C_memset#5_#t~loopctr1362_31| 0) (= |c_#memory_$Pointer$#5.base| (store |c_old(#memory_$Pointer$#5.base)| |c_#Ultimate.C_memset#5_#ptr.base| (store .cse0 .cse39 0)))))) (exists ((|v_#Ultimate.C_memset#5_#t~loopctr1362_29| Int) (|v_#Ultimate.C_memset#5_#t~loopctr1362_31| Int)) (let ((.cse40 (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_29| |c_#Ultimate.C_memset#5_#ptr.offset|)) (.cse41 (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_31| |c_#Ultimate.C_memset#5_#ptr.offset|))) (and (<= |v_#Ultimate.C_memset#5_#t~loopctr1362_31| (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_29| 1)) (<= |v_#Ultimate.C_memset#5_#t~loopctr1362_29| 0) (= |c_#memory_$Pointer$#5.offset| (store |c_old(#memory_$Pointer$#5.offset)| |c_#Ultimate.C_memset#5_#ptr.base| (store (store .cse3 .cse40 (select .cse4 .cse40)) .cse41 (select .cse4 .cse41)))) (not (= |v_#Ultimate.C_memset#5_#t~loopctr1362_31| |v_#Ultimate.C_memset#5_#t~loopctr1362_29|)) (= |c_#memory_$Pointer$#5.base| (store |c_old(#memory_$Pointer$#5.base)| |c_#Ultimate.C_memset#5_#ptr.base| (store (store .cse0 .cse40 0) .cse41 0)))))))) is different from false [2023-11-23 07:45:58,329 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_old(#memory_$Pointer$#5.offset)| |c_#Ultimate.C_memset#5_#ptr.base|)) (.cse4 (select |c_#memory_$Pointer$#5.offset| |c_#Ultimate.C_memset#5_#ptr.base|)) (.cse0 (select |c_old(#memory_$Pointer$#5.base)| |c_#Ultimate.C_memset#5_#ptr.base|))) (or (exists ((|v_#Ultimate.C_memset#5_#t~loopctr1362_29| Int) (|v_#Ultimate.C_memset#5_#t~loopctr1362_30| Int)) (let ((.cse1 (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_30| |c_#Ultimate.C_memset#5_#ptr.offset|)) (.cse2 (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_29| |c_#Ultimate.C_memset#5_#ptr.offset|))) (and (= |c_#memory_$Pointer$#5.base| (store |c_old(#memory_$Pointer$#5.base)| |c_#Ultimate.C_memset#5_#ptr.base| (store (store .cse0 .cse1 0) .cse2 0))) (<= |v_#Ultimate.C_memset#5_#t~loopctr1362_29| 0) (<= |v_#Ultimate.C_memset#5_#t~loopctr1362_29| (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_30| 1)) (<= |v_#Ultimate.C_memset#5_#t~loopctr1362_30| (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_29| 1)) (not (= |v_#Ultimate.C_memset#5_#t~loopctr1362_30| |v_#Ultimate.C_memset#5_#t~loopctr1362_29|)) (= (store |c_old(#memory_$Pointer$#5.offset)| |c_#Ultimate.C_memset#5_#ptr.base| (store (store .cse3 .cse1 (select .cse4 .cse1)) .cse2 (select .cse4 .cse2))) |c_#memory_$Pointer$#5.offset|)))) (exists ((|v_#Ultimate.C_memset#5_#t~loopctr1362_28| Int) (|v_#Ultimate.C_memset#5_#t~loopctr1362_31| Int)) (let ((.cse5 (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_28| |c_#Ultimate.C_memset#5_#ptr.offset|)) (.cse6 (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_31| |c_#Ultimate.C_memset#5_#ptr.offset|))) (and (= (store |c_old(#memory_$Pointer$#5.offset)| |c_#Ultimate.C_memset#5_#ptr.base| (store (store .cse3 .cse5 (select .cse4 .cse5)) .cse6 (select .cse4 .cse6))) |c_#memory_$Pointer$#5.offset|) (<= |v_#Ultimate.C_memset#5_#t~loopctr1362_31| (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_28| 1)) (= |c_#memory_$Pointer$#5.base| (store |c_old(#memory_$Pointer$#5.base)| |c_#Ultimate.C_memset#5_#ptr.base| (store (store .cse0 .cse5 0) .cse6 0))) (not (= |v_#Ultimate.C_memset#5_#t~loopctr1362_31| |v_#Ultimate.C_memset#5_#t~loopctr1362_28|)) (<= |v_#Ultimate.C_memset#5_#t~loopctr1362_28| 0)))) (exists ((|v_#Ultimate.C_memset#5_#t~loopctr1362_28| Int) (|v_#Ultimate.C_memset#5_#t~loopctr1362_31| Int) (|v_#Ultimate.C_memset#5_#t~loopctr1362_30| Int)) (let ((.cse7 (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_28| |c_#Ultimate.C_memset#5_#ptr.offset|)) (.cse8 (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_30| |c_#Ultimate.C_memset#5_#ptr.offset|)) (.cse9 (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_31| |c_#Ultimate.C_memset#5_#ptr.offset|))) (and (<= |v_#Ultimate.C_memset#5_#t~loopctr1362_31| (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_30| 1)) (not (= |v_#Ultimate.C_memset#5_#t~loopctr1362_31| |v_#Ultimate.C_memset#5_#t~loopctr1362_30|)) (= |c_#memory_$Pointer$#5.offset| (store |c_old(#memory_$Pointer$#5.offset)| |c_#Ultimate.C_memset#5_#ptr.base| (store (store (store .cse3 .cse7 (select .cse4 .cse7)) .cse8 (select .cse4 .cse8)) .cse9 (select .cse4 .cse9)))) (= (store |c_old(#memory_$Pointer$#5.base)| |c_#Ultimate.C_memset#5_#ptr.base| (store (store (store .cse0 .cse7 0) .cse8 0) .cse9 0)) |c_#memory_$Pointer$#5.base|) (not (= |v_#Ultimate.C_memset#5_#t~loopctr1362_31| |v_#Ultimate.C_memset#5_#t~loopctr1362_28|)) (<= |v_#Ultimate.C_memset#5_#t~loopctr1362_28| 0) (<= |v_#Ultimate.C_memset#5_#t~loopctr1362_30| (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_28| 1)) (not (= |v_#Ultimate.C_memset#5_#t~loopctr1362_30| |v_#Ultimate.C_memset#5_#t~loopctr1362_28|))))) (exists ((|v_#Ultimate.C_memset#5_#t~loopctr1362_28| Int) (|v_#Ultimate.C_memset#5_#t~loopctr1362_29| Int) (|v_#Ultimate.C_memset#5_#t~loopctr1362_30| Int)) (let ((.cse10 (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_29| |c_#Ultimate.C_memset#5_#ptr.offset|)) (.cse11 (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_30| |c_#Ultimate.C_memset#5_#ptr.offset|)) (.cse12 (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_28| |c_#Ultimate.C_memset#5_#ptr.offset|))) (and (<= |v_#Ultimate.C_memset#5_#t~loopctr1362_29| (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_28| 1)) (= |c_#memory_$Pointer$#5.base| (store |c_old(#memory_$Pointer$#5.base)| |c_#Ultimate.C_memset#5_#ptr.base| (store (store (store .cse0 .cse10 0) .cse11 0) .cse12 0))) (<= |v_#Ultimate.C_memset#5_#t~loopctr1362_28| (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_30| 1)) (<= |v_#Ultimate.C_memset#5_#t~loopctr1362_30| (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_29| 1)) (not (= |v_#Ultimate.C_memset#5_#t~loopctr1362_30| |v_#Ultimate.C_memset#5_#t~loopctr1362_29|)) (not (= |v_#Ultimate.C_memset#5_#t~loopctr1362_29| |v_#Ultimate.C_memset#5_#t~loopctr1362_28|)) (<= |v_#Ultimate.C_memset#5_#t~loopctr1362_28| 0) (= (store |c_old(#memory_$Pointer$#5.offset)| |c_#Ultimate.C_memset#5_#ptr.base| (store (store (store .cse3 .cse10 (select .cse4 .cse10)) .cse11 (select .cse4 .cse11)) .cse12 (select .cse4 .cse12))) |c_#memory_$Pointer$#5.offset|) (not (= |v_#Ultimate.C_memset#5_#t~loopctr1362_30| |v_#Ultimate.C_memset#5_#t~loopctr1362_28|))))) (exists ((|v_#Ultimate.C_memset#5_#t~loopctr1362_28| Int) (|v_#Ultimate.C_memset#5_#t~loopctr1362_29| Int) (|v_#Ultimate.C_memset#5_#t~loopctr1362_31| Int) (|v_#Ultimate.C_memset#5_#t~loopctr1362_30| Int)) (let ((.cse13 (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_28| |c_#Ultimate.C_memset#5_#ptr.offset|)) (.cse14 (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_29| |c_#Ultimate.C_memset#5_#ptr.offset|)) (.cse15 (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_30| |c_#Ultimate.C_memset#5_#ptr.offset|)) (.cse16 (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_31| |c_#Ultimate.C_memset#5_#ptr.offset|))) (and (<= |v_#Ultimate.C_memset#5_#t~loopctr1362_31| (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_30| 1)) (not (= |v_#Ultimate.C_memset#5_#t~loopctr1362_31| |v_#Ultimate.C_memset#5_#t~loopctr1362_30|)) (<= |v_#Ultimate.C_memset#5_#t~loopctr1362_29| (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_28| 1)) (not (= |v_#Ultimate.C_memset#5_#t~loopctr1362_31| |v_#Ultimate.C_memset#5_#t~loopctr1362_29|)) (<= |v_#Ultimate.C_memset#5_#t~loopctr1362_30| (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_29| 1)) (not (= |v_#Ultimate.C_memset#5_#t~loopctr1362_30| |v_#Ultimate.C_memset#5_#t~loopctr1362_29|)) (= |c_#memory_$Pointer$#5.base| (store |c_old(#memory_$Pointer$#5.base)| |c_#Ultimate.C_memset#5_#ptr.base| (store (store (store (store .cse0 .cse13 0) .cse14 0) .cse15 0) .cse16 0))) (not (= |v_#Ultimate.C_memset#5_#t~loopctr1362_29| |v_#Ultimate.C_memset#5_#t~loopctr1362_28|)) (not (= |v_#Ultimate.C_memset#5_#t~loopctr1362_31| |v_#Ultimate.C_memset#5_#t~loopctr1362_28|)) (<= |v_#Ultimate.C_memset#5_#t~loopctr1362_28| 0) (= (store |c_old(#memory_$Pointer$#5.offset)| |c_#Ultimate.C_memset#5_#ptr.base| (store (store (store (store .cse3 .cse13 (select .cse4 .cse13)) .cse14 (select .cse4 .cse14)) .cse15 (select .cse4 .cse15)) .cse16 (select .cse4 .cse16))) |c_#memory_$Pointer$#5.offset|) (not (= |v_#Ultimate.C_memset#5_#t~loopctr1362_30| |v_#Ultimate.C_memset#5_#t~loopctr1362_28|))))) (exists ((|v_#Ultimate.C_memset#5_#t~loopctr1362_30| Int)) (let ((.cse17 (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_30| |c_#Ultimate.C_memset#5_#ptr.offset|))) (and (= |c_#memory_$Pointer$#5.base| (store |c_old(#memory_$Pointer$#5.base)| |c_#Ultimate.C_memset#5_#ptr.base| (store .cse0 .cse17 0))) (= (store |c_old(#memory_$Pointer$#5.offset)| |c_#Ultimate.C_memset#5_#ptr.base| (store .cse3 .cse17 (select .cse4 .cse17))) |c_#memory_$Pointer$#5.offset|) (<= |v_#Ultimate.C_memset#5_#t~loopctr1362_30| 0)))) (exists ((|v_#Ultimate.C_memset#5_#t~loopctr1362_29| Int) (|v_#Ultimate.C_memset#5_#t~loopctr1362_31| Int) (|v_#Ultimate.C_memset#5_#t~loopctr1362_30| Int)) (let ((.cse18 (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_30| 1)) (.cse19 (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_29| |c_#Ultimate.C_memset#5_#ptr.offset|)) (.cse20 (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_30| |c_#Ultimate.C_memset#5_#ptr.offset|)) (.cse21 (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_31| |c_#Ultimate.C_memset#5_#ptr.offset|))) (and (<= |v_#Ultimate.C_memset#5_#t~loopctr1362_31| .cse18) (not (= |v_#Ultimate.C_memset#5_#t~loopctr1362_31| |v_#Ultimate.C_memset#5_#t~loopctr1362_30|)) (<= |v_#Ultimate.C_memset#5_#t~loopctr1362_29| .cse18) (not (= |v_#Ultimate.C_memset#5_#t~loopctr1362_31| |v_#Ultimate.C_memset#5_#t~loopctr1362_29|)) (<= |v_#Ultimate.C_memset#5_#t~loopctr1362_30| (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_29| 1)) (= (store |c_old(#memory_$Pointer$#5.offset)| |c_#Ultimate.C_memset#5_#ptr.base| (store (store (store .cse3 .cse19 (select .cse4 .cse19)) .cse20 (select .cse4 .cse20)) .cse21 (select .cse4 .cse21))) |c_#memory_$Pointer$#5.offset|) (not (= |v_#Ultimate.C_memset#5_#t~loopctr1362_30| |v_#Ultimate.C_memset#5_#t~loopctr1362_29|)) (= |c_#memory_$Pointer$#5.base| (store |c_old(#memory_$Pointer$#5.base)| |c_#Ultimate.C_memset#5_#ptr.base| (store (store (store .cse0 .cse19 0) .cse20 0) .cse21 0))) (<= |v_#Ultimate.C_memset#5_#t~loopctr1362_30| 0)))) (exists ((|v_#Ultimate.C_memset#5_#t~loopctr1362_28| Int) (|v_#Ultimate.C_memset#5_#t~loopctr1362_29| Int) (|v_#Ultimate.C_memset#5_#t~loopctr1362_31| Int)) (let ((.cse22 (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_28| |c_#Ultimate.C_memset#5_#ptr.offset|)) (.cse23 (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_29| |c_#Ultimate.C_memset#5_#ptr.offset|)) (.cse24 (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_31| |c_#Ultimate.C_memset#5_#ptr.offset|))) (and (= (store |c_old(#memory_$Pointer$#5.offset)| |c_#Ultimate.C_memset#5_#ptr.base| (store (store (store .cse3 .cse22 (select .cse4 .cse22)) .cse23 (select .cse4 .cse23)) .cse24 (select .cse4 .cse24))) |c_#memory_$Pointer$#5.offset|) (<= |v_#Ultimate.C_memset#5_#t~loopctr1362_31| (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_29| 1)) (<= |v_#Ultimate.C_memset#5_#t~loopctr1362_29| (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_28| 1)) (not (= |v_#Ultimate.C_memset#5_#t~loopctr1362_31| |v_#Ultimate.C_memset#5_#t~loopctr1362_29|)) (not (= |v_#Ultimate.C_memset#5_#t~loopctr1362_29| |v_#Ultimate.C_memset#5_#t~loopctr1362_28|)) (not (= |v_#Ultimate.C_memset#5_#t~loopctr1362_31| |v_#Ultimate.C_memset#5_#t~loopctr1362_28|)) (<= |v_#Ultimate.C_memset#5_#t~loopctr1362_28| 0) (= (store |c_old(#memory_$Pointer$#5.base)| |c_#Ultimate.C_memset#5_#ptr.base| (store (store (store .cse0 .cse22 0) .cse23 0) .cse24 0)) |c_#memory_$Pointer$#5.base|)))) (exists ((|v_#Ultimate.C_memset#5_#t~loopctr1362_29| Int) (|v_#Ultimate.C_memset#5_#t~loopctr1362_31| Int) (|v_#Ultimate.C_memset#5_#t~loopctr1362_30| Int)) (let ((.cse25 (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_29| |c_#Ultimate.C_memset#5_#ptr.offset|)) (.cse26 (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_30| |c_#Ultimate.C_memset#5_#ptr.offset|)) (.cse27 (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_31| |c_#Ultimate.C_memset#5_#ptr.offset|))) (and (<= |v_#Ultimate.C_memset#5_#t~loopctr1362_31| (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_30| 1)) (not (= |v_#Ultimate.C_memset#5_#t~loopctr1362_31| |v_#Ultimate.C_memset#5_#t~loopctr1362_30|)) (<= |v_#Ultimate.C_memset#5_#t~loopctr1362_29| 0) (not (= |v_#Ultimate.C_memset#5_#t~loopctr1362_31| |v_#Ultimate.C_memset#5_#t~loopctr1362_29|)) (<= |v_#Ultimate.C_memset#5_#t~loopctr1362_30| (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_29| 1)) (= (store |c_old(#memory_$Pointer$#5.offset)| |c_#Ultimate.C_memset#5_#ptr.base| (store (store (store .cse3 .cse25 (select .cse4 .cse25)) .cse26 (select .cse4 .cse26)) .cse27 (select .cse4 .cse27))) |c_#memory_$Pointer$#5.offset|) (not (= |v_#Ultimate.C_memset#5_#t~loopctr1362_30| |v_#Ultimate.C_memset#5_#t~loopctr1362_29|)) (= |c_#memory_$Pointer$#5.base| (store |c_old(#memory_$Pointer$#5.base)| |c_#Ultimate.C_memset#5_#ptr.base| (store (store (store .cse0 .cse25 0) .cse26 0) .cse27 0)))))) (exists ((|v_#Ultimate.C_memset#5_#t~loopctr1362_28| Int) (|v_#Ultimate.C_memset#5_#t~loopctr1362_31| Int) (|v_#Ultimate.C_memset#5_#t~loopctr1362_30| Int)) (let ((.cse28 (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_28| |c_#Ultimate.C_memset#5_#ptr.offset|)) (.cse29 (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_30| |c_#Ultimate.C_memset#5_#ptr.offset|)) (.cse30 (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_31| |c_#Ultimate.C_memset#5_#ptr.offset|))) (and (<= |v_#Ultimate.C_memset#5_#t~loopctr1362_31| (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_30| 1)) (not (= |v_#Ultimate.C_memset#5_#t~loopctr1362_31| |v_#Ultimate.C_memset#5_#t~loopctr1362_30|)) (= |c_#memory_$Pointer$#5.offset| (store |c_old(#memory_$Pointer$#5.offset)| |c_#Ultimate.C_memset#5_#ptr.base| (store (store (store .cse3 .cse28 (select .cse4 .cse28)) .cse29 (select .cse4 .cse29)) .cse30 (select .cse4 .cse30)))) (= (store |c_old(#memory_$Pointer$#5.base)| |c_#Ultimate.C_memset#5_#ptr.base| (store (store (store .cse0 .cse28 0) .cse29 0) .cse30 0)) |c_#memory_$Pointer$#5.base|) (<= |v_#Ultimate.C_memset#5_#t~loopctr1362_30| (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_31| 1)) (<= |v_#Ultimate.C_memset#5_#t~loopctr1362_31| (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_28| 1)) (not (= |v_#Ultimate.C_memset#5_#t~loopctr1362_31| |v_#Ultimate.C_memset#5_#t~loopctr1362_28|)) (<= |v_#Ultimate.C_memset#5_#t~loopctr1362_28| 0) (not (= |v_#Ultimate.C_memset#5_#t~loopctr1362_30| |v_#Ultimate.C_memset#5_#t~loopctr1362_28|))))) (exists ((|v_#Ultimate.C_memset#5_#t~loopctr1362_31| Int) (|v_#Ultimate.C_memset#5_#t~loopctr1362_30| Int)) (let ((.cse31 (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_30| |c_#Ultimate.C_memset#5_#ptr.offset|)) (.cse32 (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_31| |c_#Ultimate.C_memset#5_#ptr.offset|))) (and (<= |v_#Ultimate.C_memset#5_#t~loopctr1362_31| (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_30| 1)) (not (= |v_#Ultimate.C_memset#5_#t~loopctr1362_31| |v_#Ultimate.C_memset#5_#t~loopctr1362_30|)) (= |c_#memory_$Pointer$#5.offset| (store |c_old(#memory_$Pointer$#5.offset)| |c_#Ultimate.C_memset#5_#ptr.base| (store (store .cse3 .cse31 (select .cse4 .cse31)) .cse32 (select .cse4 .cse32)))) (= |c_#memory_$Pointer$#5.base| (store |c_old(#memory_$Pointer$#5.base)| |c_#Ultimate.C_memset#5_#ptr.base| (store (store .cse0 .cse31 0) .cse32 0))) (<= |v_#Ultimate.C_memset#5_#t~loopctr1362_30| 0)))) (exists ((|v_#Ultimate.C_memset#5_#t~loopctr1362_31| Int) (|v_#Ultimate.C_memset#5_#t~loopctr1362_30| Int)) (let ((.cse33 (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_30| |c_#Ultimate.C_memset#5_#ptr.offset|)) (.cse34 (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_31| |c_#Ultimate.C_memset#5_#ptr.offset|))) (and (<= |v_#Ultimate.C_memset#5_#t~loopctr1362_31| (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_30| 1)) (<= |v_#Ultimate.C_memset#5_#t~loopctr1362_31| 0) (not (= |v_#Ultimate.C_memset#5_#t~loopctr1362_31| |v_#Ultimate.C_memset#5_#t~loopctr1362_30|)) (= |c_#memory_$Pointer$#5.offset| (store |c_old(#memory_$Pointer$#5.offset)| |c_#Ultimate.C_memset#5_#ptr.base| (store (store .cse3 .cse33 (select .cse4 .cse33)) .cse34 (select .cse4 .cse34)))) (= |c_#memory_$Pointer$#5.base| (store |c_old(#memory_$Pointer$#5.base)| |c_#Ultimate.C_memset#5_#ptr.base| (store (store .cse0 .cse33 0) .cse34 0))) (<= |v_#Ultimate.C_memset#5_#t~loopctr1362_30| (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_31| 1))))) (exists ((|v_#Ultimate.C_memset#5_#t~loopctr1362_29| Int) (|v_#Ultimate.C_memset#5_#t~loopctr1362_31| Int)) (let ((.cse35 (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_29| |c_#Ultimate.C_memset#5_#ptr.offset|)) (.cse36 (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_31| |c_#Ultimate.C_memset#5_#ptr.offset|))) (and (<= |v_#Ultimate.C_memset#5_#t~loopctr1362_31| 0) (<= |v_#Ultimate.C_memset#5_#t~loopctr1362_29| (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_31| 1)) (<= |v_#Ultimate.C_memset#5_#t~loopctr1362_31| (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_29| 1)) (= |c_#memory_$Pointer$#5.offset| (store |c_old(#memory_$Pointer$#5.offset)| |c_#Ultimate.C_memset#5_#ptr.base| (store (store .cse3 .cse35 (select .cse4 .cse35)) .cse36 (select .cse4 .cse36)))) (not (= |v_#Ultimate.C_memset#5_#t~loopctr1362_31| |v_#Ultimate.C_memset#5_#t~loopctr1362_29|)) (= |c_#memory_$Pointer$#5.base| (store |c_old(#memory_$Pointer$#5.base)| |c_#Ultimate.C_memset#5_#ptr.base| (store (store .cse0 .cse35 0) .cse36 0)))))) (exists ((|v_#Ultimate.C_memset#5_#t~loopctr1362_31| Int) (|v_#Ultimate.C_memset#5_#t~loopctr1362_30| Int)) (let ((.cse37 (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_30| |c_#Ultimate.C_memset#5_#ptr.offset|)) (.cse38 (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_31| |c_#Ultimate.C_memset#5_#ptr.offset|))) (and (<= |v_#Ultimate.C_memset#5_#t~loopctr1362_31| (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_30| 1)) (not (= |v_#Ultimate.C_memset#5_#t~loopctr1362_31| |v_#Ultimate.C_memset#5_#t~loopctr1362_30|)) (= |c_#memory_$Pointer$#5.offset| (store |c_old(#memory_$Pointer$#5.offset)| |c_#Ultimate.C_memset#5_#ptr.base| (store (store .cse3 .cse37 (select .cse4 .cse37)) .cse38 (select .cse4 .cse38)))) (= |c_#memory_$Pointer$#5.base| (store |c_old(#memory_$Pointer$#5.base)| |c_#Ultimate.C_memset#5_#ptr.base| (store (store .cse0 .cse37 0) .cse38 0))) (<= |v_#Ultimate.C_memset#5_#t~loopctr1362_30| (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_31| 1)) (<= |v_#Ultimate.C_memset#5_#t~loopctr1362_30| 0)))) (exists ((|v_#Ultimate.C_memset#5_#t~loopctr1362_31| Int)) (let ((.cse39 (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_31| |c_#Ultimate.C_memset#5_#ptr.offset|))) (and (= (store |c_old(#memory_$Pointer$#5.offset)| |c_#Ultimate.C_memset#5_#ptr.base| (store .cse3 .cse39 (select .cse4 .cse39))) |c_#memory_$Pointer$#5.offset|) (<= |v_#Ultimate.C_memset#5_#t~loopctr1362_31| 0) (= |c_#memory_$Pointer$#5.base| (store |c_old(#memory_$Pointer$#5.base)| |c_#Ultimate.C_memset#5_#ptr.base| (store .cse0 .cse39 0)))))) (exists ((|v_#Ultimate.C_memset#5_#t~loopctr1362_29| Int) (|v_#Ultimate.C_memset#5_#t~loopctr1362_31| Int)) (let ((.cse40 (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_29| |c_#Ultimate.C_memset#5_#ptr.offset|)) (.cse41 (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_31| |c_#Ultimate.C_memset#5_#ptr.offset|))) (and (<= |v_#Ultimate.C_memset#5_#t~loopctr1362_31| (+ |v_#Ultimate.C_memset#5_#t~loopctr1362_29| 1)) (<= |v_#Ultimate.C_memset#5_#t~loopctr1362_29| 0) (= |c_#memory_$Pointer$#5.offset| (store |c_old(#memory_$Pointer$#5.offset)| |c_#Ultimate.C_memset#5_#ptr.base| (store (store .cse3 .cse40 (select .cse4 .cse40)) .cse41 (select .cse4 .cse41)))) (not (= |v_#Ultimate.C_memset#5_#t~loopctr1362_31| |v_#Ultimate.C_memset#5_#t~loopctr1362_29|)) (= |c_#memory_$Pointer$#5.base| (store |c_old(#memory_$Pointer$#5.base)| |c_#Ultimate.C_memset#5_#ptr.base| (store (store .cse0 .cse40 0) .cse41 0)))))))) is different from true Killed by 15