./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/seq-pthread/cs_lazy.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows 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_lazy.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-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 ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b26873cfd586f35040b8fa56225beaa479db089ab89500d17d6395862bf9072f --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 10:06:41,846 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 10:06:41,916 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-08 10:06:41,921 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 10:06:41,922 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 10:06:41,949 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 10:06:41,950 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 10:06:41,950 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 10:06:41,951 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 10:06:41,951 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 10:06:41,951 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 10:06:41,951 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 10:06:41,951 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 10:06:41,951 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 10:06:41,951 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 10:06:41,951 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 10:06:41,951 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 10:06:41,952 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 10:06:41,952 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 10:06:41,952 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 10:06:41,952 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 10:06:41,952 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 10:06:41,952 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 10:06:41,952 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 10:06:41,952 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 10:06:41,952 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 10:06:41,952 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 10:06:41,952 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 10:06:41,952 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 10:06:41,954 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 10:06:41,955 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 10:06:41,955 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 10:06:41,955 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 10:06:41,955 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 10:06:41,955 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 10:06:41,955 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 10:06:41,956 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 10:06:41,956 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 10:06:41,956 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 10:06:41,956 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 10:06:41,956 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 10:06:41,956 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 10:06:41,956 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 10:06:41,956 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 10:06:41,957 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 10:06:41,957 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 ! overflow) ) 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 -> b26873cfd586f35040b8fa56225beaa479db089ab89500d17d6395862bf9072f [2025-02-08 10:06:42,187 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 10:06:42,197 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 10:06:42,199 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 10:06:42,200 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 10:06:42,200 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 10:06:42,202 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-pthread/cs_lazy.i [2025-02-08 10:06:43,445 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5863b28de/61f72a4674e343d490084c70e92b0481/FLAG4c20d3fe1 [2025-02-08 10:06:43,874 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 10:06:43,875 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_lazy.i [2025-02-08 10:06:43,888 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5863b28de/61f72a4674e343d490084c70e92b0481/FLAG4c20d3fe1 [2025-02-08 10:06:44,061 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5863b28de/61f72a4674e343d490084c70e92b0481 [2025-02-08 10:06:44,063 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 10:06:44,065 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 10:06:44,067 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 10:06:44,067 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 10:06:44,072 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 10:06:44,072 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 10:06:44" (1/1) ... [2025-02-08 10:06:44,073 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c2bb789 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:06:44, skipping insertion in model container [2025-02-08 10:06:44,074 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 10:06:44" (1/1) ... [2025-02-08 10:06:44,114 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 10:06:44,530 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 10:06:44,551 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 10:06:44,657 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 10:06:44,700 INFO L204 MainTranslator]: Completed translation [2025-02-08 10:06:44,700 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:06:44 WrapperNode [2025-02-08 10:06:44,701 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 10:06:44,701 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 10:06:44,701 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 10:06:44,702 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 10:06:44,706 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:06:44" (1/1) ... [2025-02-08 10:06:44,724 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:06:44" (1/1) ... [2025-02-08 10:06:44,757 INFO L138 Inliner]: procedures = 145, calls = 224, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 533 [2025-02-08 10:06:44,757 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 10:06:44,758 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 10:06:44,758 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 10:06:44,758 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 10:06:44,767 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:06:44" (1/1) ... [2025-02-08 10:06:44,768 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:06:44" (1/1) ... [2025-02-08 10:06:44,780 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:06:44" (1/1) ... [2025-02-08 10:06:44,815 INFO L175 MemorySlicer]: Split 119 memory accesses to 14 slices as follows [2, 9, 10, 10, 10, 25, 16, 3, 9, 5, 9, 8, 3, 0]. 21 percent of accesses are in the largest equivalence class. The 34 initializations are split as follows [2, 0, 4, 4, 4, 8, 8, 0, 2, 0, 0, 2, 0, 0]. The 32 writes are split as follows [0, 1, 2, 2, 2, 10, 4, 1, 3, 2, 1, 3, 1, 0]. [2025-02-08 10:06:44,816 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:06:44" (1/1) ... [2025-02-08 10:06:44,816 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:06:44" (1/1) ... [2025-02-08 10:06:44,843 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:06:44" (1/1) ... [2025-02-08 10:06:44,846 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:06:44" (1/1) ... [2025-02-08 10:06:44,854 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:06:44" (1/1) ... [2025-02-08 10:06:44,860 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:06:44" (1/1) ... [2025-02-08 10:06:44,875 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 10:06:44,879 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 10:06:44,879 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 10:06:44,879 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 10:06:44,880 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:06:44" (1/1) ... [2025-02-08 10:06:44,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 10:06:44,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 10:06:44,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-08 10:06:44,920 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-08 10:06:44,941 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 10:06:44,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 10:06:44,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 10:06:44,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-08 10:06:44,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-08 10:06:44,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-08 10:06:44,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-02-08 10:06:44,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-02-08 10:06:44,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-02-08 10:06:44,943 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-02-08 10:06:44,943 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-02-08 10:06:44,943 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-02-08 10:06:44,943 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-02-08 10:06:44,943 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-02-08 10:06:44,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 10:06:44,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 10:06:44,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 10:06:44,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-08 10:06:44,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-08 10:06:44,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-08 10:06:44,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-02-08 10:06:44,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-02-08 10:06:44,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-02-08 10:06:44,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-02-08 10:06:44,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-02-08 10:06:44,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-02-08 10:06:44,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-02-08 10:06:44,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-02-08 10:06:44,945 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 10:06:44,945 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 10:06:44,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 10:06:44,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 10:06:44,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-08 10:06:44,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-02-08 10:06:44,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-02-08 10:06:44,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-02-08 10:06:44,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-02-08 10:06:44,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-02-08 10:06:44,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-02-08 10:06:44,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-02-08 10:06:44,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-02-08 10:06:44,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-02-08 10:06:44,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-02-08 10:06:44,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-02-08 10:06:44,946 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_lock [2025-02-08 10:06:44,946 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_lock [2025-02-08 10:06:44,946 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2025-02-08 10:06:44,946 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2025-02-08 10:06:44,947 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 10:06:44,947 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 10:06:44,947 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-08 10:06:44,947 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-08 10:06:44,947 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-02-08 10:06:44,947 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-02-08 10:06:44,947 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-02-08 10:06:44,947 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-02-08 10:06:44,947 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-02-08 10:06:44,947 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-02-08 10:06:44,948 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-02-08 10:06:44,948 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-02-08 10:06:44,948 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-02-08 10:06:44,948 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-02-08 10:06:44,948 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2025-02-08 10:06:44,948 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2025-02-08 10:06:44,948 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-02-08 10:06:44,948 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-02-08 10:06:44,948 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 10:06:44,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-08 10:06:44,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-08 10:06:44,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-08 10:06:44,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-02-08 10:06:44,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-02-08 10:06:44,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-02-08 10:06:44,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-02-08 10:06:44,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-02-08 10:06:44,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-02-08 10:06:44,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-02-08 10:06:44,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-02-08 10:06:44,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-02-08 10:06:44,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-02-08 10:06:44,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-02-08 10:06:44,949 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2025-02-08 10:06:44,949 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2025-02-08 10:06:44,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 10:06:44,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 10:06:44,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 10:06:44,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-08 10:06:44,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-08 10:06:44,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-08 10:06:44,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-08 10:06:44,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-08 10:06:44,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-02-08 10:06:44,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-02-08 10:06:44,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-02-08 10:06:44,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-02-08 10:06:44,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-02-08 10:06:44,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-02-08 10:06:44,950 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_unlock [2025-02-08 10:06:44,950 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_unlock [2025-02-08 10:06:44,950 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 10:06:44,950 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 10:06:45,185 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 10:06:45,187 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 10:06:45,601 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L737-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_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t3~0#1.base, main_thread_~#t3~0#1.offset);havoc main_thread_~#t3~0#1.base, main_thread_~#t3~0#1.offset; [2025-02-08 10:06:45,601 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L737-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~mem39#1 := read~int#9(main_thread_~#t3~0#1.base, main_thread_~#t3~0#1.offset, 1); [2025-02-08 10:06:45,602 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L737-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-08 10:06:45,602 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L729-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_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t3~0#1.base, main_thread_~#t3~0#1.offset);havoc main_thread_~#t3~0#1.base, main_thread_~#t3~0#1.offset; [2025-02-08 10:06:45,602 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L729-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-08 10:06:45,602 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L729-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-08 10:06:45,602 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L738: assume -2147483648 <= main_thread_#t~ret40#1 && main_thread_#t~ret40#1 <= 2147483647;havoc main_thread_#t~mem39#1;havoc main_thread_#t~ret40#1; [2025-02-08 10:06:45,602 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L738-1: SUMMARY for call main_thread_#t~ret40#1 := __CS_pthread_join(main_thread_#t~mem39#1, 0, 0); srcloc: null [2025-02-08 10:06:45,602 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L730: assume -2147483648 <= main_thread_#t~ret33#1 && main_thread_#t~ret33#1 <= 2147483647;havoc main_thread_#t~ret33#1; [2025-02-08 10:06:45,602 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L730-1: SUMMARY for call main_thread_#t~ret33#1 := __CS_pthread_create(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset, 0, 0, #funAddr~thread2.base, #funAddr~thread2.offset, 0, 0); srcloc: null [2025-02-08 10:06:45,602 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L714-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);thread3_#res#1.base, thread3_#res#1.offset := 0, 0; [2025-02-08 10:06:45,602 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L714-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-08 10:06:45,602 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L714-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-08 10:06:45,602 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L739-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_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t3~0#1.base, main_thread_~#t3~0#1.offset);havoc main_thread_~#t3~0#1.base, main_thread_~#t3~0#1.offset; [2025-02-08 10:06:45,602 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L739-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_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t3~0#1.base, main_thread_~#t3~0#1.offset);havoc main_thread_~#t3~0#1.base, main_thread_~#t3~0#1.offset;#t~ret104#1.base, #t~ret104#1.offset := main_thread_#res#1.base, main_thread_#res#1.offset;havoc main_thread_#t~ret31#1, main_thread_#t~ret32#1, main_thread_#t~ret33#1, main_thread_#t~ret34#1, main_thread_#t~mem35#1, main_thread_#t~ret36#1, main_thread_#t~mem37#1, main_thread_#t~ret38#1, main_thread_#t~mem39#1, main_thread_#t~ret40#1, main_thread_~arg#1.base, main_thread_~arg#1.offset, main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset, main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset, main_thread_~#t3~0#1.base, main_thread_~#t3~0#1.offset;havoc main_thread_#in~arg#1.base, main_thread_#in~arg#1.offset;assume { :end_inline_main_thread } true;#t~funptrres100#1.base, #t~funptrres100#1.offset := #t~ret104#1.base, #t~ret104#1.offset; [2025-02-08 10:06:45,602 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L739-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-08 10:06:45,603 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L731-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_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t3~0#1.base, main_thread_~#t3~0#1.offset);havoc main_thread_~#t3~0#1.base, main_thread_~#t3~0#1.offset; [2025-02-08 10:06:45,603 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L731-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-08 10:06:45,603 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L731-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-08 10:06:45,603 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L723: main_thread_#t~ret31#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~ret31#1 && main_thread_#t~ret31#1 <= 2147483647;havoc main_thread_#t~ret31#1;call main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset := #Ultimate.allocOnStack(1);call main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset := #Ultimate.allocOnStack(1);call main_thread_~#t3~0#1.base, main_thread_~#t3~0#1.offset := #Ultimate.allocOnStack(1); [2025-02-08 10:06:45,603 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L732: assume -2147483648 <= main_thread_#t~ret34#1 && main_thread_#t~ret34#1 <= 2147483647;havoc main_thread_#t~ret34#1; [2025-02-08 10:06:45,603 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L732-1: SUMMARY for call main_thread_#t~ret34#1 := __CS_pthread_create(main_thread_~#t3~0#1.base, main_thread_~#t3~0#1.offset, 0, 0, #funAddr~thread3.base, #funAddr~thread3.offset, 0, 0); srcloc: null [2025-02-08 10:06:45,603 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L733-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_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t3~0#1.base, main_thread_~#t3~0#1.offset);havoc main_thread_~#t3~0#1.base, main_thread_~#t3~0#1.offset; [2025-02-08 10:06:45,603 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L733-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~mem35#1 := read~int#9(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset, 1); [2025-02-08 10:06:45,603 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L733-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-08 10:06:45,603 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L734: assume -2147483648 <= main_thread_#t~ret36#1 && main_thread_#t~ret36#1 <= 2147483647;havoc main_thread_#t~mem35#1;havoc main_thread_#t~ret36#1; [2025-02-08 10:06:45,603 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L734-1: SUMMARY for call main_thread_#t~ret36#1 := __CS_pthread_join(main_thread_#t~mem35#1, 0, 0); srcloc: null [2025-02-08 10:06:45,603 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L710-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);thread3_#res#1.base, thread3_#res#1.offset := 0, 0; [2025-02-08 10:06:45,603 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L710-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-08 10:06:45,603 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L710-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-08 10:06:45,603 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L735-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_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t3~0#1.base, main_thread_~#t3~0#1.offset);havoc main_thread_~#t3~0#1.base, main_thread_~#t3~0#1.offset; [2025-02-08 10:06:45,603 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L735-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~mem37#1 := read~int#9(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset, 1); [2025-02-08 10:06:45,604 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L735-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-08 10:06:45,604 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L727-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_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t3~0#1.base, main_thread_~#t3~0#1.offset);havoc main_thread_~#t3~0#1.base, main_thread_~#t3~0#1.offset; [2025-02-08 10:06:45,604 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L727-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-08 10:06:45,604 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L727-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-08 10:06:45,604 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L736: assume -2147483648 <= main_thread_#t~ret38#1 && main_thread_#t~ret38#1 <= 2147483647;havoc main_thread_#t~mem37#1;havoc main_thread_#t~ret38#1; [2025-02-08 10:06:45,604 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L736-1: SUMMARY for call main_thread_#t~ret38#1 := __CS_pthread_join(main_thread_#t~mem37#1, 0, 0); srcloc: null [2025-02-08 10:06:45,604 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L728: assume -2147483648 <= main_thread_#t~ret32#1 && main_thread_#t~ret32#1 <= 2147483647;havoc main_thread_#t~ret32#1; [2025-02-08 10:06:45,604 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L728-1: SUMMARY for call main_thread_#t~ret32#1 := __CS_pthread_create(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset, 0, 0, #funAddr~thread1.base, #funAddr~thread1.offset, 0, 0); srcloc: null [2025-02-08 10:06:45,604 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L712-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);thread3_#res#1.base, thread3_#res#1.offset := 0, 0; [2025-02-08 10:06:45,604 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L712-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-08 10:06:45,604 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L712-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-08 10:06:46,052 INFO L? ?]: Removed 127 outVars from TransFormulas that were not future-live. [2025-02-08 10:06:46,053 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 10:06:46,068 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 10:06:46,068 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 10:06:46,069 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 10:06:46 BoogieIcfgContainer [2025-02-08 10:06:46,069 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 10:06:46,071 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 10:06:46,071 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 10:06:46,075 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 10:06:46,075 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 10:06:44" (1/3) ... [2025-02-08 10:06:46,075 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@175dee09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 10:06:46, skipping insertion in model container [2025-02-08 10:06:46,076 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:06:44" (2/3) ... [2025-02-08 10:06:46,076 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@175dee09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 10:06:46, skipping insertion in model container [2025-02-08 10:06:46,076 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 10:06:46" (3/3) ... [2025-02-08 10:06:46,077 INFO L128 eAbstractionObserver]: Analyzing ICFG cs_lazy.i [2025-02-08 10:06:46,093 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 10:06:46,095 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cs_lazy.i that has 7 procedures, 159 locations, 1 initial locations, 2 loop locations, and 16 error locations. [2025-02-08 10:06:46,153 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 10:06:46,164 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;@1627ac64, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 10:06:46,164 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-02-08 10:06:46,168 INFO L276 IsEmpty]: Start isEmpty. Operand has 146 states, 96 states have (on average 1.6145833333333333) internal successors, (155), 117 states have internal predecessors, (155), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-08 10:06:46,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-08 10:06:46,174 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:06:46,174 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-08 10:06:46,175 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-08 10:06:46,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:06:46,180 INFO L85 PathProgramCache]: Analyzing trace with hash 10157535, now seen corresponding path program 1 times [2025-02-08 10:06:46,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:06:46,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402049624] [2025-02-08 10:06:46,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:06:46,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:06:46,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 10:06:46,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 10:06:46,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:06:46,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:06:46,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:06:46,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:06:46,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402049624] [2025-02-08 10:06:46,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402049624] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:06:46,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:06:46,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 10:06:46,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662236403] [2025-02-08 10:06:46,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:06:46,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 10:06:46,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:06:46,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 10:06:46,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 10:06:46,567 INFO L87 Difference]: Start difference. First operand has 146 states, 96 states have (on average 1.6145833333333333) internal successors, (155), 117 states have internal predecessors, (155), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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-08 10:06:46,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:06:46,674 INFO L93 Difference]: Finished difference Result 285 states and 428 transitions. [2025-02-08 10:06:46,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 10:06:46,676 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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) Word has length 4 [2025-02-08 10:06:46,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:06:46,683 INFO L225 Difference]: With dead ends: 285 [2025-02-08 10:06:46,683 INFO L226 Difference]: Without dead ends: 103 [2025-02-08 10:06:46,688 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 10:06:46,691 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 2 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 10:06:46,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 350 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 10:06:46,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-02-08 10:06:46,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2025-02-08 10:06:46,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 69 states have (on average 1.289855072463768) internal successors, (89), 77 states have internal predecessors, (89), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-02-08 10:06:46,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 132 transitions. [2025-02-08 10:06:46,732 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 132 transitions. Word has length 4 [2025-02-08 10:06:46,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:06:46,733 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 132 transitions. [2025-02-08 10:06:46,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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-08 10:06:46,734 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 132 transitions. [2025-02-08 10:06:46,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-08 10:06:46,734 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:06:46,734 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:06:46,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 10:06:46,735 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-08 10:06:46,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:06:46,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1960443143, now seen corresponding path program 1 times [2025-02-08 10:06:46,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:06:46,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556567795] [2025-02-08 10:06:46,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:06:46,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:06:46,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 10:06:46,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 10:06:46,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:06:46,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:06:46,943 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:06:46,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:06:46,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556567795] [2025-02-08 10:06:46,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556567795] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 10:06:46,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1453867503] [2025-02-08 10:06:46,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:06:46,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:06:46,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 10:06:46,948 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-08 10:06:46,950 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-08 10:06:47,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 10:06:47,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 10:06:47,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:06:47,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:06:47,218 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 10:06:47,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 10:06:47,253 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 10:06:47,254 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 10:06:47,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1453867503] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:06:47,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 10:06:47,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [4] total 5 [2025-02-08 10:06:47,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526811670] [2025-02-08 10:06:47,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:06:47,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 10:06:47,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:06:47,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 10:06:47,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 10:06:47,258 INFO L87 Difference]: Start difference. First operand 103 states and 132 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-08 10:06:47,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:06:47,486 INFO L93 Difference]: Finished difference Result 103 states and 132 transitions. [2025-02-08 10:06:47,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 10:06:47,487 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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) Word has length 7 [2025-02-08 10:06:47,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:06:47,489 INFO L225 Difference]: With dead ends: 103 [2025-02-08 10:06:47,490 INFO L226 Difference]: Without dead ends: 102 [2025-02-08 10:06:47,490 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 10:06:47,491 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 3 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 10:06:47,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 237 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 10:06:47,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-02-08 10:06:47,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2025-02-08 10:06:47,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 69 states have (on average 1.2753623188405796) internal successors, (88), 76 states have internal predecessors, (88), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-02-08 10:06:47,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 131 transitions. [2025-02-08 10:06:47,502 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 131 transitions. Word has length 7 [2025-02-08 10:06:47,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:06:47,502 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 131 transitions. [2025-02-08 10:06:47,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-08 10:06:47,502 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 131 transitions. [2025-02-08 10:06:47,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-08 10:06:47,503 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:06:47,503 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-02-08 10:06:47,513 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 10:06:47,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:06:47,704 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-08 10:06:47,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:06:47,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1960443303, now seen corresponding path program 1 times [2025-02-08 10:06:47,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:06:47,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444963112] [2025-02-08 10:06:47,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:06:47,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:06:47,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 10:06:47,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 10:06:47,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:06:47,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:06:47,858 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:06:47,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:06:47,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444963112] [2025-02-08 10:06:47,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444963112] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 10:06:47,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2034827628] [2025-02-08 10:06:47,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:06:47,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:06:47,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 10:06:47,861 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-08 10:06:47,865 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-08 10:06:48,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 10:06:48,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 10:06:48,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:06:48,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:06:48,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 10:06:48,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 10:06:48,091 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:06:48,091 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 10:06:48,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2034827628] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:06:48,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 10:06:48,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-02-08 10:06:48,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973441904] [2025-02-08 10:06:48,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:06:48,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 10:06:48,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:06:48,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 10:06:48,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 10:06:48,093 INFO L87 Difference]: Start difference. First operand 102 states and 131 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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-08 10:06:48,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:06:48,162 INFO L93 Difference]: Finished difference Result 102 states and 131 transitions. [2025-02-08 10:06:48,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 10:06:48,163 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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) Word has length 7 [2025-02-08 10:06:48,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:06:48,164 INFO L225 Difference]: With dead ends: 102 [2025-02-08 10:06:48,164 INFO L226 Difference]: Without dead ends: 101 [2025-02-08 10:06:48,165 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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-08 10:06:48,165 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 1 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 10:06:48,166 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 362 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 10:06:48,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-02-08 10:06:48,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2025-02-08 10:06:48,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 69 states have (on average 1.2608695652173914) internal successors, (87), 75 states have internal predecessors, (87), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-02-08 10:06:48,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 130 transitions. [2025-02-08 10:06:48,180 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 130 transitions. Word has length 7 [2025-02-08 10:06:48,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:06:48,180 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 130 transitions. [2025-02-08 10:06:48,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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-08 10:06:48,181 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 130 transitions. [2025-02-08 10:06:48,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-08 10:06:48,181 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:06:48,181 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:06:48,192 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 10:06:48,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:06:48,382 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-08 10:06:48,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:06:48,383 INFO L85 PathProgramCache]: Analyzing trace with hash 644195548, now seen corresponding path program 1 times [2025-02-08 10:06:48,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:06:48,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023301897] [2025-02-08 10:06:48,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:06:48,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:06:48,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 10:06:48,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 10:06:48,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:06:48,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:06:48,503 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:06:48,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:06:48,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023301897] [2025-02-08 10:06:48,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023301897] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 10:06:48,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [579422488] [2025-02-08 10:06:48,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:06:48,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:06:48,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 10:06:48,506 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 10:06:48,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 10:06:48,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 10:06:48,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 10:06:48,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:06:48,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:06:48,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 10:06:48,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 10:06:48,748 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 10:06:48,748 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 10:06:48,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [579422488] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:06:48,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 10:06:48,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [4] total 5 [2025-02-08 10:06:48,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045409230] [2025-02-08 10:06:48,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:06:48,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 10:06:48,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:06:48,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 10:06:48,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 10:06:48,751 INFO L87 Difference]: Start difference. First operand 101 states and 130 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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-08 10:06:48,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:06:48,867 INFO L93 Difference]: Finished difference Result 201 states and 259 transitions. [2025-02-08 10:06:48,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 10:06:48,868 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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) Word has length 8 [2025-02-08 10:06:48,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:06:48,870 INFO L225 Difference]: With dead ends: 201 [2025-02-08 10:06:48,870 INFO L226 Difference]: Without dead ends: 111 [2025-02-08 10:06:48,871 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 10:06:48,871 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 1 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 10:06:48,872 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 241 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 10:06:48,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-02-08 10:06:48,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2025-02-08 10:06:48,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 78 states have (on average 1.2564102564102564) internal successors, (98), 84 states have internal predecessors, (98), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-02-08 10:06:48,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 141 transitions. [2025-02-08 10:06:48,883 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 141 transitions. Word has length 8 [2025-02-08 10:06:48,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:06:48,884 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 141 transitions. [2025-02-08 10:06:48,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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-08 10:06:48,884 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 141 transitions. [2025-02-08 10:06:48,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-08 10:06:48,884 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:06:48,884 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2025-02-08 10:06:48,894 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-08 10:06:49,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:06:49,089 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-08 10:06:49,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:06:49,089 INFO L85 PathProgramCache]: Analyzing trace with hash 644200513, now seen corresponding path program 1 times [2025-02-08 10:06:49,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:06:49,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782040656] [2025-02-08 10:06:49,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:06:49,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:06:49,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 10:06:49,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 10:06:49,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:06:49,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:06:49,155 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 10:06:49,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:06:49,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782040656] [2025-02-08 10:06:49,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782040656] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:06:49,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:06:49,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 10:06:49,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940648293] [2025-02-08 10:06:49,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:06:49,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 10:06:49,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:06:49,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 10:06:49,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 10:06:49,157 INFO L87 Difference]: Start difference. First operand 110 states and 141 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-08 10:06:49,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:06:49,185 INFO L93 Difference]: Finished difference Result 110 states and 141 transitions. [2025-02-08 10:06:49,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 10:06:49,186 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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) Word has length 8 [2025-02-08 10:06:49,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:06:49,187 INFO L225 Difference]: With dead ends: 110 [2025-02-08 10:06:49,187 INFO L226 Difference]: Without dead ends: 109 [2025-02-08 10:06:49,188 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 10:06:49,189 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 0 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 10:06:49,189 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 243 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 10:06:49,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-02-08 10:06:49,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 105. [2025-02-08 10:06:49,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 74 states have (on average 1.2432432432432432) internal successors, (92), 79 states have internal predecessors, (92), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-02-08 10:06:49,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 135 transitions. [2025-02-08 10:06:49,197 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 135 transitions. Word has length 8 [2025-02-08 10:06:49,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:06:49,198 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 135 transitions. [2025-02-08 10:06:49,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-08 10:06:49,198 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 135 transitions. [2025-02-08 10:06:49,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-08 10:06:49,198 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:06:49,199 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1] [2025-02-08 10:06:49,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 10:06:49,199 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-08 10:06:49,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:06:49,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1029972148, now seen corresponding path program 1 times [2025-02-08 10:06:49,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:06:49,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096117699] [2025-02-08 10:06:49,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:06:49,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:06:49,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 10:06:49,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 10:06:49,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:06:49,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:06:49,306 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 10:06:49,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:06:49,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096117699] [2025-02-08 10:06:49,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096117699] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 10:06:49,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2118935972] [2025-02-08 10:06:49,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:06:49,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:06:49,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 10:06:49,308 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 10:06:49,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 10:06:49,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 10:06:49,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 10:06:49,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:06:49,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:06:49,523 INFO L256 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 10:06:49,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 10:06:49,548 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 10:06:49,549 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 10:06:49,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2118935972] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:06:49,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 10:06:49,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-02-08 10:06:49,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471491077] [2025-02-08 10:06:49,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:06:49,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 10:06:49,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:06:49,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 10:06:49,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 10:06:49,551 INFO L87 Difference]: Start difference. First operand 105 states and 135 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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-08 10:06:49,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:06:49,704 INFO L93 Difference]: Finished difference Result 105 states and 135 transitions. [2025-02-08 10:06:49,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 10:06:49,719 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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) Word has length 15 [2025-02-08 10:06:49,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:06:49,721 INFO L225 Difference]: With dead ends: 105 [2025-02-08 10:06:49,721 INFO L226 Difference]: Without dead ends: 104 [2025-02-08 10:06:49,721 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 10:06:49,722 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 10:06:49,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 236 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 10:06:49,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-02-08 10:06:49,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 98. [2025-02-08 10:06:49,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 68 states have (on average 1.2352941176470589) internal successors, (84), 72 states have internal predecessors, (84), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-02-08 10:06:49,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 127 transitions. [2025-02-08 10:06:49,733 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 127 transitions. Word has length 15 [2025-02-08 10:06:49,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:06:49,733 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 127 transitions. [2025-02-08 10:06:49,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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-08 10:06:49,734 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 127 transitions. [2025-02-08 10:06:49,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-02-08 10:06:49,735 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:06:49,735 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:06:49,756 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-08 10:06:49,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-02-08 10:06:49,936 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ##fun~$Pointer$~TO~$Pointer$Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-08 10:06:49,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:06:49,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1053511464, now seen corresponding path program 1 times [2025-02-08 10:06:49,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:06:49,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446469609] [2025-02-08 10:06:49,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:06:49,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:06:49,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-08 10:06:49,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-08 10:06:49,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:06:49,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:06:50,128 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-08 10:06:50,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:06:50,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446469609] [2025-02-08 10:06:50,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446469609] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 10:06:50,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [160055250] [2025-02-08 10:06:50,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:06:50,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:06:50,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 10:06:50,132 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 10:06:50,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-08 10:06:50,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-08 10:06:50,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-08 10:06:50,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:06:50,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:06:50,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 631 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 10:06:50,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 10:06:50,440 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-08 10:06:50,444 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 10:06:50,497 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-08 10:06:50,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [160055250] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 10:06:50,498 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 10:06:50,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-08 10:06:50,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587102214] [2025-02-08 10:06:50,498 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 10:06:50,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 10:06:50,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:06:50,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 10:06:50,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 10:06:50,500 INFO L87 Difference]: Start difference. First operand 98 states and 127 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-02-08 10:06:50,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:06:50,575 INFO L93 Difference]: Finished difference Result 203 states and 264 transitions. [2025-02-08 10:06:50,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 10:06:50,577 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 42 [2025-02-08 10:06:50,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:06:50,579 INFO L225 Difference]: With dead ends: 203 [2025-02-08 10:06:50,579 INFO L226 Difference]: Without dead ends: 107 [2025-02-08 10:06:50,579 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 81 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-08 10:06:50,580 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 4 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 10:06:50,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 598 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 10:06:50,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-02-08 10:06:50,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2025-02-08 10:06:50,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 77 states have (on average 1.2077922077922079) internal successors, (93), 81 states have internal predecessors, (93), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-02-08 10:06:50,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 136 transitions. [2025-02-08 10:06:50,597 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 136 transitions. Word has length 42 [2025-02-08 10:06:50,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:06:50,597 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 136 transitions. [2025-02-08 10:06:50,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-02-08 10:06:50,598 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 136 transitions. [2025-02-08 10:06:50,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-08 10:06:50,602 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:06:50,602 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:06:50,611 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-08 10:06:50,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:06:50,806 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ##fun~$Pointer$~TO~$Pointer$Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-08 10:06:50,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:06:50,806 INFO L85 PathProgramCache]: Analyzing trace with hash 568033299, now seen corresponding path program 1 times [2025-02-08 10:06:50,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:06:50,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161029558] [2025-02-08 10:06:50,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:06:50,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:06:50,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-08 10:06:50,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-08 10:06:50,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:06:50,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:06:51,039 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-08 10:06:51,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:06:51,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161029558] [2025-02-08 10:06:51,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161029558] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 10:06:51,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [898553215] [2025-02-08 10:06:51,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:06:51,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:06:51,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 10:06:51,042 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 10:06:51,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-08 10:06:51,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-08 10:06:51,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-08 10:06:51,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:06:51,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:06:51,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 727 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 10:06:51,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 10:06:51,421 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-08 10:06:51,421 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 10:06:51,479 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-08 10:06:51,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [898553215] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 10:06:51,480 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 10:06:51,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 5 [2025-02-08 10:06:51,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135364016] [2025-02-08 10:06:51,480 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 10:06:51,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 10:06:51,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:06:51,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 10:06:51,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-08 10:06:51,481 INFO L87 Difference]: Start difference. First operand 107 states and 136 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-02-08 10:06:51,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:06:51,758 INFO L93 Difference]: Finished difference Result 212 states and 270 transitions. [2025-02-08 10:06:51,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 10:06:51,759 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 57 [2025-02-08 10:06:51,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:06:51,761 INFO L225 Difference]: With dead ends: 212 [2025-02-08 10:06:51,761 INFO L226 Difference]: Without dead ends: 123 [2025-02-08 10:06:51,762 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 111 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-08 10:06:51,762 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 6 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 10:06:51,763 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 238 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 10:06:51,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-02-08 10:06:51,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2025-02-08 10:06:51,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 93 states have (on average 1.1827956989247312) internal successors, (110), 97 states have internal predecessors, (110), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-02-08 10:06:51,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 153 transitions. [2025-02-08 10:06:51,779 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 153 transitions. Word has length 57 [2025-02-08 10:06:51,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:06:51,779 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 153 transitions. [2025-02-08 10:06:51,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-02-08 10:06:51,780 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 153 transitions. [2025-02-08 10:06:51,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-02-08 10:06:51,784 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:06:51,784 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:06:51,797 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-08 10:06:51,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-02-08 10:06:51,986 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ##fun~$Pointer$~TO~$Pointer$Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-08 10:06:51,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:06:51,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1523578922, now seen corresponding path program 1 times [2025-02-08 10:06:51,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:06:51,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120180743] [2025-02-08 10:06:51,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:06:51,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:06:52,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-08 10:06:52,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-08 10:06:52,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:06:52,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:06:52,730 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-02-08 10:06:52,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:06:52,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120180743] [2025-02-08 10:06:52,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120180743] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:06:52,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:06:52,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 10:06:52,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961971729] [2025-02-08 10:06:52,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:06:52,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 10:06:52,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:06:52,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 10:06:52,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 10:06:52,732 INFO L87 Difference]: Start difference. First operand 123 states and 153 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 10:06:53,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:06:53,026 INFO L93 Difference]: Finished difference Result 198 states and 246 transitions. [2025-02-08 10:06:53,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 10:06:53,027 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 71 [2025-02-08 10:06:53,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:06:53,029 INFO L225 Difference]: With dead ends: 198 [2025-02-08 10:06:53,029 INFO L226 Difference]: Without dead ends: 120 [2025-02-08 10:06:53,030 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-08 10:06:53,031 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 107 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 10:06:53,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 227 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 10:06:53,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-02-08 10:06:53,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2025-02-08 10:06:53,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 91 states have (on average 1.164835164835165) internal successors, (106), 95 states have internal predecessors, (106), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-08 10:06:53,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 147 transitions. [2025-02-08 10:06:53,050 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 147 transitions. Word has length 71 [2025-02-08 10:06:53,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:06:53,050 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 147 transitions. [2025-02-08 10:06:53,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 10:06:53,050 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 147 transitions. [2025-02-08 10:06:53,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-02-08 10:06:53,052 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:06:53,052 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:06:53,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 10:06:53,052 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ##fun~$Pointer$~TO~$Pointer$Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-08 10:06:53,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:06:53,053 INFO L85 PathProgramCache]: Analyzing trace with hash 178082793, now seen corresponding path program 1 times [2025-02-08 10:06:53,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:06:53,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736113859] [2025-02-08 10:06:53,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:06:53,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:06:53,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-08 10:06:53,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-08 10:06:53,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:06:53,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:06:53,551 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-02-08 10:06:53,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:06:53,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736113859] [2025-02-08 10:06:53,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736113859] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:06:53,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:06:53,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 10:06:53,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187543646] [2025-02-08 10:06:53,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:06:53,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 10:06:53,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:06:53,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 10:06:53,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 10:06:53,553 INFO L87 Difference]: Start difference. First operand 120 states and 147 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 10:06:54,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:06:54,034 INFO L93 Difference]: Finished difference Result 197 states and 242 transitions. [2025-02-08 10:06:54,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 10:06:54,035 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 69 [2025-02-08 10:06:54,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:06:54,036 INFO L225 Difference]: With dead ends: 197 [2025-02-08 10:06:54,036 INFO L226 Difference]: Without dead ends: 117 [2025-02-08 10:06:54,036 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-08 10:06:54,037 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 103 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 10:06:54,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 215 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 10:06:54,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-02-08 10:06:54,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2025-02-08 10:06:54,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 89 states have (on average 1.146067415730337) internal successors, (102), 93 states have internal predecessors, (102), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-02-08 10:06:54,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 141 transitions. [2025-02-08 10:06:54,051 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 141 transitions. Word has length 69 [2025-02-08 10:06:54,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:06:54,052 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 141 transitions. [2025-02-08 10:06:54,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 10:06:54,052 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 141 transitions. [2025-02-08 10:06:54,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-02-08 10:06:54,053 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:06:54,053 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:06:54,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 10:06:54,054 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ##fun~$Pointer$~TO~$Pointer$Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-08 10:06:54,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:06:54,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1241180213, now seen corresponding path program 2 times [2025-02-08 10:06:54,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:06:54,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964179639] [2025-02-08 10:06:54,055 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 10:06:54,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:06:54,112 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 73 statements into 2 equivalence classes. [2025-02-08 10:06:54,129 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 73 statements. [2025-02-08 10:06:54,130 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 10:06:54,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:06:54,284 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-02-08 10:06:54,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:06:54,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964179639] [2025-02-08 10:06:54,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964179639] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:06:54,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:06:54,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 10:06:54,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735398667] [2025-02-08 10:06:54,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:06:54,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 10:06:54,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:06:54,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 10:06:54,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 10:06:54,285 INFO L87 Difference]: Start difference. First operand 117 states and 141 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 10:06:54,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:06:54,787 INFO L93 Difference]: Finished difference Result 189 states and 231 transitions. [2025-02-08 10:06:54,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 10:06:54,787 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 73 [2025-02-08 10:06:54,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:06:54,788 INFO L225 Difference]: With dead ends: 189 [2025-02-08 10:06:54,788 INFO L226 Difference]: Without dead ends: 74 [2025-02-08 10:06:54,788 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-08 10:06:54,788 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 97 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 10:06:54,789 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 213 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 10:06:54,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-02-08 10:06:54,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2025-02-08 10:06:54,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 61 states have (on average 1.1147540983606556) internal successors, (68), 64 states have internal predecessors, (68), 7 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 10:06:54,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2025-02-08 10:06:54,798 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 73 [2025-02-08 10:06:54,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:06:54,798 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2025-02-08 10:06:54,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 10:06:54,798 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2025-02-08 10:06:54,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-08 10:06:54,800 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:06:54,800 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:06:54,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 10:06:54,801 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ##fun~$Pointer$~TO~$Pointer$Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-08 10:06:54,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:06:54,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1466662136, now seen corresponding path program 2 times [2025-02-08 10:06:54,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:06:54,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319773940] [2025-02-08 10:06:54,801 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 10:06:54,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:06:54,864 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 67 statements into 2 equivalence classes. [2025-02-08 10:06:54,920 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 67 statements. [2025-02-08 10:06:54,920 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 10:06:54,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:06:55,247 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-02-08 10:06:55,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:06:55,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319773940] [2025-02-08 10:06:55,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319773940] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:06:55,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:06:55,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 10:06:55,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103556445] [2025-02-08 10:06:55,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:06:55,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 10:06:55,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:06:55,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 10:06:55,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 10:06:55,250 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 10:06:59,284 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-08 10:06:59,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:06:59,720 INFO L93 Difference]: Finished difference Result 74 states and 81 transitions. [2025-02-08 10:06:59,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 10:06:59,721 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 67 [2025-02-08 10:06:59,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:06:59,721 INFO L225 Difference]: With dead ends: 74 [2025-02-08 10:06:59,721 INFO L226 Difference]: Without dead ends: 0 [2025-02-08 10:06:59,721 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-08 10:06:59,722 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 2 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-02-08 10:06:59,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 34 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 1 Unknown, 0 Unchecked, 4.4s Time] [2025-02-08 10:06:59,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-08 10:06:59,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-08 10:06:59,723 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-08 10:06:59,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-08 10:06:59,723 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 67 [2025-02-08 10:06:59,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:06:59,723 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 10:06:59,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 10:06:59,723 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-08 10:06:59,724 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-08 10:06:59,726 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 16 remaining) [2025-02-08 10:06:59,726 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 16 remaining) [2025-02-08 10:06:59,726 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ##fun~$Pointer$~TO~$Pointer$Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 16 remaining) [2025-02-08 10:06:59,726 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ##fun~$Pointer$~TO~$Pointer$Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 16 remaining) [2025-02-08 10:06:59,727 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ##fun~$Pointer$~TO~$Pointer$Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 16 remaining) [2025-02-08 10:06:59,727 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ##fun~$Pointer$~TO~$Pointer$Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 16 remaining) [2025-02-08 10:06:59,727 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __CS_csErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 16 remaining) [2025-02-08 10:06:59,727 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __CS_csErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 16 remaining) [2025-02-08 10:06:59,727 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __CS_csErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 16 remaining) [2025-02-08 10:06:59,727 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __CS_csErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 16 remaining) [2025-02-08 10:06:59,727 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __CS_pthread_mutex_unlockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 16 remaining) [2025-02-08 10:06:59,727 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __CS_pthread_mutex_unlockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 16 remaining) [2025-02-08 10:06:59,727 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 16 remaining) [2025-02-08 10:06:59,728 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 16 remaining) [2025-02-08 10:06:59,728 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 16 remaining) [2025-02-08 10:06:59,728 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 16 remaining) [2025-02-08 10:06:59,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 10:06:59,732 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:06:59,733 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-08 10:07:00,997 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 10:07:01,010 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2025-02-08 10:07:01,010 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2025-02-08 10:07:01,010 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#__CS_thread_allocated~0!base,GLOBAL]]] [2025-02-08 10:07:01,012 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2025-02-08 10:07:01,012 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2025-02-08 10:07:01,012 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#__CS_thread_allocated~0!base,GLOBAL]]] [2025-02-08 10:07:01,013 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2025-02-08 10:07:01,013 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2025-02-08 10:07:01,013 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#__CS_thread_allocated~0!base,GLOBAL]]] [2025-02-08 10:07:01,020 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2025-02-08 10:07:01,020 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2025-02-08 10:07:01,020 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#__CS_thread_allocated~0!base,GLOBAL]]] [2025-02-08 10:07:01,020 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2025-02-08 10:07:01,020 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2025-02-08 10:07:01,020 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#__CS_thread_allocated~0!base,GLOBAL]]] [2025-02-08 10:07:01,020 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2025-02-08 10:07:01,020 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2025-02-08 10:07:01,020 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#__CS_thread_allocated~0!base,GLOBAL]]] [2025-02-08 10:07:01,021 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2025-02-08 10:07:01,021 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2025-02-08 10:07:01,021 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#__CS_thread_allocated~0!base,GLOBAL]]] [2025-02-08 10:07:01,021 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2025-02-08 10:07:01,021 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2025-02-08 10:07:01,021 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#__CS_thread_allocated~0!base,GLOBAL]]] [2025-02-08 10:07:01,021 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2025-02-08 10:07:01,021 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2025-02-08 10:07:01,021 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#__CS_thread_allocated~0!base,GLOBAL]]] [2025-02-08 10:07:01,021 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 10:07:01 BoogieIcfgContainer [2025-02-08 10:07:01,021 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 10:07:01,022 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 10:07:01,022 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 10:07:01,022 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 10:07:01,024 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 10:06:46" (3/4) ... [2025-02-08 10:07:01,026 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 10:07:01,031 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __CS_pthread_join [2025-02-08 10:07:01,031 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __CS_pthread_mutex_lock [2025-02-08 10:07:01,031 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ##fun~$Pointer$~TO~$Pointer$ [2025-02-08 10:07:01,031 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __CS_pthread_mutex_unlock [2025-02-08 10:07:01,031 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __CS_pthread_create [2025-02-08 10:07:01,032 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __CS_cs [2025-02-08 10:07:01,044 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 47 nodes and edges [2025-02-08 10:07:01,044 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2025-02-08 10:07:01,045 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-02-08 10:07:01,046 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-08 10:07:01,162 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 10:07:01,163 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 10:07:01,163 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 10:07:01,163 INFO L158 Benchmark]: Toolchain (without parser) took 17098.23ms. Allocated memory was 167.8MB in the beginning and 352.3MB in the end (delta: 184.5MB). Free memory was 122.9MB in the beginning and 256.2MB in the end (delta: -133.2MB). Peak memory consumption was 52.0MB. Max. memory is 16.1GB. [2025-02-08 10:07:01,164 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 117.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 10:07:01,164 INFO L158 Benchmark]: CACSL2BoogieTranslator took 634.18ms. Allocated memory is still 167.8MB. Free memory was 122.0MB in the beginning and 97.4MB in the end (delta: 24.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-08 10:07:01,164 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.15ms. Allocated memory is still 167.8MB. Free memory was 97.4MB in the beginning and 93.0MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 10:07:01,164 INFO L158 Benchmark]: Boogie Preprocessor took 117.15ms. Allocated memory is still 167.8MB. Free memory was 93.0MB in the beginning and 86.1MB in the end (delta: 6.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 10:07:01,164 INFO L158 Benchmark]: IcfgBuilder took 1190.08ms. Allocated memory is still 167.8MB. Free memory was 86.1MB in the beginning and 110.3MB in the end (delta: -24.2MB). Peak memory consumption was 68.9MB. Max. memory is 16.1GB. [2025-02-08 10:07:01,164 INFO L158 Benchmark]: TraceAbstraction took 14950.91ms. Allocated memory was 167.8MB in the beginning and 352.3MB in the end (delta: 184.5MB). Free memory was 109.4MB in the beginning and 264.5MB in the end (delta: -155.0MB). Peak memory consumption was 193.8MB. Max. memory is 16.1GB. [2025-02-08 10:07:01,165 INFO L158 Benchmark]: Witness Printer took 140.51ms. Allocated memory is still 352.3MB. Free memory was 264.5MB in the beginning and 256.2MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 10:07:01,166 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.25ms. Allocated memory is still 201.3MB. Free memory is still 117.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 634.18ms. Allocated memory is still 167.8MB. Free memory was 122.0MB in the beginning and 97.4MB in the end (delta: 24.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.15ms. Allocated memory is still 167.8MB. Free memory was 97.4MB in the beginning and 93.0MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 117.15ms. Allocated memory is still 167.8MB. Free memory was 93.0MB in the beginning and 86.1MB in the end (delta: 6.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 1190.08ms. Allocated memory is still 167.8MB. Free memory was 86.1MB in the beginning and 110.3MB in the end (delta: -24.2MB). Peak memory consumption was 68.9MB. Max. memory is 16.1GB. * TraceAbstraction took 14950.91ms. Allocated memory was 167.8MB in the beginning and 352.3MB in the end (delta: 184.5MB). Free memory was 109.4MB in the beginning and 264.5MB in the end (delta: -155.0MB). Peak memory consumption was 193.8MB. Max. memory is 16.1GB. * Witness Printer took 140.51ms. Allocated memory is still 352.3MB. Free memory was 264.5MB in the beginning and 256.2MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#__CS_thread_allocated~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#__CS_thread_allocated~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#__CS_thread_allocated~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#__CS_thread_allocated~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#__CS_thread_allocated~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#__CS_thread_allocated~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#__CS_thread_allocated~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#__CS_thread_allocated~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#__CS_thread_allocated~0!base,GLOBAL]]] * 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: 580]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 580]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 696]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 696]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 686]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 686]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 562]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 562]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 561]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 561]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 586]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 586]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 747]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 747]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 748]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 748]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 159 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 13.6s, OverallIterations: 12, TraceHistogramMax: 8, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 6.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 326 SdHoareTripleChecker+Valid, 6.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 326 mSDsluCounter, 3194 SdHoareTripleChecker+Invalid, 6.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1826 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 132 IncrementalHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 1368 mSDtfsCounter, 132 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 281 GetRequests, 243 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=146occurred in iteration=0, InterpolantAutomatonStates: 46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 11 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 564 NumberOfCodeBlocks, 468 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 643 ConstructedInterpolants, 0 QuantifiedInterpolants, 1783 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2601 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 20 InterpolantComputations, 10 PerfectInterpolantSequences, 601/612 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 16 specifications checked. All of them hold - InvariantResult [Line: 747]: Location Invariant Derived location invariant: (0 <= i) - InvariantResult [Line: 748]: Location Invariant Derived location invariant: ((((0 <= i) && (i <= 1)) && (1 <= j)) || (((0 <= i) && (i <= 1)) && (j == 0))) RESULT: Ultimate proved your program to be correct! [2025-02-08 10:07:01,188 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE