./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-pthread/cs_stack-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-pthread/cs_stack-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0a870e8a4a7dff1b238c9b19b47586f7abd44e3f0eb9969b7dad7bbd7f80e506 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 21:25:29,063 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 21:25:29,126 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-07 21:25:29,133 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 21:25:29,133 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 21:25:29,149 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 21:25:29,150 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 21:25:29,150 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 21:25:29,150 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 21:25:29,150 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 21:25:29,150 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 21:25:29,150 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 21:25:29,150 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 21:25:29,150 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 21:25:29,150 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 21:25:29,151 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 21:25:29,151 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 21:25:29,151 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 21:25:29,151 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 21:25:29,151 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 21:25:29,151 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 21:25:29,151 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 21:25:29,151 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 21:25:29,151 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 21:25:29,151 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 21:25:29,151 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 21:25:29,151 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 21:25:29,151 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 21:25:29,151 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 21:25:29,151 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 21:25:29,151 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 21:25:29,151 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 21:25:29,151 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 21:25:29,151 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 21:25:29,151 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 21:25:29,152 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 21:25:29,152 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 21:25:29,152 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 21:25:29,152 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 21:25:29,152 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 21:25:29,152 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 21:25:29,152 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 21:25:29,152 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 21:25:29,152 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0a870e8a4a7dff1b238c9b19b47586f7abd44e3f0eb9969b7dad7bbd7f80e506 [2025-02-07 21:25:29,376 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 21:25:29,381 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 21:25:29,383 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 21:25:29,384 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 21:25:29,384 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 21:25:29,386 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-pthread/cs_stack-2.i [2025-02-07 21:25:30,546 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4a1050334/cfd2168e9c8c4c6c85ce246dda73a99a/FLAGd10b7824d [2025-02-07 21:25:30,850 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 21:25:30,850 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_stack-2.i [2025-02-07 21:25:30,864 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4a1050334/cfd2168e9c8c4c6c85ce246dda73a99a/FLAGd10b7824d [2025-02-07 21:25:31,125 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4a1050334/cfd2168e9c8c4c6c85ce246dda73a99a [2025-02-07 21:25:31,127 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 21:25:31,130 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 21:25:31,131 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 21:25:31,131 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 21:25:31,134 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 21:25:31,135 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 09:25:31" (1/1) ... [2025-02-07 21:25:31,136 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62abc653 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:31, skipping insertion in model container [2025-02-07 21:25:31,137 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 09:25:31" (1/1) ... [2025-02-07 21:25:31,170 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 21:25:31,434 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_stack-2.i[34556,34569] [2025-02-07 21:25:31,555 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 21:25:31,571 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 21:25:31,604 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_stack-2.i[34556,34569] [2025-02-07 21:25:31,651 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 21:25:31,697 INFO L204 MainTranslator]: Completed translation [2025-02-07 21:25:31,697 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:31 WrapperNode [2025-02-07 21:25:31,697 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 21:25:31,698 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 21:25:31,698 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 21:25:31,698 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 21:25:31,702 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:31" (1/1) ... [2025-02-07 21:25:31,722 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:31" (1/1) ... [2025-02-07 21:25:31,769 INFO L138 Inliner]: procedures = 252, calls = 297, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 644 [2025-02-07 21:25:31,770 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 21:25:31,770 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 21:25:31,770 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 21:25:31,770 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 21:25:31,777 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:31" (1/1) ... [2025-02-07 21:25:31,777 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:31" (1/1) ... [2025-02-07 21:25:31,784 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:31" (1/1) ... [2025-02-07 21:25:31,823 INFO L175 MemorySlicer]: Split 148 memory accesses to 18 slices as follows [2, 4, 8, 8, 8, 6, 2, 20, 8, 12, 10, 2, 6, 4, 22, 20, 0, 6]. 15 percent of accesses are in the largest equivalence class. The 51 initializations are split as follows [2, 0, 3, 3, 3, 0, 0, 6, 2, 6, 2, 0, 2, 2, 10, 10, 0, 0]. The 33 writes are split as follows [0, 2, 2, 2, 2, 0, 0, 8, 3, 3, 3, 0, 2, 0, 6, 0, 0, 0]. [2025-02-07 21:25:31,823 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:31" (1/1) ... [2025-02-07 21:25:31,824 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:31" (1/1) ... [2025-02-07 21:25:31,854 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:31" (1/1) ... [2025-02-07 21:25:31,858 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:31" (1/1) ... [2025-02-07 21:25:31,866 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:31" (1/1) ... [2025-02-07 21:25:31,873 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:31" (1/1) ... [2025-02-07 21:25:31,889 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 21:25:31,890 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 21:25:31,890 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 21:25:31,890 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 21:25:31,890 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:31" (1/1) ... [2025-02-07 21:25:31,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 21:25:31,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:25:31,916 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-07 21:25:31,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-07 21:25:31,937 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-07 21:25:31,937 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-07 21:25:31,937 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-07 21:25:31,937 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_lock [2025-02-07 21:25:31,937 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_lock [2025-02-07 21:25:31,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-07 21:25:31,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-07 21:25:31,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-07 21:25:31,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-07 21:25:31,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-02-07 21:25:31,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-02-07 21:25:31,939 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-02-07 21:25:31,939 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-02-07 21:25:31,939 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-02-07 21:25:31,939 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-02-07 21:25:31,939 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-02-07 21:25:31,939 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-02-07 21:25:31,939 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-02-07 21:25:31,939 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-02-07 21:25:31,939 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-02-07 21:25:31,939 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-02-07 21:25:31,939 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-02-07 21:25:31,940 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-02-07 21:25:31,940 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-07 21:25:31,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-07 21:25:31,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-07 21:25:31,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-07 21:25:31,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-02-07 21:25:31,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-02-07 21:25:31,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-02-07 21:25:31,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-02-07 21:25:31,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-02-07 21:25:31,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-02-07 21:25:31,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-02-07 21:25:31,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-02-07 21:25:31,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-02-07 21:25:31,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-02-07 21:25:31,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-02-07 21:25:31,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-02-07 21:25:31,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-02-07 21:25:31,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2025-02-07 21:25:31,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2025-02-07 21:25:31,943 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_unlock [2025-02-07 21:25:31,943 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_unlock [2025-02-07 21:25:31,943 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-07 21:25:31,943 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-07 21:25:31,943 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-07 21:25:31,943 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-07 21:25:31,943 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-07 21:25:31,943 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-07 21:25:31,943 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-02-07 21:25:31,943 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-02-07 21:25:31,943 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-02-07 21:25:31,943 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-02-07 21:25:31,943 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-02-07 21:25:31,943 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-02-07 21:25:31,943 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-02-07 21:25:31,943 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-02-07 21:25:31,943 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-02-07 21:25:31,943 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-02-07 21:25:31,943 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-02-07 21:25:31,943 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-02-07 21:25:31,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-07 21:25:31,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-07 21:25:31,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-07 21:25:31,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-07 21:25:31,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-07 21:25:31,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-07 21:25:31,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-02-07 21:25:31,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-02-07 21:25:31,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-02-07 21:25:31,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-02-07 21:25:31,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-02-07 21:25:31,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-02-07 21:25:31,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-02-07 21:25:31,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-02-07 21:25:31,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-02-07 21:25:31,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-02-07 21:25:31,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-02-07 21:25:31,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-02-07 21:25:31,944 INFO L130 BoogieDeclarations]: Found specification of procedure get_top [2025-02-07 21:25:31,944 INFO L138 BoogieDeclarations]: Found implementation of procedure get_top [2025-02-07 21:25:31,944 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 21:25:31,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-07 21:25:31,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-07 21:25:31,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-07 21:25:31,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-02-07 21:25:31,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-02-07 21:25:31,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-02-07 21:25:31,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-02-07 21:25:31,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-02-07 21:25:31,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-02-07 21:25:31,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-02-07 21:25:31,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-02-07 21:25:31,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-02-07 21:25:31,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-02-07 21:25:31,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-02-07 21:25:31,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-02-07 21:25:31,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-02-07 21:25:31,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-02-07 21:25:31,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-02-07 21:25:31,946 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2025-02-07 21:25:31,946 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2025-02-07 21:25:31,946 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2025-02-07 21:25:31,946 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2025-02-07 21:25:31,947 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-02-07 21:25:31,947 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-02-07 21:25:31,947 INFO L130 BoogieDeclarations]: Found specification of procedure error [2025-02-07 21:25:31,947 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2025-02-07 21:25:31,947 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2025-02-07 21:25:31,947 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2025-02-07 21:25:31,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 21:25:31,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-07 21:25:31,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-07 21:25:31,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-07 21:25:31,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-07 21:25:31,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-07 21:25:31,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-07 21:25:31,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-07 21:25:31,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-02-07 21:25:31,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-02-07 21:25:31,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-02-07 21:25:31,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-02-07 21:25:31,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-02-07 21:25:31,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-02-07 21:25:31,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-02-07 21:25:31,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-02-07 21:25:31,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-02-07 21:25:31,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-02-07 21:25:31,947 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 21:25:31,947 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 21:25:32,159 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 21:25:32,161 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 21:25:32,212 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L952: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);#res := 0; [2025-02-07 21:25:32,213 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L952: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-02-07 21:25:32,213 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L952-1: SUMMARY for call __CS_cs(); srcloc: null [2025-02-07 21:25:32,213 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L951: havoc #t~mem53; [2025-02-07 21:25:32,653 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1026-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; [2025-02-07 21:25:32,654 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1026-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-02-07 21:25:32,654 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1026-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-07 21:25:32,654 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1068: assume -2147483648 <= main_thread_#t~ret76#1 && main_thread_#t~ret76#1 <= 2147483647;havoc main_thread_#t~mem75#1;havoc main_thread_#t~ret76#1; [2025-02-07 21:25:32,654 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1068-1: SUMMARY for call main_thread_#t~ret76#1 := __CS_pthread_join(main_thread_#t~mem75#1, 0, 0); srcloc: null [2025-02-07 21:25:32,654 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1002-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);pop_#res#1 := 0; [2025-02-07 21:25:32,654 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1002-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296));pop_#res#1 := 0; [2025-02-07 21:25:32,654 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1002-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-07 21:25:32,654 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L969-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);push_#res#1 := 0; [2025-02-07 21:25:32,654 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L969-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-02-07 21:25:32,654 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L969-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-07 21:25:32,654 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1027: assume -2147483648 <= t1_#t~ret65#1 && t1_#t~ret65#1 <= 2147483647;havoc t1_#t~ret65#1; [2025-02-07 21:25:32,654 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1027-1: SUMMARY for call t1_#t~ret65#1 := __CS_pthread_mutex_unlock(~#m~0.base, ~#m~0.offset + (if ~__CS_round~0 % 256 % 4294967296 <= 2147483647 then ~__CS_round~0 % 256 % 4294967296 else ~__CS_round~0 % 256 % 4294967296 - 4294967296)); srcloc: null [2025-02-07 21:25:32,654 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1019: assume -1 == t1_#t~ret64#1;havoc t1_#t~ret64#1; [2025-02-07 21:25:32,654 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1019: assume !(-1 == t1_#t~ret64#1);havoc t1_#t~ret64#1; [2025-02-07 21:25:32,654 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1044: assume !(-2 != t2_#t~ret69#1);havoc t2_#t~ret69#1; [2025-02-07 21:25:32,654 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1044: assume !!(-2 != t2_#t~ret69#1);havoc t2_#t~ret69#1; [2025-02-07 21:25:32,654 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1069-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; [2025-02-07 21:25:32,654 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1069-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296));call main_thread_#t~mem77#1 := read~int#1(main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset, 1); [2025-02-07 21:25:32,654 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1069-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-07 21:25:32,654 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1028-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; [2025-02-07 21:25:32,654 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1028-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296));t1_#t~post66#1 := t1_~i~0#1;t1_~i~0#1 := 1 + t1_#t~post66#1;havoc t1_#t~post66#1; [2025-02-07 21:25:32,655 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1028-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-07 21:25:32,655 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1070: assume -2147483648 <= main_thread_#t~ret78#1 && main_thread_#t~ret78#1 <= 2147483647;havoc main_thread_#t~mem77#1;havoc main_thread_#t~ret78#1; [2025-02-07 21:25:32,655 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1070-1: SUMMARY for call main_thread_#t~ret78#1 := __CS_pthread_join(main_thread_#t~mem77#1, 0, 0); srcloc: null [2025-02-07 21:25:32,655 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1004-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);pop_#res#1 := 0; [2025-02-07 21:25:32,655 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1004-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296));t2_#t~ret69#1 := pop_#res#1;havoc pop_#t~ret58#1, pop_#t~ret59#1, pop_#t~ret60#1, pop_#t~mem61#1, pop_~stack#1.base, pop_~stack#1.offset;havoc pop_#in~stack#1.base, pop_#in~stack#1.offset;assume { :end_inline_pop } true;assume -2147483648 <= t2_#t~ret69#1 && t2_#t~ret69#1 <= 2147483647; [2025-02-07 21:25:32,655 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1004-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-07 21:25:32,655 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1062: main_thread_#t~ret72#1 := __CS_pthread_mutex_init_#res#1;havoc __CS_pthread_mutex_init_~mutex#1.base, __CS_pthread_mutex_init_~mutex#1.offset, __CS_pthread_mutex_init_~attr#1.base, __CS_pthread_mutex_init_~attr#1.offset;havoc __CS_pthread_mutex_init_#in~mutex#1.base, __CS_pthread_mutex_init_#in~mutex#1.offset, __CS_pthread_mutex_init_#in~attr#1.base, __CS_pthread_mutex_init_#in~attr#1.offset;assume { :end_inline___CS_pthread_mutex_init } true;assume -2147483648 <= main_thread_#t~ret72#1 && main_thread_#t~ret72#1 <= 2147483647;havoc main_thread_#t~ret72#1; [2025-02-07 21:25:32,655 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1021-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; [2025-02-07 21:25:32,656 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1021-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-02-07 21:25:32,656 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1021-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-07 21:25:32,656 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1046-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; [2025-02-07 21:25:32,656 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1046-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-02-07 21:25:32,656 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1046-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-07 21:25:32,656 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1071-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; [2025-02-07 21:25:32,656 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1071-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296));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;#t~ret154#1.base, #t~ret154#1.offset := main_thread_#res#1.base, main_thread_#res#1.offset;havoc main_thread_#t~ret72#1, main_thread_#t~ret73#1, main_thread_#t~ret74#1, main_thread_#t~mem75#1, main_thread_#t~ret76#1, main_thread_#t~mem77#1, main_thread_#t~ret78#1, main_thread_~arg#1.base, main_thread_~arg#1.offset, main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset, main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset;havoc main_thread_#in~arg#1.base, main_thread_#in~arg#1.offset;assume { :end_inline_main_thread } true;#t~funptrres151#1.base, #t~funptrres151#1.offset := #t~ret154#1.base, #t~ret154#1.offset; [2025-02-07 21:25:32,656 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1071-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-07 21:25:32,656 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1063-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; [2025-02-07 21:25:32,656 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1063-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-02-07 21:25:32,656 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1063-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-07 21:25:32,657 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1022: SUMMARY for call error(); srcloc: null [2025-02-07 21:25:32,657 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1047: SUMMARY for call error(); srcloc: null [2025-02-07 21:25:32,657 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L981-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);push_#res#1 := 0; [2025-02-07 21:25:32,657 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L981-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296));t1_#t~ret64#1 := push_#res#1;havoc push_#t~mem55#1, push_#t~ret56#1, push_#t~ret57#1, push_~stack#1.base, push_~stack#1.offset, push_~x#1;havoc push_#in~stack#1.base, push_#in~stack#1.offset, push_#in~x#1;assume { :end_inline_push } true;assume -2147483648 <= t1_#t~ret64#1 && t1_#t~ret64#1 <= 2147483647; [2025-02-07 21:25:32,657 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L981-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-07 21:25:32,657 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1064: assume -2147483648 <= main_thread_#t~ret73#1 && main_thread_#t~ret73#1 <= 2147483647;havoc main_thread_#t~ret73#1; [2025-02-07 21:25:32,657 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1064-1: SUMMARY for call main_thread_#t~ret73#1 := __CS_pthread_create(main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset, 0, 0, #funAddr~t1.base, #funAddr~t1.offset, 0, 0); srcloc: null [2025-02-07 21:25:32,657 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1065-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; [2025-02-07 21:25:32,657 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1065-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-02-07 21:25:32,657 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1065-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-07 21:25:32,657 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L999: havoc pop_#t~ret60#1;havoc pop_#t~mem61#1; [2025-02-07 21:25:32,657 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1024-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; [2025-02-07 21:25:32,657 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1024-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296));call write~int#12(1, ~#flag~0.base, ~#flag~0.offset + (if ~__CS_round~0 % 256 % 4294967296 <= 2147483647 then ~__CS_round~0 % 256 % 4294967296 else ~__CS_round~0 % 256 % 4294967296 - 4294967296), 1); [2025-02-07 21:25:32,657 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1024-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-07 21:25:32,657 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1049-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; [2025-02-07 21:25:32,657 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1049-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-02-07 21:25:32,658 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1049-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-07 21:25:32,658 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1066: assume -2147483648 <= main_thread_#t~ret74#1 && main_thread_#t~ret74#1 <= 2147483647;havoc main_thread_#t~ret74#1; [2025-02-07 21:25:32,658 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1066-1: SUMMARY for call main_thread_#t~ret74#1 := __CS_pthread_create(main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset, 0, 0, #funAddr~t2.base, #funAddr~t2.offset, 0, 0); srcloc: null [2025-02-07 21:25:32,658 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1000-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);pop_#res#1 := 0; [2025-02-07 21:25:32,658 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1000-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-02-07 21:25:32,658 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1000-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-07 21:25:32,658 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L992-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);pop_#res#1 := 0; [2025-02-07 21:25:32,658 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L992-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-02-07 21:25:32,658 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L992-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-07 21:25:32,658 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1067-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; [2025-02-07 21:25:32,658 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1067-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296));call main_thread_#t~mem75#1 := read~int#1(main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset, 1); [2025-02-07 21:25:32,658 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1067-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-07 21:25:32,675 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L930-1: SUMMARY for call __CS_cs(); srcloc: null [2025-02-07 21:25:32,676 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L928: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296); [2025-02-07 21:25:32,676 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L928: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-02-07 21:25:32,676 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L928-1: SUMMARY for call __CS_cs(); srcloc: null [2025-02-07 21:25:32,676 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L934: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296); [2025-02-07 21:25:32,676 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L934: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-02-07 21:25:32,676 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L934-1: SUMMARY for call __CS_cs(); srcloc: null [2025-02-07 21:25:32,676 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L932: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296); [2025-02-07 21:25:32,676 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L932: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-02-07 21:25:32,676 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L932-1: SUMMARY for call __CS_cs(); srcloc: null [2025-02-07 21:25:32,676 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L930: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296); [2025-02-07 21:25:32,676 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L930: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-02-07 21:25:36,588 INFO L? ?]: Removed 135 outVars from TransFormulas that were not future-live. [2025-02-07 21:25:36,588 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 21:25:36,600 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 21:25:36,601 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 21:25:36,602 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:25:36 BoogieIcfgContainer [2025-02-07 21:25:36,602 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 21:25:36,604 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 21:25:36,604 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 21:25:36,607 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 21:25:36,607 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 09:25:31" (1/3) ... [2025-02-07 21:25:36,608 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@660616b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 09:25:36, skipping insertion in model container [2025-02-07 21:25:36,608 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:31" (2/3) ... [2025-02-07 21:25:36,608 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@660616b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 09:25:36, skipping insertion in model container [2025-02-07 21:25:36,609 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:25:36" (3/3) ... [2025-02-07 21:25:36,610 INFO L128 eAbstractionObserver]: Analyzing ICFG cs_stack-2.i [2025-02-07 21:25:36,619 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 21:25:36,623 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cs_stack-2.i that has 10 procedures, 179 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-02-07 21:25:36,660 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 21:25:36,668 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;@42a3e212, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 21:25:36,669 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 21:25:36,672 INFO L276 IsEmpty]: Start isEmpty. Operand has 168 states, 95 states have (on average 1.5157894736842106) internal successors, (144), 104 states have internal predecessors, (144), 55 states have call successors, (55), 6 states have call predecessors, (55), 6 states have return successors, (55), 55 states have call predecessors, (55), 55 states have call successors, (55) [2025-02-07 21:25:36,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-02-07 21:25:36,683 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:25:36,683 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:25:36,684 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:25:36,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:25:36,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1094129548, now seen corresponding path program 1 times [2025-02-07 21:25:36,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:25:36,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978746246] [2025-02-07 21:25:36,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:36,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:25:36,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-07 21:25:36,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-07 21:25:36,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:36,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:37,129 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-02-07 21:25:37,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:25:37,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978746246] [2025-02-07 21:25:37,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978746246] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:25:37,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1459597839] [2025-02-07 21:25:37,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:37,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:25:37,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:25:37,132 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 21:25:37,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-07 21:25:37,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-07 21:25:37,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-07 21:25:37,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:37,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:37,472 INFO L256 TraceCheckSpWp]: Trace formula consists of 725 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-07 21:25:37,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 21:25:37,490 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-02-07 21:25:37,490 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 21:25:37,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1459597839] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:25:37,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-07 21:25:37,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-07 21:25:37,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438715797] [2025-02-07 21:25:37,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:25:37,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-07 21:25:37,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:25:37,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-07 21:25:37,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-07 21:25:37,516 INFO L87 Difference]: Start difference. First operand has 168 states, 95 states have (on average 1.5157894736842106) internal successors, (144), 104 states have internal predecessors, (144), 55 states have call successors, (55), 6 states have call predecessors, (55), 6 states have return successors, (55), 55 states have call predecessors, (55), 55 states have call successors, (55) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-07 21:25:37,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:25:37,557 INFO L93 Difference]: Finished difference Result 319 states and 543 transitions. [2025-02-07 21:25:37,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-07 21:25:37,560 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 93 [2025-02-07 21:25:37,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:25:37,567 INFO L225 Difference]: With dead ends: 319 [2025-02-07 21:25:37,568 INFO L226 Difference]: Without dead ends: 93 [2025-02-07 21:25:37,576 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-07 21:25:37,579 INFO L435 NwaCegarLoop]: 246 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, 246 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 [2025-02-07 21:25:37,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 21:25:37,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-02-07 21:25:37,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2025-02-07 21:25:37,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 59 states have (on average 1.1694915254237288) internal successors, (69), 59 states have internal predecessors, (69), 28 states have call successors, (28), 5 states have call predecessors, (28), 5 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-02-07 21:25:37,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 125 transitions. [2025-02-07 21:25:37,613 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 125 transitions. Word has length 93 [2025-02-07 21:25:37,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:25:37,614 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 125 transitions. [2025-02-07 21:25:37,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-07 21:25:37,614 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 125 transitions. [2025-02-07 21:25:37,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-02-07 21:25:37,616 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:25:37,616 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:25:37,624 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-07 21:25:37,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-07 21:25:37,817 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:25:37,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:25:37,818 INFO L85 PathProgramCache]: Analyzing trace with hash 786888830, now seen corresponding path program 1 times [2025-02-07 21:25:37,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:25:37,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796242681] [2025-02-07 21:25:37,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:37,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:25:37,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-07 21:25:37,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-07 21:25:37,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:37,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:38,411 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-07 21:25:38,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:25:38,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796242681] [2025-02-07 21:25:38,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796242681] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:25:38,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:25:38,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 21:25:38,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72962801] [2025-02-07 21:25:38,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:25:38,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 21:25:38,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:25:38,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 21:25:38,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 21:25:38,417 INFO L87 Difference]: Start difference. First operand 93 states and 125 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-07 21:25:38,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:25:38,463 INFO L93 Difference]: Finished difference Result 183 states and 249 transitions. [2025-02-07 21:25:38,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 21:25:38,464 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 93 [2025-02-07 21:25:38,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:25:38,469 INFO L225 Difference]: With dead ends: 183 [2025-02-07 21:25:38,469 INFO L226 Difference]: Without dead ends: 149 [2025-02-07 21:25:38,469 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 21:25:38,470 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 88 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 21:25:38,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 378 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 21:25:38,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2025-02-07 21:25:38,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2025-02-07 21:25:38,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 97 states have (on average 1.175257731958763) internal successors, (114), 97 states have internal predecessors, (114), 41 states have call successors, (41), 10 states have call predecessors, (41), 10 states have return successors, (44), 41 states have call predecessors, (44), 41 states have call successors, (44) [2025-02-07 21:25:38,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 199 transitions. [2025-02-07 21:25:38,497 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 199 transitions. Word has length 93 [2025-02-07 21:25:38,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:25:38,497 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 199 transitions. [2025-02-07 21:25:38,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-07 21:25:38,497 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 199 transitions. [2025-02-07 21:25:38,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-02-07 21:25:38,504 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:25:38,505 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:25:38,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 21:25:38,505 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:25:38,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:25:38,505 INFO L85 PathProgramCache]: Analyzing trace with hash 827245965, now seen corresponding path program 1 times [2025-02-07 21:25:38,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:25:38,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366865590] [2025-02-07 21:25:38,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:38,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:25:38,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-02-07 21:25:38,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-02-07 21:25:38,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:38,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:39,173 INFO L134 CoverageAnalysis]: Checked inductivity of 836 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 836 trivial. 0 not checked. [2025-02-07 21:25:39,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:25:39,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366865590] [2025-02-07 21:25:39,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366865590] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:25:39,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:25:39,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 21:25:39,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489827400] [2025-02-07 21:25:39,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:25:39,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 21:25:39,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:25:39,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 21:25:39,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 21:25:39,176 INFO L87 Difference]: Start difference. First operand 149 states and 199 transitions. Second operand has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 4 states have call successors, (24), 1 states have call predecessors, (24), 2 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) [2025-02-07 21:25:43,196 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 [] [2025-02-07 21:25:43,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:25:43,306 INFO L93 Difference]: Finished difference Result 193 states and 258 transitions. [2025-02-07 21:25:43,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 21:25:43,309 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 4 states have call successors, (24), 1 states have call predecessors, (24), 2 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) Word has length 183 [2025-02-07 21:25:43,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:25:43,310 INFO L225 Difference]: With dead ends: 193 [2025-02-07 21:25:43,310 INFO L226 Difference]: Without dead ends: 150 [2025-02-07 21:25:43,311 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-07 21:25:43,311 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 113 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 11 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:25:43,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 317 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 38 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-02-07 21:25:43,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2025-02-07 21:25:43,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 147. [2025-02-07 21:25:43,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 95 states have (on average 1.1578947368421053) internal successors, (110), 96 states have internal predecessors, (110), 40 states have call successors, (40), 10 states have call predecessors, (40), 11 states have return successors, (43), 40 states have call predecessors, (43), 40 states have call successors, (43) [2025-02-07 21:25:43,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 193 transitions. [2025-02-07 21:25:43,333 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 193 transitions. Word has length 183 [2025-02-07 21:25:43,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:25:43,334 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 193 transitions. [2025-02-07 21:25:43,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 4 states have call successors, (24), 1 states have call predecessors, (24), 2 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) [2025-02-07 21:25:43,334 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 193 transitions. [2025-02-07 21:25:43,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-02-07 21:25:43,335 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:25:43,335 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:25:43,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-07 21:25:43,336 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:25:43,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:25:43,336 INFO L85 PathProgramCache]: Analyzing trace with hash 140321389, now seen corresponding path program 1 times [2025-02-07 21:25:43,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:25:43,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366872687] [2025-02-07 21:25:43,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:43,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:25:43,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-02-07 21:25:43,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-02-07 21:25:43,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:43,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:43,811 INFO L134 CoverageAnalysis]: Checked inductivity of 836 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 836 trivial. 0 not checked. [2025-02-07 21:25:43,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:25:43,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366872687] [2025-02-07 21:25:43,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366872687] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:25:43,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:25:43,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 21:25:43,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666290484] [2025-02-07 21:25:43,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:25:43,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 21:25:43,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:25:43,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 21:25:43,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 21:25:43,813 INFO L87 Difference]: Start difference. First operand 147 states and 193 transitions. Second operand has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 4 states have call successors, (24), 1 states have call predecessors, (24), 2 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) [2025-02-07 21:25:47,822 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 [] [2025-02-07 21:25:47,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:25:47,941 INFO L93 Difference]: Finished difference Result 238 states and 310 transitions. [2025-02-07 21:25:47,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 21:25:47,942 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 4 states have call successors, (24), 1 states have call predecessors, (24), 2 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) Word has length 183 [2025-02-07 21:25:47,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:25:47,945 INFO L225 Difference]: With dead ends: 238 [2025-02-07 21:25:47,945 INFO L226 Difference]: Without dead ends: 130 [2025-02-07 21:25:47,945 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-07 21:25:47,946 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 113 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:25:47,946 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 324 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 35 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-02-07 21:25:47,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-02-07 21:25:47,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2025-02-07 21:25:47,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 84 states have (on average 1.119047619047619) internal successors, (94), 84 states have internal predecessors, (94), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (36), 35 states have call predecessors, (36), 35 states have call successors, (36) [2025-02-07 21:25:47,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 165 transitions. [2025-02-07 21:25:47,961 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 165 transitions. Word has length 183 [2025-02-07 21:25:47,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:25:47,961 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 165 transitions. [2025-02-07 21:25:47,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 4 states have call successors, (24), 1 states have call predecessors, (24), 2 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) [2025-02-07 21:25:47,962 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 165 transitions. [2025-02-07 21:25:47,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-02-07 21:25:47,963 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:25:47,963 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:25:47,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-07 21:25:47,963 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:25:47,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:25:47,964 INFO L85 PathProgramCache]: Analyzing trace with hash -2140498099, now seen corresponding path program 1 times [2025-02-07 21:25:47,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:25:47,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811727160] [2025-02-07 21:25:47,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:47,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:25:48,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-02-07 21:25:48,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-02-07 21:25:48,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:48,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:48,200 INFO L134 CoverageAnalysis]: Checked inductivity of 836 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 835 trivial. 0 not checked. [2025-02-07 21:25:48,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:25:48,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811727160] [2025-02-07 21:25:48,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811727160] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:25:48,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2003879195] [2025-02-07 21:25:48,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:48,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:25:48,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:25:48,203 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 21:25:48,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-07 21:25:48,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-02-07 21:25:48,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-02-07 21:25:48,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:48,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:48,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 1111 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-07 21:25:48,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 21:25:48,633 INFO L134 CoverageAnalysis]: Checked inductivity of 836 backedges. 325 proven. 1 refuted. 0 times theorem prover too weak. 510 trivial. 0 not checked. [2025-02-07 21:25:48,633 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 21:25:48,870 INFO L134 CoverageAnalysis]: Checked inductivity of 836 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 835 trivial. 0 not checked. [2025-02-07 21:25:48,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2003879195] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 21:25:48,870 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 21:25:48,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-07 21:25:48,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377925186] [2025-02-07 21:25:48,871 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 21:25:48,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 21:25:48,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:25:48,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 21:25:48,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-07 21:25:48,873 INFO L87 Difference]: Start difference. First operand 130 states and 165 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 5 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 5 states have call predecessors, (52), 5 states have call successors, (52) [2025-02-07 21:25:48,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:25:48,944 INFO L93 Difference]: Finished difference Result 274 states and 367 transitions. [2025-02-07 21:25:48,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:25:48,946 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 5 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 5 states have call predecessors, (52), 5 states have call successors, (52) Word has length 183 [2025-02-07 21:25:48,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:25:48,948 INFO L225 Difference]: With dead ends: 274 [2025-02-07 21:25:48,949 INFO L226 Difference]: Without dead ends: 205 [2025-02-07 21:25:48,949 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 363 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-07 21:25:48,950 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 14 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 21:25:48,950 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 246 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 21:25:48,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-02-07 21:25:48,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 201. [2025-02-07 21:25:48,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 125 states have (on average 1.08) internal successors, (135), 125 states have internal predecessors, (135), 65 states have call successors, (65), 10 states have call predecessors, (65), 10 states have return successors, (69), 65 states have call predecessors, (69), 65 states have call successors, (69) [2025-02-07 21:25:48,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 269 transitions. [2025-02-07 21:25:48,975 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 269 transitions. Word has length 183 [2025-02-07 21:25:48,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:25:48,975 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 269 transitions. [2025-02-07 21:25:48,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 5 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 5 states have call predecessors, (52), 5 states have call successors, (52) [2025-02-07 21:25:48,976 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 269 transitions. [2025-02-07 21:25:48,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2025-02-07 21:25:48,978 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:25:48,979 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 18, 18, 18, 18, 18, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:25:48,986 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-07 21:25:49,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:25:49,179 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:25:49,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:25:49,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1749446680, now seen corresponding path program 1 times [2025-02-07 21:25:49,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:25:49,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948488879] [2025-02-07 21:25:49,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:49,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:25:49,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 357 statements into 1 equivalence classes. [2025-02-07 21:25:49,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 357 of 357 statements. [2025-02-07 21:25:49,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:49,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:49,910 INFO L134 CoverageAnalysis]: Checked inductivity of 2885 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2885 trivial. 0 not checked. [2025-02-07 21:25:49,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:25:49,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948488879] [2025-02-07 21:25:49,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948488879] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:25:49,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:25:49,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 21:25:49,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26040194] [2025-02-07 21:25:49,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:25:49,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 21:25:49,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:25:49,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 21:25:49,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 21:25:49,912 INFO L87 Difference]: Start difference. First operand 201 states and 269 transitions. Second operand has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 4 states have call successors, (24), 1 states have call predecessors, (24), 2 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) [2025-02-07 21:25:53,923 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 [] [2025-02-07 21:25:53,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:25:53,987 INFO L93 Difference]: Finished difference Result 210 states and 277 transitions. [2025-02-07 21:25:53,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 21:25:53,987 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 4 states have call successors, (24), 1 states have call predecessors, (24), 2 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) Word has length 357 [2025-02-07 21:25:53,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:25:53,988 INFO L225 Difference]: With dead ends: 210 [2025-02-07 21:25:53,988 INFO L226 Difference]: Without dead ends: 0 [2025-02-07 21:25:53,989 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-07 21:25:53,990 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 41 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-02-07 21:25:53,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 109 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 20 Invalid, 1 Unknown, 0 Unchecked, 4.0s Time] [2025-02-07 21:25:53,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-07 21:25:53,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-07 21:25:53,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 21:25:53,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-07 21:25:53,993 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 357 [2025-02-07 21:25:53,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:25:53,993 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-07 21:25:53,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 4 states have call successors, (24), 1 states have call predecessors, (24), 2 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) [2025-02-07 21:25:53,993 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-07 21:25:53,993 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-07 21:25:53,996 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-07 21:25:53,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-07 21:25:53,999 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-02-07 21:25:54,000 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-07 21:25:55,729 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-07 21:25:55,743 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#4.offset [2025-02-07 21:25:55,744 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#4.offset,GLOBAL]] [2025-02-07 21:25:55,744 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#4.offset,GLOBAL]],[IdentifierExpression[~#__CS_thread~0!base,GLOBAL]]] [2025-02-07 21:25:55,745 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#4.base [2025-02-07 21:25:55,745 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#4.base,GLOBAL] [2025-02-07 21:25:55,745 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#4.base,GLOBAL],[IdentifierExpression[~#__CS_thread~0!base,GLOBAL]]] [2025-02-07 21:25:55,745 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#4.base [2025-02-07 21:25:55,745 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#4.base,GLOBAL]] [2025-02-07 21:25:55,745 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#4.base,GLOBAL]],[IdentifierExpression[~#__CS_thread~0!base,GLOBAL]]] [2025-02-07 21:25:55,745 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#4.base [2025-02-07 21:25:55,745 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#4.base,GLOBAL] [2025-02-07 21:25:55,745 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#4.base,GLOBAL],[IdentifierExpression[~#__CS_thread~0!base,GLOBAL]]] [2025-02-07 21:25:55,745 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#4.base [2025-02-07 21:25:55,745 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#4.base,GLOBAL]] [2025-02-07 21:25:55,745 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#4.base,GLOBAL]],[IdentifierExpression[~#__CS_thread~0!base,GLOBAL]]] [2025-02-07 21:25:55,746 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#4.base [2025-02-07 21:25:55,746 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#4.base,GLOBAL]] [2025-02-07 21:25:55,746 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#4.base,GLOBAL]],[IdentifierExpression[~#__CS_thread~0!base,GLOBAL]]] [2025-02-07 21:25:55,747 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#4.base [2025-02-07 21:25:55,747 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#4.base,GLOBAL] [2025-02-07 21:25:55,747 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#4.base,GLOBAL],[IdentifierExpression[~#__CS_thread~0!base,GLOBAL]]] [2025-02-07 21:25:55,747 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#4.base [2025-02-07 21:25:55,748 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#4.base,GLOBAL]] [2025-02-07 21:25:55,748 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#4.base,GLOBAL]],[IdentifierExpression[~#__CS_thread~0!base,GLOBAL]]] [2025-02-07 21:25:55,748 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#4.base [2025-02-07 21:25:55,748 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#4.base,GLOBAL] [2025-02-07 21:25:55,748 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#4.base,GLOBAL],[IdentifierExpression[~#__CS_thread~0!base,GLOBAL]]] [2025-02-07 21:25:55,748 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#4.base [2025-02-07 21:25:55,748 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#4.base,GLOBAL]] [2025-02-07 21:25:55,748 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#4.base,GLOBAL]],[IdentifierExpression[~#__CS_thread~0!base,GLOBAL]]] [2025-02-07 21:25:55,748 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#4.offset [2025-02-07 21:25:55,748 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#4.offset,GLOBAL]] [2025-02-07 21:25:55,748 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#4.offset,GLOBAL]],[IdentifierExpression[~#__CS_thread~0!base,GLOBAL]]] [2025-02-07 21:25:55,748 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#4.base [2025-02-07 21:25:55,748 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#4.base,GLOBAL]] [2025-02-07 21:25:55,748 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#4.base,GLOBAL]],[IdentifierExpression[~#__CS_thread~0!base,GLOBAL]]] [2025-02-07 21:25:55,748 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#4.offset [2025-02-07 21:25:55,748 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#4.offset,GLOBAL] [2025-02-07 21:25:55,748 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#4.offset,GLOBAL],[IdentifierExpression[~#__CS_thread~0!base,GLOBAL]]] [2025-02-07 21:25:55,748 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~#fp!offset [2025-02-07 21:25:55,748 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~#fp!base [2025-02-07 21:25:55,748 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 09:25:55 BoogieIcfgContainer [2025-02-07 21:25:55,748 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-07 21:25:55,749 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-07 21:25:55,749 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-07 21:25:55,749 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-07 21:25:55,750 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:25:36" (3/4) ... [2025-02-07 21:25:55,751 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-07 21:25:55,756 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __CS_pthread_join [2025-02-07 21:25:55,756 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __CS_pthread_mutex_lock [2025-02-07 21:25:55,756 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __CS_pthread_mutex_unlock [2025-02-07 21:25:55,756 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ##fun~$Pointer$~TO~$Pointer$ [2025-02-07 21:25:55,756 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure get_top [2025-02-07 21:25:55,756 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __CS_pthread_create [2025-02-07 21:25:55,756 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-02-07 21:25:55,756 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure error [2025-02-07 21:25:55,756 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __CS_cs [2025-02-07 21:25:55,767 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 48 nodes and edges [2025-02-07 21:25:55,767 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2025-02-07 21:25:55,768 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2025-02-07 21:25:55,769 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-07 21:25:55,789 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (0 == \old(__CS_error)) [2025-02-07 21:25:55,789 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((__CS_error == 0) && (0 == \old(__CS_error))) [2025-02-07 21:25:55,831 WARN L140 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((__CS_error == 0) && (0 == \old(__CS_error))) [2025-02-07 21:25:55,831 WARN L140 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (0 == \old(__CS_error)) [2025-02-07 21:25:55,858 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-07 21:25:55,858 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-07 21:25:55,858 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-07 21:25:55,858 INFO L158 Benchmark]: Toolchain (without parser) took 24729.44ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 109.3MB in the beginning and 148.1MB in the end (delta: -38.8MB). Peak memory consumption was 164.8MB. Max. memory is 16.1GB. [2025-02-07 21:25:55,859 INFO L158 Benchmark]: CDTParser took 0.38ms. Allocated memory is still 201.3MB. Free memory is still 128.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 21:25:55,859 INFO L158 Benchmark]: CACSL2BoogieTranslator took 566.86ms. Allocated memory is still 142.6MB. Free memory was 109.3MB in the beginning and 74.0MB in the end (delta: 35.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-07 21:25:55,859 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.55ms. Allocated memory is still 142.6MB. Free memory was 74.0MB in the beginning and 68.6MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 21:25:55,859 INFO L158 Benchmark]: Boogie Preprocessor took 118.86ms. Allocated memory is still 142.6MB. Free memory was 68.6MB in the beginning and 61.2MB in the end (delta: 7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 21:25:55,859 INFO L158 Benchmark]: IcfgBuilder took 4712.40ms. Allocated memory is still 142.6MB. Free memory was 60.2MB in the beginning and 54.4MB in the end (delta: 5.8MB). Peak memory consumption was 36.1MB. Max. memory is 16.1GB. [2025-02-07 21:25:55,859 INFO L158 Benchmark]: TraceAbstraction took 19144.53ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 54.1MB in the beginning and 160.8MB in the end (delta: -106.7MB). Peak memory consumption was 151.4MB. Max. memory is 16.1GB. [2025-02-07 21:25:55,859 INFO L158 Benchmark]: Witness Printer took 109.03ms. Allocated memory is still 343.9MB. Free memory was 160.8MB in the beginning and 148.1MB in the end (delta: 12.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-07 21:25:55,861 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.38ms. Allocated memory is still 201.3MB. Free memory is still 128.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 566.86ms. Allocated memory is still 142.6MB. Free memory was 109.3MB in the beginning and 74.0MB in the end (delta: 35.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.55ms. Allocated memory is still 142.6MB. Free memory was 74.0MB in the beginning and 68.6MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 118.86ms. Allocated memory is still 142.6MB. Free memory was 68.6MB in the beginning and 61.2MB in the end (delta: 7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 4712.40ms. Allocated memory is still 142.6MB. Free memory was 60.2MB in the beginning and 54.4MB in the end (delta: 5.8MB). Peak memory consumption was 36.1MB. Max. memory is 16.1GB. * TraceAbstraction took 19144.53ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 54.1MB in the beginning and 160.8MB in the end (delta: -106.7MB). Peak memory consumption was 151.4MB. Max. memory is 16.1GB. * Witness Printer took 109.03ms. Allocated memory is still 343.9MB. Free memory was 160.8MB in the beginning and 148.1MB in the end (delta: 12.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#4.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#4.offset,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#4.offset,GLOBAL]],[IdentifierExpression[~#__CS_thread~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#4.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#4.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#4.base,GLOBAL],[IdentifierExpression[~#__CS_thread~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#4.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#4.base,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#4.base,GLOBAL]],[IdentifierExpression[~#__CS_thread~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#4.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#4.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#4.base,GLOBAL],[IdentifierExpression[~#__CS_thread~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#4.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#4.base,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#4.base,GLOBAL]],[IdentifierExpression[~#__CS_thread~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#4.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#4.base,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#4.base,GLOBAL]],[IdentifierExpression[~#__CS_thread~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#4.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#4.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#4.base,GLOBAL],[IdentifierExpression[~#__CS_thread~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#4.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#4.base,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#4.base,GLOBAL]],[IdentifierExpression[~#__CS_thread~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#4.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#4.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#4.base,GLOBAL],[IdentifierExpression[~#__CS_thread~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#4.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#4.base,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#4.base,GLOBAL]],[IdentifierExpression[~#__CS_thread~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#4.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#4.offset,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#4.offset,GLOBAL]],[IdentifierExpression[~#__CS_thread~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#4.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#4.base,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#4.base,GLOBAL]],[IdentifierExpression[~#__CS_thread~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#4.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#4.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#4.offset,GLOBAL],[IdentifierExpression[~#__CS_thread~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~#fp!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~#fp!base * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 775]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 179 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 17.4s, OverallIterations: 6, TraceHistogramMax: 32, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 12.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3 mSolverCounterUnknown, 381 SdHoareTripleChecker+Valid, 12.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 369 mSDsluCounter, 1620 SdHoareTripleChecker+Invalid, 12.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 853 mSDsCounter, 32 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 128 IncrementalHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 32 mSolverCounterUnsat, 767 mSDtfsCounter, 128 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 488 GetRequests, 465 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=201occurred in iteration=5, InterpolantAutomatonStates: 27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 7 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 1368 NumberOfCodeBlocks, 1368 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1542 ConstructedInterpolants, 0 QuantifiedInterpolants, 2085 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1836 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 9 InterpolantComputations, 5 PerfectInterpolantSequences, 8128/8157 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1011]: Location Invariant Derived location invariant: ((__CS_error == 0) && (0 == \old(__CS_error))) - InvariantResult [Line: 1036]: Location Invariant Derived location invariant: (0 == \old(__CS_error)) RESULT: Ultimate proved your program to be correct! [2025-02-07 21:25:55,880 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE