./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-pthread/cs_queue-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4fc63b2a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ff3f7eb-a2fe-40ad-a289-c8cbd6a83faf/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ff3f7eb-a2fe-40ad-a289-c8cbd6a83faf/bin/uautomizer-verify-4GaUIPS5ZU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ff3f7eb-a2fe-40ad-a289-c8cbd6a83faf/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ff3f7eb-a2fe-40ad-a289-c8cbd6a83faf/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/seq-pthread/cs_queue-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ff3f7eb-a2fe-40ad-a289-c8cbd6a83faf/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ff3f7eb-a2fe-40ad-a289-c8cbd6a83faf/bin/uautomizer-verify-4GaUIPS5ZU --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 32bit --witnessprinter.graph.data.programhash 8159433f4ea1208e9ded3d30d98c55f64500f74c12655a237b65d69e94898ea5 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 21:57:28,242 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 21:57:28,333 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ff3f7eb-a2fe-40ad-a289-c8cbd6a83faf/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-31 21:57:28,342 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 21:57:28,342 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 21:57:28,376 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 21:57:28,377 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 21:57:28,377 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 21:57:28,378 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 21:57:28,380 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 21:57:28,381 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 21:57:28,381 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 21:57:28,382 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 21:57:28,386 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 21:57:28,387 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 21:57:28,387 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 21:57:28,387 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 21:57:28,388 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 21:57:28,388 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 21:57:28,388 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 21:57:28,388 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 21:57:28,389 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 21:57:28,390 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 21:57:28,390 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 21:57:28,391 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 21:57:28,391 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 21:57:28,392 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 21:57:28,392 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 21:57:28,392 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 21:57:28,393 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 21:57:28,393 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 21:57:28,394 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 21:57:28,395 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 21:57:28,395 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 21:57:28,395 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 21:57:28,396 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 21:57:28,396 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-31 21:57:28,396 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-31 21:57:28,397 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 21:57:28,397 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 21:57:28,397 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 21:57:28,398 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 21:57:28,398 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ff3f7eb-a2fe-40ad-a289-c8cbd6a83faf/bin/uautomizer-verify-4GaUIPS5ZU/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ff3f7eb-a2fe-40ad-a289-c8cbd6a83faf/bin/uautomizer-verify-4GaUIPS5ZU 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8159433f4ea1208e9ded3d30d98c55f64500f74c12655a237b65d69e94898ea5 [2024-10-31 21:57:28,694 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 21:57:28,736 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 21:57:28,740 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 21:57:28,741 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 21:57:28,742 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 21:57:28,743 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ff3f7eb-a2fe-40ad-a289-c8cbd6a83faf/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/seq-pthread/cs_queue-2.i Unable to find full path for "g++" [2024-10-31 21:57:30,916 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 21:57:31,347 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 21:57:31,349 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ff3f7eb-a2fe-40ad-a289-c8cbd6a83faf/sv-benchmarks/c/seq-pthread/cs_queue-2.i [2024-10-31 21:57:31,376 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ff3f7eb-a2fe-40ad-a289-c8cbd6a83faf/bin/uautomizer-verify-4GaUIPS5ZU/data/52b8cc3c8/126fa0bc438b46168884e995be0e16a2/FLAG0b97e6df2 [2024-10-31 21:57:31,396 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ff3f7eb-a2fe-40ad-a289-c8cbd6a83faf/bin/uautomizer-verify-4GaUIPS5ZU/data/52b8cc3c8/126fa0bc438b46168884e995be0e16a2 [2024-10-31 21:57:31,399 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 21:57:31,401 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 21:57:31,402 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 21:57:31,402 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 21:57:31,412 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 21:57:31,414 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 09:57:31" (1/1) ... [2024-10-31 21:57:31,416 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@700159ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:31, skipping insertion in model container [2024-10-31 21:57:31,417 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 09:57:31" (1/1) ... [2024-10-31 21:57:31,485 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 21:57:32,113 WARN L251 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ff3f7eb-a2fe-40ad-a289-c8cbd6a83faf/sv-benchmarks/c/seq-pthread/cs_queue-2.i[34556,34569] [2024-10-31 21:57:32,297 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 21:57:32,324 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 21:57:32,381 WARN L251 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ff3f7eb-a2fe-40ad-a289-c8cbd6a83faf/sv-benchmarks/c/seq-pthread/cs_queue-2.i[34556,34569] [2024-10-31 21:57:32,524 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 21:57:32,609 INFO L204 MainTranslator]: Completed translation [2024-10-31 21:57:32,610 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:32 WrapperNode [2024-10-31 21:57:32,610 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 21:57:32,611 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 21:57:32,611 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 21:57:32,612 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 21:57:32,619 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:32" (1/1) ... [2024-10-31 21:57:32,674 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:32" (1/1) ... [2024-10-31 21:57:32,755 INFO L138 Inliner]: procedures = 249, calls = 626, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 1337 [2024-10-31 21:57:32,758 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 21:57:32,762 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 21:57:32,762 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 21:57:32,762 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 21:57:32,787 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:32" (1/1) ... [2024-10-31 21:57:32,787 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:32" (1/1) ... [2024-10-31 21:57:32,806 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:32" (1/1) ... [2024-10-31 21:57:32,884 INFO L175 MemorySlicer]: Split 386 memory accesses to 20 slices as follows [8, 113, 2, 8, 8, 8, 20, 12, 83, 8, 8, 0, 2, 6, 4, 46, 2, 6, 2, 40]. 29 percent of accesses are in the largest equivalence class. The 115 initializations are split as follows [2, 46, 2, 3, 3, 3, 6, 6, 40, 2, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0]. The 85 writes are split as follows [3, 33, 0, 2, 2, 2, 8, 3, 22, 4, 4, 0, 0, 0, 2, 0, 0, 0, 0, 0]. [2024-10-31 21:57:32,884 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:32" (1/1) ... [2024-10-31 21:57:32,885 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:32" (1/1) ... [2024-10-31 21:57:32,941 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:32" (1/1) ... [2024-10-31 21:57:32,959 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:32" (1/1) ... [2024-10-31 21:57:32,979 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:32" (1/1) ... [2024-10-31 21:57:32,989 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:32" (1/1) ... [2024-10-31 21:57:33,015 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 21:57:33,017 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 21:57:33,019 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 21:57:33,019 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 21:57:33,020 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:32" (1/1) ... [2024-10-31 21:57:33,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 21:57:33,040 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ff3f7eb-a2fe-40ad-a289-c8cbd6a83faf/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 21:57:33,064 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ff3f7eb-a2fe-40ad-a289-c8cbd6a83faf/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 21:57:33,068 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ff3f7eb-a2fe-40ad-a289-c8cbd6a83faf/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 21:57:33,101 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-31 21:57:33,101 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-31 21:57:33,101 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-31 21:57:33,101 INFO L130 BoogieDeclarations]: Found specification of procedure empty [2024-10-31 21:57:33,102 INFO L138 BoogieDeclarations]: Found implementation of procedure empty [2024-10-31 21:57:33,102 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_lock [2024-10-31 21:57:33,102 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_lock [2024-10-31 21:57:33,103 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-31 21:57:33,104 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-31 21:57:33,104 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-31 21:57:33,104 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-10-31 21:57:33,104 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-10-31 21:57:33,105 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-10-31 21:57:33,105 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2024-10-31 21:57:33,105 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2024-10-31 21:57:33,105 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2024-10-31 21:57:33,105 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2024-10-31 21:57:33,105 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2024-10-31 21:57:33,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2024-10-31 21:57:33,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2024-10-31 21:57:33,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2024-10-31 21:57:33,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2024-10-31 21:57:33,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2024-10-31 21:57:33,107 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2024-10-31 21:57:33,107 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2024-10-31 21:57:33,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2024-10-31 21:57:33,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#19 [2024-10-31 21:57:33,109 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-31 21:57:33,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-31 21:57:33,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-31 21:57:33,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-31 21:57:33,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-10-31 21:57:33,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-10-31 21:57:33,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2024-10-31 21:57:33,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2024-10-31 21:57:33,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2024-10-31 21:57:33,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2024-10-31 21:57:33,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2024-10-31 21:57:33,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2024-10-31 21:57:33,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2024-10-31 21:57:33,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2024-10-31 21:57:33,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2024-10-31 21:57:33,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2024-10-31 21:57:33,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2024-10-31 21:57:33,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2024-10-31 21:57:33,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2024-10-31 21:57:33,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#18 [2024-10-31 21:57:33,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#19 [2024-10-31 21:57:33,113 INFO L130 BoogieDeclarations]: Found specification of procedure enqueue [2024-10-31 21:57:33,113 INFO L138 BoogieDeclarations]: Found implementation of procedure enqueue [2024-10-31 21:57:33,114 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_unlock [2024-10-31 21:57:33,114 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_unlock [2024-10-31 21:57:33,114 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-31 21:57:33,114 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-31 21:57:33,114 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-31 21:57:33,114 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-31 21:57:33,115 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-31 21:57:33,115 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-31 21:57:33,115 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-10-31 21:57:33,115 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-10-31 21:57:33,115 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-10-31 21:57:33,115 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-10-31 21:57:33,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-10-31 21:57:33,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2024-10-31 21:57:33,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2024-10-31 21:57:33,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2024-10-31 21:57:33,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2024-10-31 21:57:33,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2024-10-31 21:57:33,118 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2024-10-31 21:57:33,118 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2024-10-31 21:57:33,118 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2024-10-31 21:57:33,118 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#19 [2024-10-31 21:57:33,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-31 21:57:33,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-31 21:57:33,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-31 21:57:33,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-31 21:57:33,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-31 21:57:33,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-31 21:57:33,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-10-31 21:57:33,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-10-31 21:57:33,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-10-31 21:57:33,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-10-31 21:57:33,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-10-31 21:57:33,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2024-10-31 21:57:33,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2024-10-31 21:57:33,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2024-10-31 21:57:33,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2024-10-31 21:57:33,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2024-10-31 21:57:33,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2024-10-31 21:57:33,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2024-10-31 21:57:33,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2024-10-31 21:57:33,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#19 [2024-10-31 21:57:33,123 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 21:57:33,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-31 21:57:33,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-31 21:57:33,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-31 21:57:33,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-10-31 21:57:33,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-10-31 21:57:33,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-10-31 21:57:33,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2024-10-31 21:57:33,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2024-10-31 21:57:33,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2024-10-31 21:57:33,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2024-10-31 21:57:33,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2024-10-31 21:57:33,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2024-10-31 21:57:33,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2024-10-31 21:57:33,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2024-10-31 21:57:33,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2024-10-31 21:57:33,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2024-10-31 21:57:33,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2024-10-31 21:57:33,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2024-10-31 21:57:33,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2024-10-31 21:57:33,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#19 [2024-10-31 21:57:33,129 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2024-10-31 21:57:33,130 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2024-10-31 21:57:33,130 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2024-10-31 21:57:33,130 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2024-10-31 21:57:33,130 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2024-10-31 21:57:33,130 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2024-10-31 21:57:33,130 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2024-10-31 21:57:33,130 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2024-10-31 21:57:33,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-31 21:57:33,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-31 21:57:33,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-31 21:57:33,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-31 21:57:33,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-31 21:57:33,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-31 21:57:33,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-31 21:57:33,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-31 21:57:33,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-31 21:57:33,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-10-31 21:57:33,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-10-31 21:57:33,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-10-31 21:57:33,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-10-31 21:57:33,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-10-31 21:57:33,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-10-31 21:57:33,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2024-10-31 21:57:33,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2024-10-31 21:57:33,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2024-10-31 21:57:33,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2024-10-31 21:57:33,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2024-10-31 21:57:33,135 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 21:57:33,135 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 21:57:33,598 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 21:57:33,601 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 21:57:33,703 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2024-10-31 21:57:33,703 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2024-10-31 21:57:33,703 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);#res := 0; [2024-10-31 21:57:33,703 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);#res := 0; [2024-10-31 21:57:34,405 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint L1097: SUMMARY for call __CS_cs(); srcloc: null [2024-10-31 21:57:34,406 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint L1097-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);t2_#res#1.base, t2_#res#1.offset := 0, 0; [2024-10-31 21:57:34,406 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint L1097-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2024-10-31 21:57:34,406 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint L1132: SUMMARY for call __CS_cs(); srcloc: null [2024-10-31 21:57:34,406 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint L1132-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset);havoc main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset);havoc main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset; [2024-10-31 21:57:34,406 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint L1132-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2024-10-31 21:57:34,406 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint L1075: SUMMARY for call __CS_cs(); srcloc: null [2024-10-31 21:57:34,407 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint L1075-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);t1_#res#1.base, t1_#res#1.offset := 0, 0; [2024-10-31 21:57:34,407 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint L1075-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2024-10-31 21:57:34,407 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2024-10-31 21:57:34,407 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##86: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);t2_#res#1.base, t2_#res#1.offset := 0, 0; [2024-10-31 21:57:34,407 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2024-10-31 21:57:34,407 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);t2_#res#1.base, t2_#res#1.offset := 0, 0; [2024-10-31 21:57:34,407 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##79: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2024-10-31 21:57:34,407 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##78: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);dequeue_#res#1 := 0; [2024-10-31 21:57:34,408 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##129: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2024-10-31 21:57:34,408 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##128: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);t1_#res#1.base, t1_#res#1.offset := 0, 0; [2024-10-31 21:57:34,408 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##26: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2024-10-31 21:57:34,408 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##25: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset);havoc main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset);havoc main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset; [2024-10-31 21:57:34,408 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##24: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2024-10-31 21:57:34,408 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##23: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset);havoc main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset);havoc main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset; [2024-10-31 21:57:34,408 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##166: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);t1_#res#1.base, t1_#res#1.offset := 0, 0; [2024-10-31 21:57:34,408 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##169: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2024-10-31 21:57:34,413 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##168: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);t1_#res#1.base, t1_#res#1.offset := 0, 0; [2024-10-31 21:57:34,413 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##167: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2024-10-31 21:57:34,413 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##104: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);t2_#res#1.base, t2_#res#1.offset := 0, 0; [2024-10-31 21:57:34,413 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##105: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2024-10-31 21:57:34,413 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##118: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2024-10-31 21:57:34,413 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##117: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);t1_#res#1.base, t1_#res#1.offset := 0, 0; [2024-10-31 21:57:34,469 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2024-10-31 21:57:34,469 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);#res := 0; [2024-10-31 21:57:39,490 INFO L? ?]: Removed 102 outVars from TransFormulas that were not future-live. [2024-10-31 21:57:39,490 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 21:57:39,518 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 21:57:39,518 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-31 21:57:39,519 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 09:57:39 BoogieIcfgContainer [2024-10-31 21:57:39,519 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 21:57:39,522 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 21:57:39,522 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 21:57:39,527 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 21:57:39,528 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 09:57:31" (1/3) ... [2024-10-31 21:57:39,529 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7651fbfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 09:57:39, skipping insertion in model container [2024-10-31 21:57:39,529 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:57:32" (2/3) ... [2024-10-31 21:57:39,530 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7651fbfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 09:57:39, skipping insertion in model container [2024-10-31 21:57:39,530 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 09:57:39" (3/3) ... [2024-10-31 21:57:39,532 INFO L112 eAbstractionObserver]: Analyzing ICFG cs_queue-2.i [2024-10-31 21:57:39,557 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 21:57:39,558 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-31 21:57:39,670 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 21:57:39,679 INFO L333 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, 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;@52b0f7aa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 21:57:39,680 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-31 21:57:39,688 INFO L276 IsEmpty]: Start isEmpty. Operand has 351 states, 204 states have (on average 1.4705882352941178) internal successors, (300), 206 states have internal predecessors, (300), 136 states have call successors, (136), 9 states have call predecessors, (136), 9 states have return successors, (136), 136 states have call predecessors, (136), 136 states have call successors, (136) [2024-10-31 21:57:39,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2024-10-31 21:57:39,755 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:57:39,756 INFO L215 NwaCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:57:39,757 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:57:39,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:57:39,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1377607217, now seen corresponding path program 1 times [2024-10-31 21:57:39,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:57:39,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958715242] [2024-10-31 21:57:39,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:57:39,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:57:41,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:41,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-31 21:57:41,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:41,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-31 21:57:41,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:41,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-31 21:57:41,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:41,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-31 21:57:41,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:41,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 21:57:41,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:41,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 21:57:41,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:41,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-31 21:57:41,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:41,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 21:57:41,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:41,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-31 21:57:41,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:41,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-31 21:57:41,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:41,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-31 21:57:41,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:41,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-31 21:57:41,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:41,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-31 21:57:41,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:41,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-31 21:57:41,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:41,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-31 21:57:41,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:41,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-31 21:57:41,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:41,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-31 21:57:41,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:41,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-31 21:57:41,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:41,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-31 21:57:41,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:41,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-31 21:57:41,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:41,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-31 21:57:41,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:41,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-31 21:57:41,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:41,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-31 21:57:41,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:41,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-31 21:57:41,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:41,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-31 21:57:41,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:41,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-31 21:57:41,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:41,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-31 21:57:41,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:41,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-31 21:57:41,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:41,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-10-31 21:57:41,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:42,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-10-31 21:57:42,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:42,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-10-31 21:57:42,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:42,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-10-31 21:57:42,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:42,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-10-31 21:57:42,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:42,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2024-10-31 21:57:42,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:42,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-10-31 21:57:42,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:42,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2024-10-31 21:57:42,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:42,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2024-10-31 21:57:42,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:42,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2024-10-31 21:57:42,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:42,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2024-10-31 21:57:42,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:42,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2024-10-31 21:57:42,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:42,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2024-10-31 21:57:42,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:42,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-10-31 21:57:42,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:42,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2024-10-31 21:57:42,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:42,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2024-10-31 21:57:42,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:42,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2024-10-31 21:57:42,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:42,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 278 [2024-10-31 21:57:42,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:42,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 284 [2024-10-31 21:57:42,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:42,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 290 [2024-10-31 21:57:42,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:42,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 296 [2024-10-31 21:57:42,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:42,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 302 [2024-10-31 21:57:42,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:42,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 308 [2024-10-31 21:57:42,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:42,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 314 [2024-10-31 21:57:42,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:42,184 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5304 trivial. 0 not checked. [2024-10-31 21:57:42,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:57:42,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958715242] [2024-10-31 21:57:42,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958715242] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:57:42,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:57:42,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 21:57:42,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850323037] [2024-10-31 21:57:42,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:57:42,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-31 21:57:42,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:57:42,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-31 21:57:42,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-31 21:57:42,235 INFO L87 Difference]: Start difference. First operand has 351 states, 204 states have (on average 1.4705882352941178) internal successors, (300), 206 states have internal predecessors, (300), 136 states have call successors, (136), 9 states have call predecessors, (136), 9 states have return successors, (136), 136 states have call predecessors, (136), 136 states have call successors, (136) Second operand has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 2 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 2 states have call successors, (52) [2024-10-31 21:57:42,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:57:42,330 INFO L93 Difference]: Finished difference Result 695 states and 1260 transitions. [2024-10-31 21:57:42,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-31 21:57:42,335 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 2 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 2 states have call successors, (52) Word has length 322 [2024-10-31 21:57:42,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:57:42,350 INFO L225 Difference]: With dead ends: 695 [2024-10-31 21:57:42,350 INFO L226 Difference]: Without dead ends: 344 [2024-10-31 21:57:42,361 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-31 21:57:42,365 INFO L432 NwaCegarLoop]: 562 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 21:57:42,367 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 562 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 21:57:42,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2024-10-31 21:57:42,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 344. [2024-10-31 21:57:42,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 199 states have (on average 1.4472361809045227) internal successors, (288), 200 states have internal predecessors, (288), 135 states have call successors, (135), 9 states have call predecessors, (135), 9 states have return successors, (135), 135 states have call predecessors, (135), 135 states have call successors, (135) [2024-10-31 21:57:42,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 558 transitions. [2024-10-31 21:57:42,544 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 558 transitions. Word has length 322 [2024-10-31 21:57:42,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:57:42,545 INFO L471 AbstractCegarLoop]: Abstraction has 344 states and 558 transitions. [2024-10-31 21:57:42,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 2 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 2 states have call successors, (52) [2024-10-31 21:57:42,545 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 558 transitions. [2024-10-31 21:57:42,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2024-10-31 21:57:42,563 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:57:42,563 INFO L215 NwaCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:57:42,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-31 21:57:42,564 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:57:42,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:57:42,565 INFO L85 PathProgramCache]: Analyzing trace with hash -2089945241, now seen corresponding path program 1 times [2024-10-31 21:57:42,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:57:42,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164728309] [2024-10-31 21:57:42,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:57:42,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:57:43,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:44,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-31 21:57:44,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:44,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-31 21:57:44,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:44,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-31 21:57:44,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:44,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-31 21:57:44,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:44,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 21:57:44,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:44,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 21:57:44,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:44,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-31 21:57:44,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:44,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 21:57:44,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:44,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-31 21:57:44,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:45,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-31 21:57:45,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:45,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-31 21:57:45,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:45,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-31 21:57:45,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:45,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-31 21:57:45,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:45,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-31 21:57:45,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:45,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-31 21:57:45,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:45,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-31 21:57:45,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:45,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-31 21:57:45,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:45,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-31 21:57:45,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:45,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-31 21:57:45,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:45,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-31 21:57:45,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:45,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-31 21:57:45,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:45,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-31 21:57:45,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:45,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-31 21:57:45,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:45,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-31 21:57:45,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:45,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-31 21:57:45,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:45,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-31 21:57:45,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:45,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-31 21:57:45,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:45,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-31 21:57:45,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:45,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-10-31 21:57:45,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:45,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-10-31 21:57:45,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:45,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-10-31 21:57:45,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:45,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-10-31 21:57:45,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:45,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-10-31 21:57:45,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:45,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2024-10-31 21:57:45,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:45,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-10-31 21:57:45,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:45,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2024-10-31 21:57:45,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:45,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2024-10-31 21:57:45,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:45,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2024-10-31 21:57:45,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:45,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2024-10-31 21:57:45,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:45,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2024-10-31 21:57:45,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:45,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2024-10-31 21:57:45,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:45,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-10-31 21:57:45,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:45,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2024-10-31 21:57:45,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:45,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2024-10-31 21:57:45,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:45,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2024-10-31 21:57:45,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:45,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 278 [2024-10-31 21:57:45,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:45,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 284 [2024-10-31 21:57:45,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:45,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 290 [2024-10-31 21:57:45,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:45,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 296 [2024-10-31 21:57:45,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:45,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 302 [2024-10-31 21:57:45,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:45,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 308 [2024-10-31 21:57:45,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:45,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 314 [2024-10-31 21:57:45,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:45,387 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5304 trivial. 0 not checked. [2024-10-31 21:57:45,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:57:45,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164728309] [2024-10-31 21:57:45,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164728309] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:57:45,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:57:45,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 21:57:45,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711275413] [2024-10-31 21:57:45,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:57:45,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 21:57:45,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:57:45,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 21:57:45,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 21:57:45,398 INFO L87 Difference]: Start difference. First operand 344 states and 558 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2024-10-31 21:57:45,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:57:45,652 INFO L93 Difference]: Finished difference Result 684 states and 1118 transitions. [2024-10-31 21:57:45,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 21:57:45,654 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) Word has length 322 [2024-10-31 21:57:45,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:57:45,676 INFO L225 Difference]: With dead ends: 684 [2024-10-31 21:57:45,676 INFO L226 Difference]: Without dead ends: 574 [2024-10-31 21:57:45,681 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-31 21:57:45,683 INFO L432 NwaCegarLoop]: 597 mSDtfsCounter, 440 mSDsluCounter, 1144 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 1741 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 21:57:45,684 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [440 Valid, 1741 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 21:57:45,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2024-10-31 21:57:45,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 572. [2024-10-31 21:57:45,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 572 states, 336 states have (on average 1.5208333333333333) internal successors, (511), 338 states have internal predecessors, (511), 217 states have call successors, (217), 18 states have call predecessors, (217), 18 states have return successors, (224), 217 states have call predecessors, (224), 217 states have call successors, (224) [2024-10-31 21:57:45,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 952 transitions. [2024-10-31 21:57:45,851 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 952 transitions. Word has length 322 [2024-10-31 21:57:45,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:57:45,852 INFO L471 AbstractCegarLoop]: Abstraction has 572 states and 952 transitions. [2024-10-31 21:57:45,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2024-10-31 21:57:45,853 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 952 transitions. [2024-10-31 21:57:45,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2024-10-31 21:57:45,875 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:57:45,875 INFO L215 NwaCegarLoop]: trace histogram [57, 57, 57, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:57:45,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-31 21:57:45,876 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:57:45,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:57:45,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1558500961, now seen corresponding path program 1 times [2024-10-31 21:57:45,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:57:45,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568246705] [2024-10-31 21:57:45,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:57:45,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:57:46,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:47,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-31 21:57:47,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:47,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-31 21:57:47,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:48,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-31 21:57:48,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:48,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-31 21:57:48,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:48,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-31 21:57:48,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:48,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-31 21:57:48,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:48,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-31 21:57:48,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:48,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-31 21:57:48,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:48,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-31 21:57:48,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:48,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-31 21:57:48,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:48,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-31 21:57:48,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:48,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 21:57:48,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:48,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-31 21:57:48,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:48,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-31 21:57:48,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:48,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-31 21:57:48,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:48,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-31 21:57:48,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:48,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-31 21:57:48,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:48,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-31 21:57:48,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:48,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-31 21:57:48,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:48,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-31 21:57:48,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:48,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-31 21:57:48,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:48,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-31 21:57:48,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:48,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-31 21:57:48,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:48,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-31 21:57:48,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:48,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-31 21:57:48,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:48,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-31 21:57:48,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:48,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-31 21:57:48,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:48,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-31 21:57:48,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:48,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-10-31 21:57:48,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:48,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-10-31 21:57:48,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:48,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-10-31 21:57:48,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:48,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-10-31 21:57:48,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:48,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-10-31 21:57:48,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:48,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2024-10-31 21:57:48,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:48,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-10-31 21:57:48,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:48,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2024-10-31 21:57:48,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:48,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2024-10-31 21:57:48,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:48,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2024-10-31 21:57:48,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:48,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2024-10-31 21:57:48,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:48,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2024-10-31 21:57:48,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:48,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2024-10-31 21:57:48,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:48,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-10-31 21:57:48,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:48,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2024-10-31 21:57:48,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:48,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2024-10-31 21:57:48,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:48,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2024-10-31 21:57:48,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:48,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 278 [2024-10-31 21:57:48,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:48,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 284 [2024-10-31 21:57:48,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:48,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 290 [2024-10-31 21:57:48,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:48,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 296 [2024-10-31 21:57:48,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:48,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 302 [2024-10-31 21:57:48,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:48,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 308 [2024-10-31 21:57:48,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:48,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 314 [2024-10-31 21:57:48,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:48,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 320 [2024-10-31 21:57:48,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:48,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2024-10-31 21:57:48,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:48,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 332 [2024-10-31 21:57:48,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:48,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 338 [2024-10-31 21:57:48,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:48,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 344 [2024-10-31 21:57:48,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:48,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 350 [2024-10-31 21:57:48,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:48,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 356 [2024-10-31 21:57:48,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:48,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 362 [2024-10-31 21:57:48,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:48,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 368 [2024-10-31 21:57:48,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:48,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 374 [2024-10-31 21:57:48,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:48,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 380 [2024-10-31 21:57:48,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:48,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 386 [2024-10-31 21:57:48,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:48,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 392 [2024-10-31 21:57:48,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:48,550 INFO L134 CoverageAnalysis]: Checked inductivity of 6434 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6434 trivial. 0 not checked. [2024-10-31 21:57:48,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:57:48,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568246705] [2024-10-31 21:57:48,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568246705] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:57:48,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:57:48,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-31 21:57:48,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993313536] [2024-10-31 21:57:48,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:57:48,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-31 21:57:48,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:57:48,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-31 21:57:48,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-31 21:57:48,555 INFO L87 Difference]: Start difference. First operand 572 states and 952 transitions. Second operand has 8 states, 8 states have (on average 11.25) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (61), 5 states have call predecessors, (61), 3 states have return successors, (61), 3 states have call predecessors, (61), 2 states have call successors, (61) [2024-10-31 21:57:52,642 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-31 21:57:56,658 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-31 21:58:00,687 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-31 21:58:04,710 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []