./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 551b0097 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-?-551b009-m [2025-01-10 02:39:00,376 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 02:39:00,435 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-01-10 02:39:00,440 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 02:39:00,442 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 02:39:00,465 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 02:39:00,465 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 02:39:00,466 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 02:39:00,466 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 02:39:00,466 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 02:39:00,467 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 02:39:00,467 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 02:39:00,467 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 02:39:00,467 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 02:39:00,468 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 02:39:00,468 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 02:39:00,468 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 02:39:00,468 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 02:39:00,468 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 02:39:00,468 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 02:39:00,468 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 02:39:00,468 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 02:39:00,468 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 02:39:00,469 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 02:39:00,469 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 02:39:00,469 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 02:39:00,469 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 02:39:00,469 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 02:39:00,469 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 02:39:00,469 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 02:39:00,469 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 02:39:00,469 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 02:39:00,470 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 02:39:00,470 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 02:39:00,470 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:39:00,470 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 02:39:00,470 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 02:39:00,470 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 02:39:00,470 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 02:39:00,470 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:39:00,470 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 02:39:00,470 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 02:39:00,470 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 02:39:00,471 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 02:39:00,471 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 02:39:00,471 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 02:39:00,471 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 02:39:00,471 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 02:39:00,471 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 02:39:00,471 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 02:39:00,471 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-01-10 02:39:00,698 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 02:39:00,706 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 02:39:00,707 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 02:39:00,708 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 02:39:00,709 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 02:39:00,709 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-01-10 02:39:01,831 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b4bec7ca4/40b0d29cdddb410984bf63dbeb1db78c/FLAGa3134675f [2025-01-10 02:39:02,084 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 02:39:02,085 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_lazy.i [2025-01-10 02:39:02,097 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b4bec7ca4/40b0d29cdddb410984bf63dbeb1db78c/FLAGa3134675f [2025-01-10 02:39:02,397 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b4bec7ca4/40b0d29cdddb410984bf63dbeb1db78c [2025-01-10 02:39:02,398 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 02:39:02,399 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 02:39:02,400 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 02:39:02,400 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 02:39:02,403 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 02:39:02,403 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:39:02" (1/1) ... [2025-01-10 02:39:02,404 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d2975ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:39:02, skipping insertion in model container [2025-01-10 02:39:02,404 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:39:02" (1/1) ... [2025-01-10 02:39:02,436 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 02:39:02,648 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 02:39:02,659 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 02:39:02,730 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 02:39:02,757 INFO L204 MainTranslator]: Completed translation [2025-01-10 02:39:02,758 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:39:02 WrapperNode [2025-01-10 02:39:02,758 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 02:39:02,759 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 02:39:02,759 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 02:39:02,759 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 02:39:02,762 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:39:02" (1/1) ... [2025-01-10 02:39:02,774 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:39:02" (1/1) ... [2025-01-10 02:39:02,794 INFO L138 Inliner]: procedures = 145, calls = 224, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 533 [2025-01-10 02:39:02,795 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 02:39:02,796 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 02:39:02,796 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 02:39:02,796 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 02:39:02,802 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:39:02" (1/1) ... [2025-01-10 02:39:02,802 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:39:02" (1/1) ... [2025-01-10 02:39:02,806 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:39:02" (1/1) ... [2025-01-10 02:39:02,837 INFO L175 MemorySlicer]: Split 119 memory accesses to 14 slices as follows [2, 5, 10, 10, 10, 25, 16, 9, 9, 3, 9, 3, 0, 8]. 21 percent of accesses are in the largest equivalence class. The 34 initializations are split as follows [2, 0, 4, 4, 4, 8, 8, 2, 0, 0, 0, 0, 0, 2]. The 32 writes are split as follows [0, 2, 2, 2, 2, 10, 4, 3, 1, 1, 1, 1, 0, 3]. [2025-01-10 02:39:02,837 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:39:02" (1/1) ... [2025-01-10 02:39:02,837 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:39:02" (1/1) ... [2025-01-10 02:39:02,873 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:39:02" (1/1) ... [2025-01-10 02:39:02,876 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:39:02" (1/1) ... [2025-01-10 02:39:02,883 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:39:02" (1/1) ... [2025-01-10 02:39:02,892 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:39:02" (1/1) ... [2025-01-10 02:39:02,902 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:39:02" (1/1) ... [2025-01-10 02:39:02,913 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 02:39:02,914 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 02:39:02,914 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 02:39:02,914 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 02:39:02,915 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:39:02" (1/1) ... [2025-01-10 02:39:02,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:39:02,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:39:02,944 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-01-10 02:39:02,946 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-01-10 02:39:02,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 02:39:02,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 02:39:02,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 02:39:02,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-10 02:39:02,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-10 02:39:02,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-01-10 02:39:02,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-01-10 02:39:02,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-01-10 02:39:02,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-01-10 02:39:02,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-01-10 02:39:02,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-01-10 02:39:02,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-01-10 02:39:02,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-01-10 02:39:02,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-01-10 02:39:02,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 02:39:02,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 02:39:02,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 02:39:02,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-10 02:39:02,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-10 02:39:02,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-01-10 02:39:02,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-01-10 02:39:02,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-01-10 02:39:02,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-01-10 02:39:02,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-01-10 02:39:02,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-01-10 02:39:02,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-01-10 02:39:02,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-01-10 02:39:02,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-01-10 02:39:02,970 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 02:39:02,970 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 02:39:02,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-10 02:39:02,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-10 02:39:02,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-10 02:39:02,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-01-10 02:39:02,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-01-10 02:39:02,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-01-10 02:39:02,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-01-10 02:39:02,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-01-10 02:39:02,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-01-10 02:39:02,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-01-10 02:39:02,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-01-10 02:39:02,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-01-10 02:39:02,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-01-10 02:39:02,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-01-10 02:39:02,970 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_lock [2025-01-10 02:39:02,970 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_lock [2025-01-10 02:39:02,971 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2025-01-10 02:39:02,971 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2025-01-10 02:39:02,971 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-10 02:39:02,971 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-10 02:39:02,971 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-10 02:39:02,971 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-01-10 02:39:02,971 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-01-10 02:39:02,972 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-01-10 02:39:02,972 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-01-10 02:39:02,972 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-01-10 02:39:02,972 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-01-10 02:39:02,972 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-01-10 02:39:02,972 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-01-10 02:39:02,972 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-01-10 02:39:02,972 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-01-10 02:39:02,972 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-01-10 02:39:02,972 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2025-01-10 02:39:02,972 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2025-01-10 02:39:02,972 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-01-10 02:39:02,972 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-01-10 02:39:02,972 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 02:39:02,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-01-10 02:39:02,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-01-10 02:39:02,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-01-10 02:39:02,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-01-10 02:39:02,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-01-10 02:39:02,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-01-10 02:39:02,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-01-10 02:39:02,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-01-10 02:39:02,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-01-10 02:39:02,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-01-10 02:39:02,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-01-10 02:39:02,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-01-10 02:39:02,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-01-10 02:39:02,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-01-10 02:39:02,973 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2025-01-10 02:39:02,973 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2025-01-10 02:39:02,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 02:39:02,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 02:39:02,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 02:39:02,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-10 02:39:02,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-10 02:39:02,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-10 02:39:02,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-01-10 02:39:02,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-01-10 02:39:02,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-01-10 02:39:02,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-01-10 02:39:02,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-01-10 02:39:02,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-01-10 02:39:02,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-01-10 02:39:02,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-01-10 02:39:02,974 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_unlock [2025-01-10 02:39:02,974 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_unlock [2025-01-10 02:39:02,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 02:39:02,974 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 02:39:03,141 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 02:39:03,143 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 02:39:03,417 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##32: 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-01-10 02:39:03,417 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##31: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-01-10 02:39:03,417 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##30: 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-01-10 02:39:03,417 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##33: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-01-10 02:39:03,417 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint L714: SUMMARY for call __CS_cs(); srcloc: null [2025-01-10 02:39:03,417 INFO L727 $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-01-10 02:39:03,417 INFO L727 $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-01-10 02:39:03,681 INFO L? ?]: Removed 98 outVars from TransFormulas that were not future-live. [2025-01-10 02:39:03,682 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 02:39:03,691 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 02:39:03,692 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 02:39:03,692 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:39:03 BoogieIcfgContainer [2025-01-10 02:39:03,692 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 02:39:03,695 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 02:39:03,695 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 02:39:03,698 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 02:39:03,698 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 02:39:02" (1/3) ... [2025-01-10 02:39:03,699 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ba9b327 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:39:03, skipping insertion in model container [2025-01-10 02:39:03,700 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:39:02" (2/3) ... [2025-01-10 02:39:03,700 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ba9b327 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:39:03, skipping insertion in model container [2025-01-10 02:39:03,700 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:39:03" (3/3) ... [2025-01-10 02:39:03,701 INFO L128 eAbstractionObserver]: Analyzing ICFG cs_lazy.i [2025-01-10 02:39:03,710 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 02:39:03,711 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cs_lazy.i that has 7 procedures, 190 locations, 1 initial locations, 2 loop locations, and 16 error locations. [2025-01-10 02:39:03,754 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 02:39:03,761 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;@45958a1c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 02:39:03,762 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-01-10 02:39:03,764 INFO L276 IsEmpty]: Start isEmpty. Operand has 190 states, 130 states have (on average 1.5538461538461539) internal successors, (202), 146 states have internal predecessors, (202), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2025-01-10 02:39:03,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-10 02:39:03,767 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:39:03,768 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 02:39:03,768 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-01-10 02:39:03,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:39:03,772 INFO L85 PathProgramCache]: Analyzing trace with hash 295900220, now seen corresponding path program 1 times [2025-01-10 02:39:03,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:39:03,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112084919] [2025-01-10 02:39:03,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:39:03,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:39:03,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 02:39:03,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 02:39:03,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:39:03,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:39:04,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:39:04,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:39:04,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112084919] [2025-01-10 02:39:04,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112084919] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:39:04,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:39:04,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 02:39:04,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233600043] [2025-01-10 02:39:04,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:39:04,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 02:39:04,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:39:04,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 02:39:04,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:39:04,061 INFO L87 Difference]: Start difference. First operand has 190 states, 130 states have (on average 1.5538461538461539) internal successors, (202), 146 states have internal predecessors, (202), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-01-10 02:39:04,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:39:04,137 INFO L93 Difference]: Finished difference Result 372 states and 583 transitions. [2025-01-10 02:39:04,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 02:39:04,138 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2025-01-10 02:39:04,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:39:04,144 INFO L225 Difference]: With dead ends: 372 [2025-01-10 02:39:04,144 INFO L226 Difference]: Without dead ends: 154 [2025-01-10 02:39:04,168 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-01-10 02:39:04,172 INFO L435 NwaCegarLoop]: 250 mSDtfsCounter, 1 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 494 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.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:39:04,172 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 494 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:39:04,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-01-10 02:39:04,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2025-01-10 02:39:04,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 103 states have (on average 1.4660194174757282) internal successors, (151), 111 states have internal predecessors, (151), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-10 02:39:04,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 224 transitions. [2025-01-10 02:39:04,220 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 224 transitions. Word has length 5 [2025-01-10 02:39:04,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:39:04,221 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 224 transitions. [2025-01-10 02:39:04,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-01-10 02:39:04,221 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 224 transitions. [2025-01-10 02:39:04,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-10 02:39:04,221 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:39:04,222 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-01-10 02:39:04,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 02:39:04,222 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-01-10 02:39:04,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:39:04,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1890884234, now seen corresponding path program 1 times [2025-01-10 02:39:04,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:39:04,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537180708] [2025-01-10 02:39:04,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:39:04,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:39:04,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 02:39:04,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 02:39:04,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:39:04,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:39:04,383 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:39:04,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:39:04,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537180708] [2025-01-10 02:39:04,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537180708] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:39:04,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [816152394] [2025-01-10 02:39:04,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:39:04,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:39:04,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:39:04,386 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-01-10 02:39:04,388 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-01-10 02:39:04,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 02:39:04,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 02:39:04,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:39:04,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:39:04,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 02:39:04,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:39:04,568 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:39:04,568 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:39:04,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [816152394] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:39:04,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 02:39:04,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-01-10 02:39:04,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667246058] [2025-01-10 02:39:04,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:39:04,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:39:04,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:39:04,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:39:04,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:39:04,570 INFO L87 Difference]: Start difference. First operand 154 states and 224 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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-01-10 02:39:04,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:39:04,612 INFO L93 Difference]: Finished difference Result 154 states and 224 transitions. [2025-01-10 02:39:04,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 02:39:04,613 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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-01-10 02:39:04,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:39:04,614 INFO L225 Difference]: With dead ends: 154 [2025-01-10 02:39:04,616 INFO L226 Difference]: Without dead ends: 153 [2025-01-10 02:39:04,617 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 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-01-10 02:39:04,617 INFO L435 NwaCegarLoop]: 215 mSDtfsCounter, 1 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:39:04,617 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 428 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:39:04,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2025-01-10 02:39:04,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2025-01-10 02:39:04,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 103 states have (on average 1.4563106796116505) internal successors, (150), 110 states have internal predecessors, (150), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-10 02:39:04,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 223 transitions. [2025-01-10 02:39:04,636 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 223 transitions. Word has length 8 [2025-01-10 02:39:04,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:39:04,636 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 223 transitions. [2025-01-10 02:39:04,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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-01-10 02:39:04,636 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 223 transitions. [2025-01-10 02:39:04,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-10 02:39:04,636 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:39:04,636 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:39:04,644 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-10 02:39:04,841 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-01-10 02:39:04,841 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-01-10 02:39:04,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:39:04,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1890884426, now seen corresponding path program 1 times [2025-01-10 02:39:04,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:39:04,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398268940] [2025-01-10 02:39:04,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:39:04,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:39:04,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 02:39:04,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 02:39:04,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:39:04,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:39:04,961 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:39:04,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:39:04,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398268940] [2025-01-10 02:39:04,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398268940] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:39:04,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1552367230] [2025-01-10 02:39:04,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:39:04,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:39:04,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:39:04,964 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-01-10 02:39:04,965 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-01-10 02:39:05,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 02:39:05,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 02:39:05,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:39:05,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:39:05,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 02:39:05,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:39:05,140 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 02:39:05,140 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:39:05,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1552367230] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:39:05,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 02:39:05,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-01-10 02:39:05,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466315886] [2025-01-10 02:39:05,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:39:05,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 02:39:05,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:39:05,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 02:39:05,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:39:05,143 INFO L87 Difference]: Start difference. First operand 153 states and 223 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-01-10 02:39:05,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:39:05,330 INFO L93 Difference]: Finished difference Result 153 states and 223 transitions. [2025-01-10 02:39:05,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 02:39:05,330 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-01-10 02:39:05,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:39:05,331 INFO L225 Difference]: With dead ends: 153 [2025-01-10 02:39:05,332 INFO L226 Difference]: Without dead ends: 152 [2025-01-10 02:39:05,333 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-01-10 02:39:05,334 INFO L435 NwaCegarLoop]: 212 mSDtfsCounter, 2 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 420 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-01-10 02:39:05,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 420 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 02:39:05,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2025-01-10 02:39:05,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2025-01-10 02:39:05,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 103 states have (on average 1.4466019417475728) internal successors, (149), 109 states have internal predecessors, (149), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-10 02:39:05,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 222 transitions. [2025-01-10 02:39:05,349 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 222 transitions. Word has length 8 [2025-01-10 02:39:05,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:39:05,349 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 222 transitions. [2025-01-10 02:39:05,349 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-01-10 02:39:05,350 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 222 transitions. [2025-01-10 02:39:05,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-10 02:39:05,350 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:39:05,350 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2025-01-10 02:39:05,357 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-01-10 02:39:05,550 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-01-10 02:39:05,551 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-01-10 02:39:05,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:39:05,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1512130566, now seen corresponding path program 1 times [2025-01-10 02:39:05,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:39:05,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443788022] [2025-01-10 02:39:05,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:39:05,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:39:05,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 02:39:05,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 02:39:05,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:39:05,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:39:05,595 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 02:39:05,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:39:05,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443788022] [2025-01-10 02:39:05,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443788022] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:39:05,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:39:05,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 02:39:05,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188066628] [2025-01-10 02:39:05,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:39:05,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 02:39:05,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:39:05,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 02:39:05,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:39:05,596 INFO L87 Difference]: Start difference. First operand 152 states and 222 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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-01-10 02:39:05,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:39:05,611 INFO L93 Difference]: Finished difference Result 152 states and 222 transitions. [2025-01-10 02:39:05,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 02:39:05,612 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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 9 [2025-01-10 02:39:05,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:39:05,613 INFO L225 Difference]: With dead ends: 152 [2025-01-10 02:39:05,613 INFO L226 Difference]: Without dead ends: 151 [2025-01-10 02:39:05,613 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-01-10 02:39:05,613 INFO L435 NwaCegarLoop]: 215 mSDtfsCounter, 0 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 427 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-01-10 02:39:05,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 427 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:39:05,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-01-10 02:39:05,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 149. [2025-01-10 02:39:05,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 101 states have (on average 1.4455445544554455) internal successors, (146), 106 states have internal predecessors, (146), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-10 02:39:05,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 219 transitions. [2025-01-10 02:39:05,622 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 219 transitions. Word has length 9 [2025-01-10 02:39:05,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:39:05,622 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 219 transitions. [2025-01-10 02:39:05,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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-01-10 02:39:05,622 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 219 transitions. [2025-01-10 02:39:05,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-10 02:39:05,622 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:39:05,623 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:39:05,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 02:39:05,623 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-01-10 02:39:05,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:39:05,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1512124608, now seen corresponding path program 1 times [2025-01-10 02:39:05,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:39:05,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184463485] [2025-01-10 02:39:05,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:39:05,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:39:05,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 02:39:05,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 02:39:05,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:39:05,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:39:05,699 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:39:05,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:39:05,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184463485] [2025-01-10 02:39:05,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184463485] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:39:05,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1508007325] [2025-01-10 02:39:05,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:39:05,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:39:05,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:39:05,702 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-01-10 02:39:05,711 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-01-10 02:39:05,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 02:39:05,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 02:39:05,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:39:05,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:39:05,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 02:39:05,846 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:39:05,857 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 02:39:05,857 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:39:05,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1508007325] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:39:05,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 02:39:05,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-01-10 02:39:05,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978206007] [2025-01-10 02:39:05,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:39:05,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 02:39:05,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:39:05,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 02:39:05,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:39:05,859 INFO L87 Difference]: Start difference. First operand 149 states and 219 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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-01-10 02:39:05,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:39:05,965 INFO L93 Difference]: Finished difference Result 296 states and 436 transitions. [2025-01-10 02:39:05,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 02:39:05,966 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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 9 [2025-01-10 02:39:05,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:39:05,967 INFO L225 Difference]: With dead ends: 296 [2025-01-10 02:39:05,969 INFO L226 Difference]: Without dead ends: 156 [2025-01-10 02:39:05,971 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 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-01-10 02:39:05,971 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 0 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 423 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-01-10 02:39:05,971 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 423 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:39:05,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-01-10 02:39:05,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2025-01-10 02:39:05,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 108 states have (on average 1.4259259259259258) internal successors, (154), 113 states have internal predecessors, (154), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-10 02:39:05,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 227 transitions. [2025-01-10 02:39:05,984 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 227 transitions. Word has length 9 [2025-01-10 02:39:05,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:39:05,984 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 227 transitions. [2025-01-10 02:39:05,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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-01-10 02:39:05,985 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 227 transitions. [2025-01-10 02:39:05,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-10 02:39:05,985 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:39:05,986 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2025-01-10 02:39:05,993 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-10 02:39:06,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:39:06,186 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-01-10 02:39:06,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:39:06,187 INFO L85 PathProgramCache]: Analyzing trace with hash 814169346, now seen corresponding path program 1 times [2025-01-10 02:39:06,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:39:06,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854233369] [2025-01-10 02:39:06,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:39:06,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:39:06,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 02:39:06,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 02:39:06,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:39:06,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:39:06,269 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 02:39:06,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:39:06,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854233369] [2025-01-10 02:39:06,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854233369] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:39:06,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2014514330] [2025-01-10 02:39:06,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:39:06,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:39:06,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:39:06,272 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-01-10 02:39:06,273 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-01-10 02:39:06,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 02:39:06,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 02:39:06,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:39:06,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:39:06,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 02:39:06,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:39:06,438 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 02:39:06,439 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:39:06,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2014514330] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:39:06,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 02:39:06,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-01-10 02:39:06,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425995307] [2025-01-10 02:39:06,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:39:06,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 02:39:06,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:39:06,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 02:39:06,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:39:06,440 INFO L87 Difference]: Start difference. First operand 156 states and 227 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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-01-10 02:39:06,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:39:06,503 INFO L93 Difference]: Finished difference Result 156 states and 227 transitions. [2025-01-10 02:39:06,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 02:39:06,513 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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 16 [2025-01-10 02:39:06,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:39:06,515 INFO L225 Difference]: With dead ends: 156 [2025-01-10 02:39:06,515 INFO L226 Difference]: Without dead ends: 155 [2025-01-10 02:39:06,515 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 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-01-10 02:39:06,517 INFO L435 NwaCegarLoop]: 212 mSDtfsCounter, 0 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 420 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.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:39:06,517 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 420 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:39:06,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2025-01-10 02:39:06,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 149. [2025-01-10 02:39:06,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 102 states have (on average 1.4313725490196079) internal successors, (146), 106 states have internal predecessors, (146), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-10 02:39:06,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 219 transitions. [2025-01-10 02:39:06,531 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 219 transitions. Word has length 16 [2025-01-10 02:39:06,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:39:06,531 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 219 transitions. [2025-01-10 02:39:06,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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-01-10 02:39:06,532 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 219 transitions. [2025-01-10 02:39:06,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-01-10 02:39:06,533 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:39:06,533 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, 1] [2025-01-10 02:39:06,544 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-10 02:39:06,733 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-01-10 02:39:06,734 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ##fun~$Pointer$~TO~$Pointer$Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-01-10 02:39:06,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:39:06,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1722599777, now seen corresponding path program 1 times [2025-01-10 02:39:06,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:39:06,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934095493] [2025-01-10 02:39:06,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:39:06,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:39:06,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-10 02:39:06,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-10 02:39:06,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:39:06,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:39:06,880 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-10 02:39:06,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:39:06,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934095493] [2025-01-10 02:39:06,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934095493] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:39:06,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [846184545] [2025-01-10 02:39:06,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:39:06,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:39:06,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:39:06,883 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-01-10 02:39:06,885 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-01-10 02:39:07,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-10 02:39:07,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-10 02:39:07,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:39:07,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:39:07,101 INFO L256 TraceCheckSpWp]: Trace formula consists of 632 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 02:39:07,103 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:39:07,119 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-10 02:39:07,119 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:39:07,156 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-10 02:39:07,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [846184545] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:39:07,157 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:39:07,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-10 02:39:07,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407475800] [2025-01-10 02:39:07,157 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:39:07,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 02:39:07,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:39:07,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 02:39:07,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 02:39:07,158 INFO L87 Difference]: Start difference. First operand 149 states and 219 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 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-01-10 02:39:07,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:39:07,206 INFO L93 Difference]: Finished difference Result 304 states and 447 transitions. [2025-01-10 02:39:07,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 02:39:07,207 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 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 43 [2025-01-10 02:39:07,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:39:07,208 INFO L225 Difference]: With dead ends: 304 [2025-01-10 02:39:07,209 INFO L226 Difference]: Without dead ends: 158 [2025-01-10 02:39:07,210 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 83 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-01-10 02:39:07,211 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 4 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:39:07,212 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 636 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:39:07,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-01-10 02:39:07,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2025-01-10 02:39:07,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 111 states have (on average 1.3963963963963963) internal successors, (155), 115 states have internal predecessors, (155), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-10 02:39:07,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 228 transitions. [2025-01-10 02:39:07,224 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 228 transitions. Word has length 43 [2025-01-10 02:39:07,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:39:07,224 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 228 transitions. [2025-01-10 02:39:07,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 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-01-10 02:39:07,224 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 228 transitions. [2025-01-10 02:39:07,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-01-10 02:39:07,226 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:39:07,226 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] [2025-01-10 02:39:07,235 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-10 02:39:07,426 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-01-10 02:39:07,426 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ##fun~$Pointer$~TO~$Pointer$Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-01-10 02:39:07,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:39:07,427 INFO L85 PathProgramCache]: Analyzing trace with hash 845858093, now seen corresponding path program 2 times [2025-01-10 02:39:07,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:39:07,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140728417] [2025-01-10 02:39:07,427 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 02:39:07,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:39:07,457 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 52 statements into 2 equivalence classes. [2025-01-10 02:39:07,466 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 52 statements. [2025-01-10 02:39:07,466 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 02:39:07,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:39:07,696 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-01-10 02:39:07,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:39:07,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140728417] [2025-01-10 02:39:07,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140728417] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:39:07,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:39:07,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 02:39:07,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918631331] [2025-01-10 02:39:07,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:39:07,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 02:39:07,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:39:07,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 02:39:07,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:39:07,698 INFO L87 Difference]: Start difference. First operand 158 states and 228 transitions. Second operand has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 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-01-10 02:39:08,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:39:08,590 INFO L93 Difference]: Finished difference Result 440 states and 652 transitions. [2025-01-10 02:39:08,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 02:39:08,591 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 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 52 [2025-01-10 02:39:08,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:39:08,594 INFO L225 Difference]: With dead ends: 440 [2025-01-10 02:39:08,594 INFO L226 Difference]: Without dead ends: 303 [2025-01-10 02:39:08,595 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-10 02:39:08,596 INFO L435 NwaCegarLoop]: 249 mSDtfsCounter, 229 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 775 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-10 02:39:08,596 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 775 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-10 02:39:08,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2025-01-10 02:39:08,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 163. [2025-01-10 02:39:08,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 115 states have (on average 1.382608695652174) internal successors, (159), 119 states have internal predecessors, (159), 37 states have call successors, (37), 7 states have call predecessors, (37), 7 states have return successors, (38), 36 states have call predecessors, (38), 36 states have call successors, (38) [2025-01-10 02:39:08,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 234 transitions. [2025-01-10 02:39:08,614 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 234 transitions. Word has length 52 [2025-01-10 02:39:08,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:39:08,615 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 234 transitions. [2025-01-10 02:39:08,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 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-01-10 02:39:08,615 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 234 transitions. [2025-01-10 02:39:08,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-01-10 02:39:08,617 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:39:08,617 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] [2025-01-10 02:39:08,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 02:39:08,618 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ##fun~$Pointer$~TO~$Pointer$Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-01-10 02:39:08,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:39:08,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1212377251, now seen corresponding path program 1 times [2025-01-10 02:39:08,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:39:08,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437062696] [2025-01-10 02:39:08,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:39:08,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:39:08,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-10 02:39:08,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-10 02:39:08,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:39:08,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:39:08,786 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-10 02:39:08,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:39:08,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437062696] [2025-01-10 02:39:08,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437062696] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:39:08,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [469462778] [2025-01-10 02:39:08,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:39:08,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:39:08,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:39:08,789 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-01-10 02:39:08,790 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-01-10 02:39:08,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-10 02:39:09,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-10 02:39:09,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:39:09,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:39:09,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 725 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 02:39:09,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:39:09,082 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-10 02:39:09,083 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:39:09,123 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-10 02:39:09,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [469462778] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:39:09,124 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:39:09,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2025-01-10 02:39:09,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863586385] [2025-01-10 02:39:09,124 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:39:09,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 02:39:09,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:39:09,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 02:39:09,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:39:09,125 INFO L87 Difference]: Start difference. First operand 163 states and 234 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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-01-10 02:39:09,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:39:09,406 INFO L93 Difference]: Finished difference Result 323 states and 465 transitions. [2025-01-10 02:39:09,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 02:39:09,407 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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 56 [2025-01-10 02:39:09,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:39:09,408 INFO L225 Difference]: With dead ends: 323 [2025-01-10 02:39:09,409 INFO L226 Difference]: Without dead ends: 179 [2025-01-10 02:39:09,410 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 109 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-01-10 02:39:09,411 INFO L435 NwaCegarLoop]: 212 mSDtfsCounter, 6 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 630 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-10 02:39:09,411 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 630 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-10 02:39:09,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2025-01-10 02:39:09,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2025-01-10 02:39:09,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 131 states have (on average 1.3435114503816794) internal successors, (176), 135 states have internal predecessors, (176), 37 states have call successors, (37), 7 states have call predecessors, (37), 7 states have return successors, (38), 36 states have call predecessors, (38), 36 states have call successors, (38) [2025-01-10 02:39:09,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 251 transitions. [2025-01-10 02:39:09,423 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 251 transitions. Word has length 56 [2025-01-10 02:39:09,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:39:09,424 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 251 transitions. [2025-01-10 02:39:09,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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-01-10 02:39:09,424 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 251 transitions. [2025-01-10 02:39:09,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-01-10 02:39:09,425 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:39:09,425 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, 1] [2025-01-10 02:39:09,432 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-10 02:39:09,625 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,SelfDestructingSolverStorable8 [2025-01-10 02:39:09,626 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ##fun~$Pointer$~TO~$Pointer$Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-01-10 02:39:09,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:39:09,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1451833126, now seen corresponding path program 1 times [2025-01-10 02:39:09,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:39:09,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962546450] [2025-01-10 02:39:09,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:39:09,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:39:09,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-01-10 02:39:09,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-01-10 02:39:09,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:39:09,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:39:10,023 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-01-10 02:39:10,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:39:10,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962546450] [2025-01-10 02:39:10,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962546450] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:39:10,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:39:10,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 02:39:10,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357329195] [2025-01-10 02:39:10,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:39:10,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 02:39:10,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:39:10,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 02:39:10,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:39:10,025 INFO L87 Difference]: Start difference. First operand 179 states and 251 transitions. Second operand has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 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-01-10 02:39:10,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:39:10,330 INFO L93 Difference]: Finished difference Result 447 states and 649 transitions. [2025-01-10 02:39:10,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 02:39:10,330 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 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 74 [2025-01-10 02:39:10,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:39:10,334 INFO L225 Difference]: With dead ends: 447 [2025-01-10 02:39:10,334 INFO L226 Difference]: Without dead ends: 333 [2025-01-10 02:39:10,335 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-01-10 02:39:10,335 INFO L435 NwaCegarLoop]: 268 mSDtfsCounter, 236 mSDsluCounter, 722 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 990 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-10 02:39:10,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 990 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-10 02:39:10,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2025-01-10 02:39:10,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 327. [2025-01-10 02:39:10,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 233 states have (on average 1.3733905579399142) internal successors, (320), 237 states have internal predecessors, (320), 76 states have call successors, (76), 14 states have call predecessors, (76), 14 states have return successors, (84), 75 states have call predecessors, (84), 74 states have call successors, (84) [2025-01-10 02:39:10,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 480 transitions. [2025-01-10 02:39:10,361 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 480 transitions. Word has length 74 [2025-01-10 02:39:10,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:39:10,361 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 480 transitions. [2025-01-10 02:39:10,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 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-01-10 02:39:10,361 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 480 transitions. [2025-01-10 02:39:10,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-01-10 02:39:10,362 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:39:10,362 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] [2025-01-10 02:39:10,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 02:39:10,362 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ##fun~$Pointer$~TO~$Pointer$Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-01-10 02:39:10,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:39:10,363 INFO L85 PathProgramCache]: Analyzing trace with hash 55008804, now seen corresponding path program 1 times [2025-01-10 02:39:10,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:39:10,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729680233] [2025-01-10 02:39:10,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:39:10,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:39:10,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-10 02:39:10,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-10 02:39:10,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:39:10,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:39:10,693 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-01-10 02:39:10,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:39:10,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729680233] [2025-01-10 02:39:10,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729680233] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:39:10,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:39:10,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 02:39:10,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067363911] [2025-01-10 02:39:10,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:39:10,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 02:39:10,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:39:10,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 02:39:10,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:39:10,695 INFO L87 Difference]: Start difference. First operand 327 states and 480 transitions. Second operand has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 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-01-10 02:39:11,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:39:11,061 INFO L93 Difference]: Finished difference Result 633 states and 933 transitions. [2025-01-10 02:39:11,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 02:39:11,062 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 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 70 [2025-01-10 02:39:11,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:39:11,064 INFO L225 Difference]: With dead ends: 633 [2025-01-10 02:39:11,064 INFO L226 Difference]: Without dead ends: 355 [2025-01-10 02:39:11,065 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-01-10 02:39:11,066 INFO L435 NwaCegarLoop]: 275 mSDtfsCounter, 232 mSDsluCounter, 730 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 1005 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-10 02:39:11,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 1005 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-10 02:39:11,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2025-01-10 02:39:11,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 349. [2025-01-10 02:39:11,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 248 states have (on average 1.375) internal successors, (341), 252 states have internal predecessors, (341), 82 states have call successors, (82), 15 states have call predecessors, (82), 15 states have return successors, (88), 81 states have call predecessors, (88), 80 states have call successors, (88) [2025-01-10 02:39:11,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 511 transitions. [2025-01-10 02:39:11,096 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 511 transitions. Word has length 70 [2025-01-10 02:39:11,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:39:11,096 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 511 transitions. [2025-01-10 02:39:11,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 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-01-10 02:39:11,097 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 511 transitions. [2025-01-10 02:39:11,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-01-10 02:39:11,098 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:39:11,098 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] [2025-01-10 02:39:11,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 02:39:11,099 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ##fun~$Pointer$~TO~$Pointer$Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-01-10 02:39:11,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:39:11,099 INFO L85 PathProgramCache]: Analyzing trace with hash -557310976, now seen corresponding path program 1 times [2025-01-10 02:39:11,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:39:11,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680399472] [2025-01-10 02:39:11,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:39:11,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:39:11,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-10 02:39:11,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-10 02:39:11,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:39:11,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:39:11,401 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-01-10 02:39:11,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:39:11,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680399472] [2025-01-10 02:39:11,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680399472] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:39:11,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:39:11,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 02:39:11,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985041218] [2025-01-10 02:39:11,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:39:11,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:39:11,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:39:11,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:39:11,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:39:11,403 INFO L87 Difference]: Start difference. First operand 349 states and 511 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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-01-10 02:39:15,414 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-01-10 02:39:15,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:39:15,526 INFO L93 Difference]: Finished difference Result 624 states and 915 transitions. [2025-01-10 02:39:15,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 02:39:15,527 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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 70 [2025-01-10 02:39:15,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:39:15,529 INFO L225 Difference]: With dead ends: 624 [2025-01-10 02:39:15,529 INFO L226 Difference]: Without dead ends: 328 [2025-01-10 02:39:15,530 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-01-10 02:39:15,530 INFO L435 NwaCegarLoop]: 267 mSDtfsCounter, 199 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 729 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:39:15,530 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 729 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-01-10 02:39:15,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2025-01-10 02:39:15,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 324. [2025-01-10 02:39:15,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 231 states have (on average 1.367965367965368) internal successors, (316), 235 states have internal predecessors, (316), 75 states have call successors, (75), 14 states have call predecessors, (75), 14 states have return successors, (81), 74 states have call predecessors, (81), 73 states have call successors, (81) [2025-01-10 02:39:15,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 472 transitions. [2025-01-10 02:39:15,556 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 472 transitions. Word has length 70 [2025-01-10 02:39:15,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:39:15,556 INFO L471 AbstractCegarLoop]: Abstraction has 324 states and 472 transitions. [2025-01-10 02:39:15,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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-01-10 02:39:15,556 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 472 transitions. [2025-01-10 02:39:15,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-01-10 02:39:15,557 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:39:15,557 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] [2025-01-10 02:39:15,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 02:39:15,558 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ##fun~$Pointer$~TO~$Pointer$Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-01-10 02:39:15,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:39:15,558 INFO L85 PathProgramCache]: Analyzing trace with hash -944586193, now seen corresponding path program 2 times [2025-01-10 02:39:15,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:39:15,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820003888] [2025-01-10 02:39:15,558 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 02:39:15,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:39:15,593 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 72 statements into 2 equivalence classes. [2025-01-10 02:39:15,601 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 72 statements. [2025-01-10 02:39:15,601 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 02:39:15,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:39:15,683 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-01-10 02:39:15,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:39:15,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820003888] [2025-01-10 02:39:15,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820003888] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:39:15,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:39:15,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 02:39:15,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879744209] [2025-01-10 02:39:15,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:39:15,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:39:15,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:39:15,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:39:15,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:39:15,685 INFO L87 Difference]: Start difference. First operand 324 states and 472 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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-01-10 02:39:15,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:39:15,872 INFO L93 Difference]: Finished difference Result 532 states and 767 transitions. [2025-01-10 02:39:15,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 02:39:15,873 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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 72 [2025-01-10 02:39:15,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:39:15,875 INFO L225 Difference]: With dead ends: 532 [2025-01-10 02:39:15,875 INFO L226 Difference]: Without dead ends: 263 [2025-01-10 02:39:15,876 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-01-10 02:39:15,876 INFO L435 NwaCegarLoop]: 267 mSDtfsCounter, 111 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 02:39:15,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 730 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 02:39:15,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2025-01-10 02:39:15,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 261. [2025-01-10 02:39:15,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 190 states have (on average 1.3210526315789475) internal successors, (251), 194 states have internal predecessors, (251), 55 states have call successors, (55), 12 states have call predecessors, (55), 12 states have return successors, (59), 54 states have call predecessors, (59), 53 states have call successors, (59) [2025-01-10 02:39:15,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 365 transitions. [2025-01-10 02:39:15,910 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 365 transitions. Word has length 72 [2025-01-10 02:39:15,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:39:15,910 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 365 transitions. [2025-01-10 02:39:15,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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-01-10 02:39:15,911 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 365 transitions. [2025-01-10 02:39:15,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-01-10 02:39:15,911 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:39:15,914 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, 1] [2025-01-10 02:39:15,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 02:39:15,914 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ##fun~$Pointer$~TO~$Pointer$Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-01-10 02:39:15,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:39:15,915 INFO L85 PathProgramCache]: Analyzing trace with hash -2064152906, now seen corresponding path program 1 times [2025-01-10 02:39:15,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:39:15,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732813091] [2025-01-10 02:39:15,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:39:15,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:39:15,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-01-10 02:39:15,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-01-10 02:39:15,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:39:15,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:39:16,203 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-01-10 02:39:16,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:39:16,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732813091] [2025-01-10 02:39:16,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732813091] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:39:16,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:39:16,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 02:39:16,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876733870] [2025-01-10 02:39:16,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:39:16,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:39:16,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:39:16,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:39:16,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:39:16,204 INFO L87 Difference]: Start difference. First operand 261 states and 365 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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-01-10 02:39:17,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:39:17,200 INFO L93 Difference]: Finished difference Result 271 states and 372 transitions. [2025-01-10 02:39:17,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 02:39:17,200 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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 74 [2025-01-10 02:39:17,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:39:17,204 INFO L225 Difference]: With dead ends: 271 [2025-01-10 02:39:17,204 INFO L226 Difference]: Without dead ends: 205 [2025-01-10 02:39:17,204 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-01-10 02:39:17,205 INFO L435 NwaCegarLoop]: 268 mSDtfsCounter, 85 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 732 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:39:17,205 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 732 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-10 02:39:17,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-01-10 02:39:17,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2025-01-10 02:39:17,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 148 states have (on average 1.304054054054054) internal successors, (193), 153 states have internal predecessors, (193), 44 states have call successors, (44), 9 states have call predecessors, (44), 9 states have return successors, (47), 42 states have call predecessors, (47), 43 states have call successors, (47) [2025-01-10 02:39:17,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 284 transitions. [2025-01-10 02:39:17,217 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 284 transitions. Word has length 74 [2025-01-10 02:39:17,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:39:17,217 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 284 transitions. [2025-01-10 02:39:17,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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-01-10 02:39:17,217 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 284 transitions. [2025-01-10 02:39:17,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-01-10 02:39:17,219 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:39:17,219 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:39:17,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 02:39:17,220 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ##fun~$Pointer$~TO~$Pointer$Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-01-10 02:39:17,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:39:17,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1276972775, now seen corresponding path program 1 times [2025-01-10 02:39:17,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:39:17,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005095055] [2025-01-10 02:39:17,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:39:17,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:39:17,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-01-10 02:39:17,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-01-10 02:39:17,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:39:17,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:39:18,255 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2025-01-10 02:39:18,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:39:18,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005095055] [2025-01-10 02:39:18,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005095055] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:39:18,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1425283537] [2025-01-10 02:39:18,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:39:18,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:39:18,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:39:18,259 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:39:18,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-10 02:39:18,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-01-10 02:39:18,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-01-10 02:39:18,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:39:18,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:39:18,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 1271 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-01-10 02:39:18,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:39:18,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-01-10 02:39:18,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-01-10 02:39:18,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 1 [2025-01-10 02:39:18,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-01-10 02:39:18,990 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 48 proven. 2 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2025-01-10 02:39:18,990 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:39:19,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1425283537] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:39:19,157 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 02:39:19,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2025-01-10 02:39:19,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648938811] [2025-01-10 02:39:19,158 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 02:39:19,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-10 02:39:19,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:39:19,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-10 02:39:19,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2025-01-10 02:39:19,159 INFO L87 Difference]: Start difference. First operand 205 states and 284 transitions. Second operand has 17 states, 14 states have (on average 6.857142857142857) internal successors, (96), 17 states have internal predecessors, (96), 9 states have call successors, (18), 6 states have call predecessors, (18), 5 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) [2025-01-10 02:39:24,317 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-10 02:39:27,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:39:27,055 INFO L93 Difference]: Finished difference Result 812 states and 1209 transitions. [2025-01-10 02:39:27,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-01-10 02:39:27,055 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 6.857142857142857) internal successors, (96), 17 states have internal predecessors, (96), 9 states have call successors, (18), 6 states have call predecessors, (18), 5 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) Word has length 120 [2025-01-10 02:39:27,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:39:27,060 INFO L225 Difference]: With dead ends: 812 [2025-01-10 02:39:27,060 INFO L226 Difference]: Without dead ends: 635 [2025-01-10 02:39:27,062 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 540 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=365, Invalid=1891, Unknown=0, NotChecked=0, Total=2256 [2025-01-10 02:39:27,063 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 1804 mSDsluCounter, 2243 mSDsCounter, 0 mSdLazyCounter, 2162 mSolverCounterSat, 1126 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1814 SdHoareTripleChecker+Valid, 2500 SdHoareTripleChecker+Invalid, 3289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1126 IncrementalHoareTripleChecker+Valid, 2162 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2025-01-10 02:39:27,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1814 Valid, 2500 Invalid, 3289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1126 Valid, 2162 Invalid, 1 Unknown, 0 Unchecked, 7.2s Time] [2025-01-10 02:39:27,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2025-01-10 02:39:27,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 597. [2025-01-10 02:39:27,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 407 states have (on average 1.371007371007371) internal successors, (558), 411 states have internal predecessors, (558), 158 states have call successors, (158), 25 states have call predecessors, (158), 28 states have return successors, (189), 160 states have call predecessors, (189), 155 states have call successors, (189) [2025-01-10 02:39:27,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 905 transitions. [2025-01-10 02:39:27,106 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 905 transitions. Word has length 120 [2025-01-10 02:39:27,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:39:27,107 INFO L471 AbstractCegarLoop]: Abstraction has 597 states and 905 transitions. [2025-01-10 02:39:27,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 6.857142857142857) internal successors, (96), 17 states have internal predecessors, (96), 9 states have call successors, (18), 6 states have call predecessors, (18), 5 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) [2025-01-10 02:39:27,107 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 905 transitions. [2025-01-10 02:39:27,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-01-10 02:39:27,109 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:39:27,109 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:39:27,122 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-10 02:39:27,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:39:27,310 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ##fun~$Pointer$~TO~$Pointer$Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-01-10 02:39:27,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:39:27,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1661685071, now seen corresponding path program 1 times [2025-01-10 02:39:27,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:39:27,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55723794] [2025-01-10 02:39:27,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:39:27,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:39:27,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-10 02:39:27,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-10 02:39:27,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:39:27,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:39:28,259 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2025-01-10 02:39:28,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:39:28,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55723794] [2025-01-10 02:39:28,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55723794] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:39:28,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1037322408] [2025-01-10 02:39:28,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:39:28,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:39:28,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:39:28,263 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:39:28,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-10 02:39:28,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-10 02:39:28,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-10 02:39:28,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:39:28,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:39:28,707 INFO L256 TraceCheckSpWp]: Trace formula consists of 1265 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-01-10 02:39:28,711 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:39:28,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 1 [2025-01-10 02:39:28,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2025-01-10 02:39:28,974 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 64 proven. 2 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2025-01-10 02:39:28,974 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:39:29,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2025-01-10 02:39:29,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2025-01-10 02:39:29,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2025-01-10 02:39:29,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2025-01-10 02:39:29,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2025-01-10 02:39:29,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2025-01-10 02:39:29,547 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2025-01-10 02:39:29,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1037322408] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:39:29,547 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:39:29,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 28 [2025-01-10 02:39:29,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481974798] [2025-01-10 02:39:29,547 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:39:29,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-01-10 02:39:29,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:39:29,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-01-10 02:39:29,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=673, Unknown=0, NotChecked=0, Total=756 [2025-01-10 02:39:29,548 INFO L87 Difference]: Start difference. First operand 597 states and 905 transitions. Second operand has 28 states, 24 states have (on average 4.583333333333333) internal successors, (110), 27 states have internal predecessors, (110), 12 states have call successors, (23), 9 states have call predecessors, (23), 9 states have return successors, (21), 9 states have call predecessors, (21), 10 states have call successors, (21) [2025-01-10 02:39:33,794 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-10 02:39:40,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:39:40,456 INFO L93 Difference]: Finished difference Result 1749 states and 2593 transitions. [2025-01-10 02:39:40,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2025-01-10 02:39:40,457 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 24 states have (on average 4.583333333333333) internal successors, (110), 27 states have internal predecessors, (110), 12 states have call successors, (23), 9 states have call predecessors, (23), 9 states have return successors, (21), 9 states have call predecessors, (21), 10 states have call successors, (21) Word has length 116 [2025-01-10 02:39:40,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:39:40,465 INFO L225 Difference]: With dead ends: 1749 [2025-01-10 02:39:40,466 INFO L226 Difference]: Without dead ends: 1115 [2025-01-10 02:39:40,471 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 224 SyntacticMatches, 3 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2125 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1301, Invalid=6889, Unknown=0, NotChecked=0, Total=8190 [2025-01-10 02:39:40,472 INFO L435 NwaCegarLoop]: 389 mSDtfsCounter, 2654 mSDsluCounter, 4184 mSDsCounter, 0 mSdLazyCounter, 5095 mSolverCounterSat, 1553 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2664 SdHoareTripleChecker+Valid, 4573 SdHoareTripleChecker+Invalid, 6649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1553 IncrementalHoareTripleChecker+Valid, 5095 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2025-01-10 02:39:40,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2664 Valid, 4573 Invalid, 6649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1553 Valid, 5095 Invalid, 1 Unknown, 0 Unchecked, 8.8s Time] [2025-01-10 02:39:40,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1115 states. [2025-01-10 02:39:40,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1115 to 1030. [2025-01-10 02:39:40,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1030 states, 718 states have (on average 1.3565459610027855) internal successors, (974), 726 states have internal predecessors, (974), 252 states have call successors, (252), 52 states have call predecessors, (252), 56 states have return successors, (293), 251 states have call predecessors, (293), 245 states have call successors, (293) [2025-01-10 02:39:40,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1030 states to 1030 states and 1519 transitions. [2025-01-10 02:39:40,569 INFO L78 Accepts]: Start accepts. Automaton has 1030 states and 1519 transitions. Word has length 116 [2025-01-10 02:39:40,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:39:40,569 INFO L471 AbstractCegarLoop]: Abstraction has 1030 states and 1519 transitions. [2025-01-10 02:39:40,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 24 states have (on average 4.583333333333333) internal successors, (110), 27 states have internal predecessors, (110), 12 states have call successors, (23), 9 states have call predecessors, (23), 9 states have return successors, (21), 9 states have call predecessors, (21), 10 states have call successors, (21) [2025-01-10 02:39:40,569 INFO L276 IsEmpty]: Start isEmpty. Operand 1030 states and 1519 transitions. [2025-01-10 02:39:40,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-01-10 02:39:40,572 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:39:40,572 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:39:40,581 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-01-10 02:39:40,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-01-10 02:39:40,773 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ##fun~$Pointer$~TO~$Pointer$Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-01-10 02:39:40,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:39:40,774 INFO L85 PathProgramCache]: Analyzing trace with hash 2020962445, now seen corresponding path program 1 times [2025-01-10 02:39:40,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:39:40,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905882684] [2025-01-10 02:39:40,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:39:40,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:39:40,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-10 02:39:40,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-10 02:39:40,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:39:40,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:39:41,336 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2025-01-10 02:39:41,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:39:41,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905882684] [2025-01-10 02:39:41,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905882684] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:39:41,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:39:41,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-10 02:39:41,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938910486] [2025-01-10 02:39:41,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:39:41,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 02:39:41,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:39:41,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 02:39:41,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-01-10 02:39:41,339 INFO L87 Difference]: Start difference. First operand 1030 states and 1519 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 7 states have internal predecessors, (53), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-10 02:39:41,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:39:41,848 INFO L93 Difference]: Finished difference Result 2470 states and 3671 transitions. [2025-01-10 02:39:41,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 02:39:41,849 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 7 states have internal predecessors, (53), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 116 [2025-01-10 02:39:41,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:39:41,856 INFO L225 Difference]: With dead ends: 2470 [2025-01-10 02:39:41,857 INFO L226 Difference]: Without dead ends: 1508 [2025-01-10 02:39:41,860 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2025-01-10 02:39:41,861 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 378 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-10 02:39:41,861 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [396 Valid, 490 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-10 02:39:41,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1508 states. [2025-01-10 02:39:41,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1508 to 1347. [2025-01-10 02:39:41,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1347 states, 957 states have (on average 1.2654127481713688) internal successors, (1211), 934 states have internal predecessors, (1211), 296 states have call successors, (296), 61 states have call predecessors, (296), 90 states have return successors, (411), 351 states have call predecessors, (411), 289 states have call successors, (411) [2025-01-10 02:39:41,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1347 states to 1347 states and 1918 transitions. [2025-01-10 02:39:41,959 INFO L78 Accepts]: Start accepts. Automaton has 1347 states and 1918 transitions. Word has length 116 [2025-01-10 02:39:41,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:39:41,960 INFO L471 AbstractCegarLoop]: Abstraction has 1347 states and 1918 transitions. [2025-01-10 02:39:41,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 7 states have internal predecessors, (53), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-10 02:39:41,960 INFO L276 IsEmpty]: Start isEmpty. Operand 1347 states and 1918 transitions. [2025-01-10 02:39:41,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-10 02:39:41,961 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:39:41,962 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:39:41,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-10 02:39:41,962 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ##fun~$Pointer$~TO~$Pointer$Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-01-10 02:39:41,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:39:41,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1455873087, now seen corresponding path program 1 times [2025-01-10 02:39:41,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:39:41,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102328536] [2025-01-10 02:39:41,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:39:41,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:39:42,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-10 02:39:42,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-10 02:39:42,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:39:42,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:39:43,097 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 18 proven. 22 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-01-10 02:39:43,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:39:43,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102328536] [2025-01-10 02:39:43,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102328536] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:39:43,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1817889687] [2025-01-10 02:39:43,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:39:43,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:39:43,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:39:43,100 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:39:43,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-10 02:39:43,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-10 02:39:43,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-10 02:39:43,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:39:43,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:39:43,514 INFO L256 TraceCheckSpWp]: Trace formula consists of 1276 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-01-10 02:39:43,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:39:43,723 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2025-01-10 02:39:43,723 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:39:43,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1817889687] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:39:43,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 02:39:43,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [10] total 18 [2025-01-10 02:39:43,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111243074] [2025-01-10 02:39:43,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:39:43,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 02:39:43,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:39:43,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 02:39:43,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2025-01-10 02:39:43,724 INFO L87 Difference]: Start difference. First operand 1347 states and 1918 transitions. Second operand has 12 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 5 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2025-01-10 02:39:45,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:39:45,195 INFO L93 Difference]: Finished difference Result 3390 states and 4878 transitions. [2025-01-10 02:39:45,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-01-10 02:39:45,195 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 5 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) Word has length 119 [2025-01-10 02:39:45,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:39:45,209 INFO L225 Difference]: With dead ends: 3390 [2025-01-10 02:39:45,209 INFO L226 Difference]: Without dead ends: 2154 [2025-01-10 02:39:45,215 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=332, Invalid=1000, Unknown=0, NotChecked=0, Total=1332 [2025-01-10 02:39:45,215 INFO L435 NwaCegarLoop]: 217 mSDtfsCounter, 737 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 1416 mSolverCounterSat, 534 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 746 SdHoareTripleChecker+Valid, 773 SdHoareTripleChecker+Invalid, 1950 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 534 IncrementalHoareTripleChecker+Valid, 1416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:39:45,215 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [746 Valid, 773 Invalid, 1950 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [534 Valid, 1416 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-10 02:39:45,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2154 states. [2025-01-10 02:39:45,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2154 to 1745. [2025-01-10 02:39:45,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1745 states, 1252 states have (on average 1.2579872204472844) internal successors, (1575), 1216 states have internal predecessors, (1575), 358 states have call successors, (358), 77 states have call predecessors, (358), 131 states have return successors, (583), 451 states have call predecessors, (583), 351 states have call successors, (583) [2025-01-10 02:39:45,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1745 states to 1745 states and 2516 transitions. [2025-01-10 02:39:45,484 INFO L78 Accepts]: Start accepts. Automaton has 1745 states and 2516 transitions. Word has length 119 [2025-01-10 02:39:45,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:39:45,484 INFO L471 AbstractCegarLoop]: Abstraction has 1745 states and 2516 transitions. [2025-01-10 02:39:45,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 5 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2025-01-10 02:39:45,484 INFO L276 IsEmpty]: Start isEmpty. Operand 1745 states and 2516 transitions. [2025-01-10 02:39:45,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-10 02:39:45,486 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:39:45,486 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:39:45,515 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-01-10 02:39:45,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-01-10 02:39:45,687 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ##fun~$Pointer$~TO~$Pointer$Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-01-10 02:39:45,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:39:45,687 INFO L85 PathProgramCache]: Analyzing trace with hash 426513789, now seen corresponding path program 1 times [2025-01-10 02:39:45,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:39:45,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890150537] [2025-01-10 02:39:45,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:39:45,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:39:45,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-10 02:39:46,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-10 02:39:46,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:39:46,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:39:47,551 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 16 proven. 64 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2025-01-10 02:39:47,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:39:47,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890150537] [2025-01-10 02:39:47,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890150537] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:39:47,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1602601358] [2025-01-10 02:39:47,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:39:47,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:39:47,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:39:47,553 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:39:47,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-10 02:39:47,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-10 02:39:48,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-10 02:39:48,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:39:48,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:39:48,097 INFO L256 TraceCheckSpWp]: Trace formula consists of 1265 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-01-10 02:39:48,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:39:48,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-10 02:39:48,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2025-01-10 02:39:48,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2025-01-10 02:39:48,342 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 02:39:48,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 9 [2025-01-10 02:39:48,713 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 02:39:48,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 28 [2025-01-10 02:39:48,751 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 56 proven. 64 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-01-10 02:39:48,752 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:39:48,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1602601358] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:39:48,901 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 02:39:48,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 25 [2025-01-10 02:39:48,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824716814] [2025-01-10 02:39:48,901 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 02:39:48,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-01-10 02:39:48,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:39:48,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-01-10 02:39:48,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=679, Unknown=0, NotChecked=0, Total=812 [2025-01-10 02:39:48,903 INFO L87 Difference]: Start difference. First operand 1745 states and 2516 transitions. Second operand has 26 states, 25 states have (on average 5.16) internal successors, (129), 24 states have internal predecessors, (129), 5 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 7 states have call predecessors, (16), 5 states have call successors, (16) [2025-01-10 02:39:54,627 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-10 02:39:58,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:39:58,306 INFO L93 Difference]: Finished difference Result 3259 states and 4583 transitions. [2025-01-10 02:39:58,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-10 02:39:58,307 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 5.16) internal successors, (129), 24 states have internal predecessors, (129), 5 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 7 states have call predecessors, (16), 5 states have call successors, (16) Word has length 119 [2025-01-10 02:39:58,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:39:58,320 INFO L225 Difference]: With dead ends: 3259 [2025-01-10 02:39:58,321 INFO L226 Difference]: Without dead ends: 2966 [2025-01-10 02:39:58,324 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 112 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 514 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=400, Invalid=1580, Unknown=0, NotChecked=0, Total=1980 [2025-01-10 02:39:58,324 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 1261 mSDsluCounter, 1394 mSDsCounter, 0 mSdLazyCounter, 2113 mSolverCounterSat, 650 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1266 SdHoareTripleChecker+Valid, 1529 SdHoareTripleChecker+Invalid, 2764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 650 IncrementalHoareTripleChecker+Valid, 2113 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2025-01-10 02:39:58,324 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1266 Valid, 1529 Invalid, 2764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [650 Valid, 2113 Invalid, 1 Unknown, 0 Unchecked, 8.6s Time] [2025-01-10 02:39:58,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2966 states. [2025-01-10 02:39:58,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2966 to 2810. [2025-01-10 02:39:58,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2810 states, 2028 states have (on average 1.235207100591716) internal successors, (2505), 1993 states have internal predecessors, (2505), 543 states have call successors, (543), 135 states have call predecessors, (543), 235 states have return successors, (892), 681 states have call predecessors, (892), 529 states have call successors, (892) [2025-01-10 02:39:58,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2810 states to 2810 states and 3940 transitions. [2025-01-10 02:39:58,588 INFO L78 Accepts]: Start accepts. Automaton has 2810 states and 3940 transitions. Word has length 119 [2025-01-10 02:39:58,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:39:58,588 INFO L471 AbstractCegarLoop]: Abstraction has 2810 states and 3940 transitions. [2025-01-10 02:39:58,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 5.16) internal successors, (129), 24 states have internal predecessors, (129), 5 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 7 states have call predecessors, (16), 5 states have call successors, (16) [2025-01-10 02:39:58,588 INFO L276 IsEmpty]: Start isEmpty. Operand 2810 states and 3940 transitions. [2025-01-10 02:39:58,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-01-10 02:39:58,590 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:39:58,590 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:39:58,606 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-01-10 02:39:58,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:39:58,791 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ##fun~$Pointer$~TO~$Pointer$Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-01-10 02:39:58,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:39:58,791 INFO L85 PathProgramCache]: Analyzing trace with hash 337025835, now seen corresponding path program 1 times [2025-01-10 02:39:58,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:39:58,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290762142] [2025-01-10 02:39:58,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:39:58,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:39:58,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-01-10 02:39:59,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-01-10 02:39:59,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:39:59,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 02:39:59,023 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 02:39:59,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-01-10 02:39:59,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-01-10 02:39:59,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:39:59,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 02:39:59,266 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 02:39:59,266 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 02:39:59,267 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ##fun~$Pointer$~TO~$Pointer$Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 16 remaining) [2025-01-10 02:39:59,268 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location __CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 16 remaining) [2025-01-10 02:39:59,268 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 16 remaining) [2025-01-10 02:39:59,268 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ##fun~$Pointer$~TO~$Pointer$Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 16 remaining) [2025-01-10 02:39:59,268 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ##fun~$Pointer$~TO~$Pointer$Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 16 remaining) [2025-01-10 02:39:59,268 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ##fun~$Pointer$~TO~$Pointer$Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 16 remaining) [2025-01-10 02:39:59,268 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location __CS_csErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 16 remaining) [2025-01-10 02:39:59,268 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location __CS_csErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 16 remaining) [2025-01-10 02:39:59,269 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location __CS_csErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 16 remaining) [2025-01-10 02:39:59,269 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location __CS_csErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 16 remaining) [2025-01-10 02:39:59,269 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location __CS_pthread_mutex_unlockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 16 remaining) [2025-01-10 02:39:59,269 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location __CS_pthread_mutex_unlockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 16 remaining) [2025-01-10 02:39:59,269 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 16 remaining) [2025-01-10 02:39:59,270 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 16 remaining) [2025-01-10 02:39:59,270 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 16 remaining) [2025-01-10 02:39:59,270 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 16 remaining) [2025-01-10 02:39:59,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-10 02:39:59,272 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:39:59,359 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 02:39:59,363 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 02:39:59 BoogieIcfgContainer [2025-01-10 02:39:59,364 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 02:39:59,365 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 02:39:59,365 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 02:39:59,365 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 02:39:59,366 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:39:03" (3/4) ... [2025-01-10 02:39:59,366 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-01-10 02:39:59,449 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 48. [2025-01-10 02:39:59,510 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 02:39:59,510 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 02:39:59,510 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 02:39:59,511 INFO L158 Benchmark]: Toolchain (without parser) took 57111.62ms. Allocated memory was 142.6MB in the beginning and 830.5MB in the end (delta: 687.9MB). Free memory was 108.4MB in the beginning and 669.0MB in the end (delta: -560.6MB). Peak memory consumption was 133.2MB. Max. memory is 16.1GB. [2025-01-10 02:39:59,511 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 127.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 02:39:59,511 INFO L158 Benchmark]: CACSL2BoogieTranslator took 358.41ms. Allocated memory is still 142.6MB. Free memory was 108.4MB in the beginning and 83.0MB in the end (delta: 25.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-10 02:39:59,511 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.01ms. Allocated memory is still 142.6MB. Free memory was 83.0MB in the beginning and 78.7MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 02:39:59,511 INFO L158 Benchmark]: Boogie Preprocessor took 117.19ms. Allocated memory is still 142.6MB. Free memory was 78.7MB in the beginning and 71.4MB in the end (delta: 7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 02:39:59,511 INFO L158 Benchmark]: RCFGBuilder took 778.30ms. Allocated memory is still 142.6MB. Free memory was 71.4MB in the beginning and 78.9MB in the end (delta: -7.5MB). Peak memory consumption was 43.1MB. Max. memory is 16.1GB. [2025-01-10 02:39:59,512 INFO L158 Benchmark]: TraceAbstraction took 55668.83ms. Allocated memory was 142.6MB in the beginning and 830.5MB in the end (delta: 687.9MB). Free memory was 78.3MB in the beginning and 690.0MB in the end (delta: -611.7MB). Peak memory consumption was 475.9MB. Max. memory is 16.1GB. [2025-01-10 02:39:59,512 INFO L158 Benchmark]: Witness Printer took 145.19ms. Allocated memory is still 830.5MB. Free memory was 690.0MB in the beginning and 669.0MB in the end (delta: 21.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-10 02:39:59,513 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.22ms. Allocated memory is still 201.3MB. Free memory is still 127.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 358.41ms. Allocated memory is still 142.6MB. Free memory was 108.4MB in the beginning and 83.0MB in the end (delta: 25.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.01ms. Allocated memory is still 142.6MB. Free memory was 83.0MB in the beginning and 78.7MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 117.19ms. Allocated memory is still 142.6MB. Free memory was 78.7MB in the beginning and 71.4MB in the end (delta: 7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 778.30ms. Allocated memory is still 142.6MB. Free memory was 71.4MB in the beginning and 78.9MB in the end (delta: -7.5MB). Peak memory consumption was 43.1MB. Max. memory is 16.1GB. * TraceAbstraction took 55668.83ms. Allocated memory was 142.6MB in the beginning and 830.5MB in the end (delta: 687.9MB). Free memory was 78.3MB in the beginning and 690.0MB in the end (delta: -611.7MB). Peak memory consumption was 475.9MB. Max. memory is 16.1GB. * Witness Printer took 145.19ms. Allocated memory is still 830.5MB. Free memory was 690.0MB in the beginning and 669.0MB in the end (delta: 21.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * 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 - CounterExampleResult [Line: 686]: integer overflow possible integer overflow possible We found a FailurePath: [L540] unsigned char __CS_round = 0; [L541] unsigned char __CS_ret = 0; [L542] const unsigned char __CS_ret_PREEMPTED = 0x01; [L543] const unsigned char __CS_ret_ERROR = 0x02; [L544] const unsigned char __CS_ret_FINISHED = 0x04; [L545] unsigned char __CS_error = 0; [L546] unsigned char __CS_thread_index; [L547] unsigned char __CS_thread_allocated[3 +1]; [L547] unsigned char __CS_thread_allocated[3 +1]; [L547] unsigned char __CS_thread_allocated[3 +1]; [L547] unsigned char __CS_thread_allocated[3 +1]; [L547] unsigned char __CS_thread_allocated[3 +1]; [L548] unsigned char __CS_thread_born_round[3 +1]; [L548] unsigned char __CS_thread_born_round[3 +1]; [L548] unsigned char __CS_thread_born_round[3 +1]; [L548] unsigned char __CS_thread_born_round[3 +1]; [L548] unsigned char __CS_thread_born_round[3 +1]; [L549] void *(*__CS_thread[3 +1])(void *); [L549] void *(*__CS_thread[3 +1])(void *); [L549] void *(*__CS_thread[3 +1])(void *); [L549] void *(*__CS_thread[3 +1])(void *); [L549] void *(*__CS_thread[3 +1])(void *); [L550] unsigned char __CS_thread_status[2][3 +1]; [L550] unsigned char __CS_thread_status[2][3 +1]; [L550] unsigned char __CS_thread_status[2][3 +1]; [L550] unsigned char __CS_thread_status[2][3 +1]; [L550] unsigned char __CS_thread_status[2][3 +1]; [L550] unsigned char __CS_thread_status[2][3 +1]; [L550] unsigned char __CS_thread_status[2][3 +1]; [L550] unsigned char __CS_thread_status[2][3 +1]; [L550] unsigned char __CS_thread_status[2][3 +1]; [L551] const unsigned char __THREAD_UNUSED = 0x00; [L552] const unsigned char __THREAD_RUNNING = 0x01; [L553] const unsigned char __THREAD_FINISHED = 0x02; [L554] unsigned char *__CS_thread_lockedon[2][3 +1]; [L554] unsigned char *__CS_thread_lockedon[2][3 +1]; [L554] unsigned char *__CS_thread_lockedon[2][3 +1]; [L554] unsigned char *__CS_thread_lockedon[2][3 +1]; [L554] unsigned char *__CS_thread_lockedon[2][3 +1]; [L554] unsigned char *__CS_thread_lockedon[2][3 +1]; [L554] unsigned char *__CS_thread_lockedon[2][3 +1]; [L554] unsigned char *__CS_thread_lockedon[2][3 +1]; [L554] unsigned char *__CS_thread_lockedon[2][3 +1]; [L674] unsigned char mutex[2]; [L674] unsigned char mutex[2]; [L674] unsigned char mutex[2]; [L675] int data[2] = {0}; [L675] int data[2] = {0}; [L675] int data[2] = {0}; [L680] union __CS__u __CS_u; VAL [__CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread={5:0}, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={7:0}, __CS_thread_status={6:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={9:0}, mutex={8:0}] [L743] unsigned char __CS_cp___CS_thread_status[2][3 +1]; [L744] unsigned char *__CS_cp___CS_thread_lockedon[2][3 +1]; [L745] unsigned char __CS_cp_mutex[2]; [L746] int __CS_cp_data[2]; [L747] int i = 0; VAL [__CS_cp___CS_thread_lockedon={13:0}, __CS_cp___CS_thread_status={17:0}, __CS_cp_data={14:0}, __CS_cp_mutex={15:0}, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread={5:0}, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={7:0}, __CS_thread_status={6:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={9:0}, i=0, mutex={8:0}] [L747] COND TRUE i < 2 [L748] int j = 0; VAL [__CS_cp___CS_thread_lockedon={13:0}, __CS_cp___CS_thread_status={17:0}, __CS_cp_data={14:0}, __CS_cp_mutex={15:0}, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread={5:0}, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={7:0}, __CS_thread_status={6:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={9:0}, i=0, j=0, mutex={8:0}] [L748] COND TRUE j < 3 +1 [L749] __CS_cp___CS_thread_status[i][j] = __VERIFIER_nondet_uchar() [L750] __CS_cp___CS_thread_lockedon[i][j] = (void *)__VERIFIER_nondet_ulong() [L748] ++j VAL [__CS_cp___CS_thread_lockedon={13:0}, __CS_cp___CS_thread_status={17:0}, __CS_cp_data={14:0}, __CS_cp_mutex={15:0}, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread={5:0}, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={7:0}, __CS_thread_status={6:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={9:0}, i=0, j=1, mutex={8:0}] [L748] COND TRUE j < 3 +1 [L749] __CS_cp___CS_thread_status[i][j] = __VERIFIER_nondet_uchar() [L750] __CS_cp___CS_thread_lockedon[i][j] = (void *)__VERIFIER_nondet_ulong() [L748] ++j VAL [__CS_cp___CS_thread_lockedon={13:0}, __CS_cp___CS_thread_status={17:0}, __CS_cp_data={14:0}, __CS_cp_mutex={15:0}, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread={5:0}, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={7:0}, __CS_thread_status={6:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={9:0}, i=0, j=2, mutex={8:0}] [L748] COND TRUE j < 3 +1 [L749] __CS_cp___CS_thread_status[i][j] = __VERIFIER_nondet_uchar() [L750] __CS_cp___CS_thread_lockedon[i][j] = (void *)__VERIFIER_nondet_ulong() [L748] ++j VAL [__CS_cp___CS_thread_lockedon={13:0}, __CS_cp___CS_thread_status={17:0}, __CS_cp_data={14:0}, __CS_cp_mutex={15:0}, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread={5:0}, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={7:0}, __CS_thread_status={6:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={9:0}, i=0, j=3, mutex={8:0}] [L748] COND TRUE j < 3 +1 [L749] __CS_cp___CS_thread_status[i][j] = __VERIFIER_nondet_uchar() [L750] __CS_cp___CS_thread_lockedon[i][j] = (void *)__VERIFIER_nondet_ulong() [L748] ++j VAL [__CS_cp___CS_thread_lockedon={13:0}, __CS_cp___CS_thread_status={17:0}, __CS_cp_data={14:0}, __CS_cp_mutex={15:0}, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread={5:0}, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={7:0}, __CS_thread_status={6:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={9:0}, i=0, j=4, mutex={8:0}] [L748] COND FALSE !(j < 3 +1) [L752] __CS_cp_mutex[i] = __VERIFIER_nondet_uchar() [L753] __CS_cp_data[i] = __VERIFIER_nondet_int() [L747] ++i VAL [__CS_cp___CS_thread_lockedon={13:0}, __CS_cp___CS_thread_status={17:0}, __CS_cp_data={14:0}, __CS_cp_mutex={15:0}, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread={5:0}, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={7:0}, __CS_thread_status={6:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={9:0}, i=1, mutex={8:0}] [L747] COND TRUE i < 2 [L748] int j = 0; VAL [__CS_cp___CS_thread_lockedon={13:0}, __CS_cp___CS_thread_status={17:0}, __CS_cp_data={14:0}, __CS_cp_mutex={15:0}, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread={5:0}, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={7:0}, __CS_thread_status={6:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={9:0}, i=1, j=0, mutex={8:0}] [L748] COND TRUE j < 3 +1 [L749] __CS_cp___CS_thread_status[i][j] = __VERIFIER_nondet_uchar() [L750] __CS_cp___CS_thread_lockedon[i][j] = (void *)__VERIFIER_nondet_ulong() [L748] ++j VAL [__CS_cp___CS_thread_lockedon={13:0}, __CS_cp___CS_thread_status={17:0}, __CS_cp_data={14:0}, __CS_cp_mutex={15:0}, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread={5:0}, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={7:0}, __CS_thread_status={6:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={9:0}, i=1, j=1, mutex={8:0}] [L748] COND TRUE j < 3 +1 [L749] __CS_cp___CS_thread_status[i][j] = __VERIFIER_nondet_uchar() [L750] __CS_cp___CS_thread_lockedon[i][j] = (void *)__VERIFIER_nondet_ulong() [L748] ++j VAL [__CS_cp___CS_thread_lockedon={13:0}, __CS_cp___CS_thread_status={17:0}, __CS_cp_data={14:0}, __CS_cp_mutex={15:0}, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread={5:0}, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={7:0}, __CS_thread_status={6:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={9:0}, i=1, j=2, mutex={8:0}] [L748] COND TRUE j < 3 +1 [L749] __CS_cp___CS_thread_status[i][j] = __VERIFIER_nondet_uchar() [L750] __CS_cp___CS_thread_lockedon[i][j] = (void *)__VERIFIER_nondet_ulong() [L748] ++j VAL [__CS_cp___CS_thread_lockedon={13:0}, __CS_cp___CS_thread_status={17:0}, __CS_cp_data={14:0}, __CS_cp_mutex={15:0}, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread={5:0}, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={7:0}, __CS_thread_status={6:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={9:0}, i=1, j=3, mutex={8:0}] [L748] COND TRUE j < 3 +1 [L749] __CS_cp___CS_thread_status[i][j] = __VERIFIER_nondet_uchar() [L750] __CS_cp___CS_thread_lockedon[i][j] = (void *)__VERIFIER_nondet_ulong() [L748] ++j VAL [__CS_cp___CS_thread_lockedon={13:0}, __CS_cp___CS_thread_status={17:0}, __CS_cp_data={14:0}, __CS_cp_mutex={15:0}, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread={5:0}, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={7:0}, __CS_thread_status={6:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={9:0}, i=1, j=4, mutex={8:0}] [L748] COND FALSE !(j < 3 +1) [L752] __CS_cp_mutex[i] = __VERIFIER_nondet_uchar() [L753] __CS_cp_data[i] = __VERIFIER_nondet_int() [L747] ++i VAL [__CS_cp___CS_thread_lockedon={13:0}, __CS_cp___CS_thread_status={17:0}, __CS_cp_data={14:0}, __CS_cp_mutex={15:0}, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread={5:0}, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={7:0}, __CS_thread_status={6:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={9:0}, i=2, mutex={8:0}] [L747] COND FALSE !(i < 2) [L755] EXPR __CS_cp___CS_thread_status[1][0] [L755] __CS_thread_status[1][0] = __CS_cp___CS_thread_status[1][0] [L756] EXPR __CS_cp___CS_thread_status[1][1] [L756] __CS_thread_status[1][1] = __CS_cp___CS_thread_status[1][1] [L757] EXPR __CS_cp___CS_thread_status[1][2] [L757] __CS_thread_status[1][2] = __CS_cp___CS_thread_status[1][2] [L758] EXPR __CS_cp___CS_thread_status[1][3] [L758] __CS_thread_status[1][3] = __CS_cp___CS_thread_status[1][3] [L759] EXPR __CS_cp___CS_thread_lockedon[1][0] [L759] __CS_thread_lockedon[1][0] = __CS_cp___CS_thread_lockedon[1][0] [L760] EXPR __CS_cp___CS_thread_lockedon[1][1] [L760] __CS_thread_lockedon[1][1] = __CS_cp___CS_thread_lockedon[1][1] [L761] EXPR __CS_cp___CS_thread_lockedon[1][2] [L761] __CS_thread_lockedon[1][2] = __CS_cp___CS_thread_lockedon[1][2] [L762] EXPR __CS_cp___CS_thread_lockedon[1][3] [L762] __CS_thread_lockedon[1][3] = __CS_cp___CS_thread_lockedon[1][3] [L763] EXPR __CS_cp_mutex[1] [L763] mutex[1] = __CS_cp_mutex[1] [L764] EXPR __CS_cp_data[1] [L764] data[1] = __CS_cp_data[1] [L765] __CS_round = 0 [L766] __CS_thread_index = 0 [L767] __CS_thread_born_round[0] = __CS_round [L768] __CS_thread_status[0][0] = __THREAD_RUNNING [L769] __CS_thread[0] = main_thread [L770] __CS_thread_allocated[0] = 1 [L771] EXPR __CS_thread_allocated[0] VAL [__CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread={5:0}, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={7:0}, __CS_thread_status={6:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={9:0}, mutex={8:0}] [L771] COND TRUE __CS_thread_allocated[0] == 1 [L772] EXPR __CS_thread_born_round[0] [L772] __CS_round = __CS_thread_born_round[0] [L773] __CS_ret = 0 [L774] EXPR __CS_thread[0] VAL [__CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread={5:0}, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={7:0}, __CS_thread_status={6:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={9:0}, mutex={8:0}] [L774] CALL __CS_thread[0](0) VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=0, \old(__CS_thread_index)=0, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread={5:0}, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={7:0}, __CS_thread_status={6:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={9:0}, mutex={8:0}] [L722] CALL __CS_cs() VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=0, \old(__CS_thread_index)=0, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread={5:0}, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={7:0}, __CS_thread_status={6:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={9:0}, mutex={8:0}] [L560] unsigned char k = __VERIFIER_nondet_uchar(); [L561] EXPR __CS_round+k VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=0, \old(__CS_thread_index)=0, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread={5:0}, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={7:0}, __CS_thread_status={6:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={9:0}, mutex={8:0}] [L561] COND FALSE !(!(__CS_round+k < 2)) VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=0, \old(__CS_thread_index)=0, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread={5:0}, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={7:0}, __CS_thread_status={6:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={9:0}, k=0, mutex={8:0}] [L562] __CS_round += k [L563] __CS_ret = (__VERIFIER_nondet_int() && __CS_round == 2 -1)?__CS_ret_PREEMPTED:__CS_ret [L722] RET __CS_cs() VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=0, \old(__CS_thread_index)=0, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread={5:0}, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={7:0}, __CS_thread_status={6:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={9:0}, mutex={8:0}] [L722] COND FALSE !(__CS_ret != 0) [L723] CALL __CS_pthread_mutex_init(&mutex[__CS_round], 0) [L567] return 0; VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=0, \old(__CS_thread_index)=0, \result=0, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread={5:0}, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={7:0}, __CS_thread_status={6:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={9:0}, mutex={8:0}] [L723] RET __CS_pthread_mutex_init(&mutex[__CS_round], 0) [L724] unsigned char t1; [L725] unsigned char t2; [L726] unsigned char t3; VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=0, \old(__CS_thread_index)=0, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread={5:0}, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={7:0}, __CS_thread_status={6:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={9:0}, mutex={8:0}, t1={18:0}, t2={11:0}, t3={19:0}] [L727] CALL __CS_cs() VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=0, \old(__CS_thread_index)=0, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread={5:0}, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={7:0}, __CS_thread_status={6:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={9:0}, mutex={8:0}] [L560] unsigned char k = __VERIFIER_nondet_uchar(); [L561] EXPR __CS_round+k VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=0, \old(__CS_thread_index)=0, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread={5:0}, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={7:0}, __CS_thread_status={6:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={9:0}, mutex={8:0}] [L561] COND FALSE !(!(__CS_round+k < 2)) VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=0, \old(__CS_thread_index)=0, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread={5:0}, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={7:0}, __CS_thread_status={6:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={9:0}, k=0, mutex={8:0}] [L562] __CS_round += k [L563] __CS_ret = (__VERIFIER_nondet_int() && __CS_round == 2 -1)?__CS_ret_PREEMPTED:__CS_ret [L727] RET __CS_cs() VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=0, \old(__CS_thread_index)=0, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread={5:0}, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={7:0}, __CS_thread_status={6:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={9:0}, mutex={8:0}, t1={18:0}, t2={11:0}, t3={19:0}] [L727] COND FALSE !(__CS_ret != 0) VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=0, \old(__CS_thread_index)=0, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread={5:0}, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={7:0}, __CS_thread_status={6:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={9:0}, mutex={8:0}, t1={18:0}, t2={11:0}, t3={19:0}] [L728] CALL __CS_pthread_create(&t1, 0, thread1, 0) VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=0, \old(__CS_thread_index)=0, \old(arg)={0:0}, \old(attr)={0:0}, \old(id1)={18:0}, \old(t1)={-1:0}, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread={5:0}, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={7:0}, __CS_thread_status={6:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={9:0}, mutex={8:0}] [L662] COND FALSE !(__CS_thread_index == 3) [L666] __CS_thread_index++ [L667] __CS_thread_allocated[__CS_thread_index] = 1 [L668] __CS_thread_born_round[__CS_thread_index] = __CS_round [L669] __CS_thread[__CS_thread_index] = t1 [L670] __CS_thread_status[__CS_round][__CS_thread_index] = __THREAD_RUNNING [L671] *id1 = __CS_thread_index [L672] return __CS_thread_index; VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=0, \old(__CS_thread_index)=0, \old(arg)={0:0}, \old(attr)={0:0}, \old(id1)={18:0}, \old(t1)={-1:0}, \result=1, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread={5:0}, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=1, __CS_thread_lockedon={7:0}, __CS_thread_status={6:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={9:0}, mutex={8:0}] [L728] RET __CS_pthread_create(&t1, 0, thread1, 0) VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=0, \old(__CS_thread_index)=0, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread={5:0}, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=1, __CS_thread_lockedon={7:0}, __CS_thread_status={6:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={9:0}, mutex={8:0}, t1={18:0}, t2={11:0}, t3={19:0}] [L729] CALL __CS_cs() VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=0, \old(__CS_thread_index)=0, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread={5:0}, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=1, __CS_thread_lockedon={7:0}, __CS_thread_status={6:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={9:0}, mutex={8:0}] [L560] unsigned char k = __VERIFIER_nondet_uchar(); [L561] EXPR __CS_round+k VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=0, \old(__CS_thread_index)=0, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread={5:0}, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=1, __CS_thread_lockedon={7:0}, __CS_thread_status={6:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={9:0}, mutex={8:0}] [L561] COND FALSE !(!(__CS_round+k < 2)) VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=0, \old(__CS_thread_index)=0, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread={5:0}, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=1, __CS_thread_lockedon={7:0}, __CS_thread_status={6:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={9:0}, k=1, mutex={8:0}] [L562] __CS_round += k [L563] __CS_ret = (__VERIFIER_nondet_int() && __CS_round == 2 -1)?__CS_ret_PREEMPTED:__CS_ret [L729] RET __CS_cs() VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=0, \old(__CS_thread_index)=0, __CS_error=0, __CS_ret=1, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=1, __CS_thread={5:0}, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=1, __CS_thread_lockedon={7:0}, __CS_thread_status={6:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={9:0}, mutex={8:0}, t1={18:0}, t2={11:0}, t3={19:0}] [L729] COND TRUE __CS_ret != 0 [L729] return 0; [L729] return 0; [L729] return 0; [L729] return 0; VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=0, \old(__CS_thread_index)=0, \result={0:0}, __CS_error=0, __CS_ret=1, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=1, __CS_thread={5:0}, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=1, __CS_thread_lockedon={7:0}, __CS_thread_status={6:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={9:0}, mutex={8:0}] [L774] RET __CS_thread[0](0) VAL [__CS_cp___CS_thread_lockedon={13:0}, __CS_cp___CS_thread_status={17:0}, __CS_cp_data={14:0}, __CS_cp_mutex={15:0}, __CS_error=0, __CS_ret=1, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=1, __CS_thread={5:0}, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=1, __CS_thread_lockedon={7:0}, __CS_thread_status={6:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={9:0}, mutex={8:0}] [L775] COND FALSE !(__CS_ret!=__CS_ret_PREEMPTED) VAL [__CS_error=0, __CS_ret=1, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=1, __CS_thread={5:0}, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=1, __CS_thread_lockedon={7:0}, __CS_thread_status={6:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={9:0}, mutex={8:0}] [L777] EXPR __CS_thread_allocated[1] VAL [__CS_error=0, __CS_ret=1, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=1, __CS_thread={5:0}, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=1, __CS_thread_lockedon={7:0}, __CS_thread_status={6:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={9:0}, mutex={8:0}] [L777] COND TRUE __CS_thread_allocated[1] == 1 [L778] EXPR __CS_thread_born_round[1] [L778] __CS_round = __CS_thread_born_round[1] [L779] __CS_ret = 0 [L780] EXPR __CS_thread[1] VAL [__CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread={5:0}, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=1, __CS_thread_lockedon={7:0}, __CS_thread_status={6:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={9:0}, mutex={8:0}] [L780] CALL __CS_thread[1](0) VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=0, \old(__CS_thread_index)=1, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread={5:0}, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=1, __CS_thread_lockedon={7:0}, __CS_thread_status={6:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={9:0}, mutex={8:0}] [L683] CALL __CS_cs() VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=0, \old(__CS_thread_index)=1, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread={5:0}, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=1, __CS_thread_lockedon={7:0}, __CS_thread_status={6:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={9:0}, mutex={8:0}] [L560] unsigned char k = __VERIFIER_nondet_uchar(); [L561] EXPR __CS_round+k VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=0, \old(__CS_thread_index)=1, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread={5:0}, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=1, __CS_thread_lockedon={7:0}, __CS_thread_status={6:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={9:0}, mutex={8:0}] [L561] COND FALSE !(!(__CS_round+k < 2)) VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=0, \old(__CS_thread_index)=1, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread={5:0}, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=1, __CS_thread_lockedon={7:0}, __CS_thread_status={6:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={9:0}, k=0, mutex={8:0}] [L562] __CS_round += k [L563] __CS_ret = (__VERIFIER_nondet_int() && __CS_round == 2 -1)?__CS_ret_PREEMPTED:__CS_ret [L683] RET __CS_cs() VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=0, \old(__CS_thread_index)=1, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread={5:0}, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=1, __CS_thread_lockedon={7:0}, __CS_thread_status={6:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={9:0}, mutex={8:0}] [L683] COND FALSE !(__CS_ret != 0) VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=0, \old(__CS_thread_index)=1, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread={5:0}, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=1, __CS_thread_lockedon={7:0}, __CS_thread_status={6:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={9:0}, mutex={8:0}] [L684] CALL __CS_pthread_mutex_lock(&mutex[__CS_round]) VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=0, \old(__CS_thread_index)=1, \old(lock)={8:0}, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread={5:0}, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=1, __CS_thread_lockedon={7:0}, __CS_thread_status={6:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={9:0}, mutex={8:0}] [L580] EXPR \read(*lock) VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=0, \old(__CS_thread_index)=1, \old(lock)={8:0}, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread={5:0}, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=1, __CS_thread_lockedon={7:0}, __CS_thread_status={6:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={9:0}, lock={8:0}, mutex={8:0}] [L580] COND TRUE *lock == 0 [L580] EXPR __CS_thread_index+1 [L580] *lock = (__CS_thread_index+1) VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=0, \old(__CS_thread_index)=1, \old(lock)={8:0}, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread={5:0}, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=1, __CS_thread_lockedon={7:0}, __CS_thread_status={6:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={9:0}, mutex={8:0}] [L582] return 0; VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=0, \old(__CS_thread_index)=1, \old(lock)={8:0}, \result=0, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread={5:0}, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=1, __CS_thread_lockedon={7:0}, __CS_thread_status={6:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={9:0}, mutex={8:0}] [L684] RET __CS_pthread_mutex_lock(&mutex[__CS_round]) VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=0, \old(__CS_thread_index)=1, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread={5:0}, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=1, __CS_thread_lockedon={7:0}, __CS_thread_status={6:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={9:0}, mutex={8:0}] [L685] CALL __CS_cs() VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=0, \old(__CS_thread_index)=1, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread={5:0}, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=1, __CS_thread_lockedon={7:0}, __CS_thread_status={6:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={9:0}, mutex={8:0}] [L560] unsigned char k = __VERIFIER_nondet_uchar(); [L561] EXPR __CS_round+k VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=0, \old(__CS_thread_index)=1, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread={5:0}, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=1, __CS_thread_lockedon={7:0}, __CS_thread_status={6:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={9:0}, mutex={8:0}] [L561] COND FALSE !(!(__CS_round+k < 2)) VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=0, \old(__CS_thread_index)=1, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread={5:0}, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=1, __CS_thread_lockedon={7:0}, __CS_thread_status={6:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={9:0}, k=1, mutex={8:0}] [L562] __CS_round += k [L563] __CS_ret = (__VERIFIER_nondet_int() && __CS_round == 2 -1)?__CS_ret_PREEMPTED:__CS_ret [L685] RET __CS_cs() VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=0, \old(__CS_thread_index)=1, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=1, __CS_thread={5:0}, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=1, __CS_thread_lockedon={7:0}, __CS_thread_status={6:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={9:0}, mutex={8:0}] [L685] COND FALSE !(__CS_ret != 0) [L686] EXPR data[__CS_round] [L686] data[__CS_round]++ VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=0, \old(__CS_thread_index)=1, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=1, __CS_thread={5:0}, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=1, __CS_thread_lockedon={7:0}, __CS_thread_status={6:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={9:0}, mutex={8:0}] - UnprovableResult [Line: 580]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 580]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 696]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 696]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 686]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 562]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 562]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 586]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 586]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 748]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 748]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 747]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 747]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 190 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 55.5s, OverallIterations: 20, TraceHistogramMax: 8, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 38.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 4 mSolverCounterUnknown, 8006 SdHoareTripleChecker+Valid, 33.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7940 mSDsluCounter, 18704 SdHoareTripleChecker+Invalid, 31.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14139 mSDsCounter, 4113 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11617 IncrementalHoareTripleChecker+Invalid, 15734 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4113 mSolverCounterUnsat, 4565 mSDtfsCounter, 11617 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1140 GetRequests, 866 SyntacticMatches, 6 SemanticMatches, 268 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3495 ImplicationChecksByTransitivity, 4.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2810occurred in iteration=19, InterpolantAutomatonStates: 211, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 19 MinimizatonAttempts, 1015 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 2.0s SatisfiabilityAnalysisTime, 9.2s InterpolantComputationTime, 1890 NumberOfCodeBlocks, 1810 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 1953 ConstructedInterpolants, 0 QuantifiedInterpolants, 10383 SizeOfPredicates, 39 NumberOfNonLiveVariables, 7677 ConjunctsInSsa, 141 ConjunctsInUnsatCore, 32 InterpolantComputations, 14 PerfectInterpolantSequences, 2466/2637 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 RESULT: Ultimate proved your program to be incorrect! [2025-01-10 02:39:59,537 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW)