./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 c00e63dc 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-?-c00e63d-m [2025-02-06 14:38:21,509 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 14:38:21,576 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-06 14:38:21,584 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 14:38:21,584 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 14:38:21,620 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 14:38:21,621 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 14:38:21,622 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 14:38:21,622 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 14:38:21,622 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 14:38:21,623 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 14:38:21,623 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 14:38:21,623 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 14:38:21,623 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 14:38:21,623 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 14:38:21,623 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 14:38:21,625 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 14:38:21,625 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 14:38:21,625 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 14:38:21,625 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 14:38:21,625 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 14:38:21,625 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 14:38:21,625 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 14:38:21,626 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 14:38:21,626 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-06 14:38:21,626 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 14:38:21,626 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 14:38:21,626 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 14:38:21,626 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 14:38:21,626 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 14:38:21,626 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 14:38:21,626 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 14:38:21,626 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 14:38:21,626 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 14:38:21,626 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 14:38:21,626 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 14:38:21,626 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 14:38:21,626 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 14:38:21,627 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 14:38:21,627 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 14:38:21,627 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 14:38:21,627 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 14:38:21,627 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 14:38:21,627 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 14:38:21,627 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 14:38:21,627 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b26873cfd586f35040b8fa56225beaa479db089ab89500d17d6395862bf9072f [2025-02-06 14:38:21,921 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 14:38:21,929 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 14:38:21,932 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 14:38:21,933 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 14:38:21,934 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 14:38:21,937 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-pthread/cs_lazy.i [2025-02-06 14:38:23,281 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/14edbb333/cfc484ac39d64d16ad6d27128abdc6b5/FLAG25f4e6045 [2025-02-06 14:38:23,596 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 14:38:23,596 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_lazy.i [2025-02-06 14:38:23,614 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/14edbb333/cfc484ac39d64d16ad6d27128abdc6b5/FLAG25f4e6045 [2025-02-06 14:38:23,848 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/14edbb333/cfc484ac39d64d16ad6d27128abdc6b5 [2025-02-06 14:38:23,851 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 14:38:23,852 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 14:38:23,855 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 14:38:23,855 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 14:38:23,859 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 14:38:23,860 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:38:23" (1/1) ... [2025-02-06 14:38:23,861 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13ea8090 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:38:23, skipping insertion in model container [2025-02-06 14:38:23,861 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:38:23" (1/1) ... [2025-02-06 14:38:23,905 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 14:38:24,221 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 14:38:24,236 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 14:38:24,316 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 14:38:24,354 INFO L204 MainTranslator]: Completed translation [2025-02-06 14:38:24,355 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:38:24 WrapperNode [2025-02-06 14:38:24,356 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 14:38:24,357 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 14:38:24,357 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 14:38:24,357 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 14:38:24,363 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:38:24" (1/1) ... [2025-02-06 14:38:24,390 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:38:24" (1/1) ... [2025-02-06 14:38:24,427 INFO L138 Inliner]: procedures = 145, calls = 224, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 533 [2025-02-06 14:38:24,428 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 14:38:24,428 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 14:38:24,429 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 14:38:24,429 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 14:38:24,439 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:38:24" (1/1) ... [2025-02-06 14:38:24,440 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:38:24" (1/1) ... [2025-02-06 14:38:24,446 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:38:24" (1/1) ... [2025-02-06 14:38:24,485 INFO L175 MemorySlicer]: Split 119 memory accesses to 14 slices as follows [2, 3, 0, 10, 10, 10, 25, 16, 9, 3, 8, 9, 5, 9]. 21 percent of accesses are in the largest equivalence class. The 34 initializations are split as follows [2, 0, 0, 4, 4, 4, 8, 8, 2, 0, 2, 0, 0, 0]. The 32 writes are split as follows [0, 1, 0, 2, 2, 2, 10, 4, 3, 1, 3, 1, 2, 1]. [2025-02-06 14:38:24,485 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:38:24" (1/1) ... [2025-02-06 14:38:24,486 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:38:24" (1/1) ... [2025-02-06 14:38:24,519 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:38:24" (1/1) ... [2025-02-06 14:38:24,525 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:38:24" (1/1) ... [2025-02-06 14:38:24,529 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:38:24" (1/1) ... [2025-02-06 14:38:24,533 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:38:24" (1/1) ... [2025-02-06 14:38:24,546 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 14:38:24,547 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 14:38:24,547 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 14:38:24,547 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 14:38:24,550 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:38:24" (1/1) ... [2025-02-06 14:38:24,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 14:38:24,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:38:24,587 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 14:38:24,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 14:38:24,615 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 14:38:24,615 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 14:38:24,615 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 14:38:24,615 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 14:38:24,615 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-06 14:38:24,615 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-06 14:38:24,615 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-02-06 14:38:24,615 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-02-06 14:38:24,615 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-02-06 14:38:24,615 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-02-06 14:38:24,615 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-02-06 14:38:24,615 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-02-06 14:38:24,615 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-02-06 14:38:24,615 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-02-06 14:38:24,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 14:38:24,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 14:38:24,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 14:38:24,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 14:38:24,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-06 14:38:24,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-06 14:38:24,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-02-06 14:38:24,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-02-06 14:38:24,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-02-06 14:38:24,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-02-06 14:38:24,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-02-06 14:38:24,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-02-06 14:38:24,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-02-06 14:38:24,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-02-06 14:38:24,616 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 14:38:24,616 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 14:38:24,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 14:38:24,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 14:38:24,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-06 14:38:24,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-02-06 14:38:24,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-02-06 14:38:24,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-02-06 14:38:24,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-02-06 14:38:24,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-02-06 14:38:24,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-02-06 14:38:24,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-02-06 14:38:24,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-02-06 14:38:24,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-02-06 14:38:24,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-02-06 14:38:24,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-02-06 14:38:24,619 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_lock [2025-02-06 14:38:24,619 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_lock [2025-02-06 14:38:24,619 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2025-02-06 14:38:24,619 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2025-02-06 14:38:24,619 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 14:38:24,620 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 14:38:24,620 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-06 14:38:24,620 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-06 14:38:24,620 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-02-06 14:38:24,620 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-02-06 14:38:24,620 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-02-06 14:38:24,620 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-02-06 14:38:24,620 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-02-06 14:38:24,620 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-02-06 14:38:24,620 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-02-06 14:38:24,620 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-02-06 14:38:24,620 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-02-06 14:38:24,620 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-02-06 14:38:24,620 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2025-02-06 14:38:24,620 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2025-02-06 14:38:24,620 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-02-06 14:38:24,620 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-02-06 14:38:24,620 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 14:38:24,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-06 14:38:24,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-06 14:38:24,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-06 14:38:24,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-02-06 14:38:24,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-02-06 14:38:24,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-02-06 14:38:24,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-02-06 14:38:24,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-02-06 14:38:24,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-02-06 14:38:24,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-02-06 14:38:24,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-02-06 14:38:24,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-02-06 14:38:24,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-02-06 14:38:24,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-02-06 14:38:24,621 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2025-02-06 14:38:24,621 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2025-02-06 14:38:24,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 14:38:24,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 14:38:24,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 14:38:24,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 14:38:24,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-06 14:38:24,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-06 14:38:24,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-06 14:38:24,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-06 14:38:24,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-02-06 14:38:24,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-02-06 14:38:24,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-02-06 14:38:24,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-02-06 14:38:24,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-02-06 14:38:24,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-02-06 14:38:24,621 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_unlock [2025-02-06 14:38:24,621 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_unlock [2025-02-06 14:38:24,621 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 14:38:24,622 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 14:38:24,891 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 14:38:24,893 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 14:38:25,333 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L714-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);thread3_#res#1.base, thread3_#res#1.offset := 0, 0; [2025-02-06 14:38:25,333 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L714-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-02-06 14:38:25,333 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L714-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-06 14:38:25,333 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L710-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);thread3_#res#1.base, thread3_#res#1.offset := 0, 0; [2025-02-06 14:38:25,334 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L710-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-02-06 14:38:25,334 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L710-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-06 14:38:25,334 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L712-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);thread3_#res#1.base, thread3_#res#1.offset := 0, 0; [2025-02-06 14:38:25,334 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L712-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-02-06 14:38:25,334 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L712-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-06 14:38:25,744 INFO L? ?]: Removed 98 outVars from TransFormulas that were not future-live. [2025-02-06 14:38:25,745 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 14:38:25,762 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 14:38:25,762 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 14:38:25,762 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:38:25 BoogieIcfgContainer [2025-02-06 14:38:25,762 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 14:38:25,765 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 14:38:25,765 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 14:38:25,769 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 14:38:25,769 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 02:38:23" (1/3) ... [2025-02-06 14:38:25,769 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32db71ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:38:25, skipping insertion in model container [2025-02-06 14:38:25,769 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:38:24" (2/3) ... [2025-02-06 14:38:25,770 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32db71ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:38:25, skipping insertion in model container [2025-02-06 14:38:25,770 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:38:25" (3/3) ... [2025-02-06 14:38:25,771 INFO L128 eAbstractionObserver]: Analyzing ICFG cs_lazy.i [2025-02-06 14:38:25,783 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 14:38:25,785 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cs_lazy.i that has 7 procedures, 189 locations, 1 initial locations, 2 loop locations, and 16 error locations. [2025-02-06 14:38:25,843 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 14:38:25,852 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;@5f6a743a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 14:38:25,852 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-02-06 14:38:25,859 INFO L276 IsEmpty]: Start isEmpty. Operand has 189 states, 129 states have (on average 1.558139534883721) internal successors, (201), 145 states have internal predecessors, (201), 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-02-06 14:38:25,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-06 14:38:25,865 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:38:25,865 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-06 14:38:25,866 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-06 14:38:25,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:38:25,872 INFO L85 PathProgramCache]: Analyzing trace with hash 315842986, now seen corresponding path program 1 times [2025-02-06 14:38:25,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:38:25,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186781582] [2025-02-06 14:38:25,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:38:25,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:38:25,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 14:38:26,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 14:38:26,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:38:26,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:38:26,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:38:26,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:38:26,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186781582] [2025-02-06 14:38:26,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186781582] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:38:26,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:38:26,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 14:38:26,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913282824] [2025-02-06 14:38:26,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:38:26,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 14:38:26,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:38:26,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 14:38:26,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 14:38:26,217 INFO L87 Difference]: Start difference. First operand has 189 states, 129 states have (on average 1.558139534883721) internal successors, (201), 145 states have internal predecessors, (201), 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, 3 states have (on average 1.6666666666666667) 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-02-06 14:38:26,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:38:26,319 INFO L93 Difference]: Finished difference Result 370 states and 581 transitions. [2025-02-06 14:38:26,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 14:38:26,324 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) 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-02-06 14:38:26,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:38:26,335 INFO L225 Difference]: With dead ends: 370 [2025-02-06 14:38:26,335 INFO L226 Difference]: Without dead ends: 153 [2025-02-06 14:38:26,346 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 14:38:26,348 INFO L435 NwaCegarLoop]: 249 mSDtfsCounter, 2 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 492 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-02-06 14:38:26,353 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 492 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:38:26,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2025-02-06 14:38:26,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2025-02-06 14:38:26,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 102 states have (on average 1.4705882352941178) 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-02-06 14:38:26,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 223 transitions. [2025-02-06 14:38:26,423 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 223 transitions. Word has length 5 [2025-02-06 14:38:26,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:38:26,424 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 223 transitions. [2025-02-06 14:38:26,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) 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-02-06 14:38:26,424 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 223 transitions. [2025-02-06 14:38:26,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-06 14:38:26,425 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:38:26,425 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:38:26,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 14:38:26,425 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-06 14:38:26,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:38:26,426 INFO L85 PathProgramCache]: Analyzing trace with hash -989920932, now seen corresponding path program 1 times [2025-02-06 14:38:26,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:38:26,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456900565] [2025-02-06 14:38:26,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:38:26,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:38:26,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 14:38:26,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 14:38:26,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:38:26,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:38:26,608 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:38:26,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:38:26,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456900565] [2025-02-06 14:38:26,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456900565] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:38:26,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [334399072] [2025-02-06 14:38:26,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:38:26,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:38:26,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:38:26,611 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 14:38:26,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 14:38:26,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 14:38:26,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 14:38:26,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:38:26,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:38:26,808 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 14:38:26,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:38:26,832 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 14:38:26,833 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 14:38:26,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [334399072] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:38:26,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 14:38:26,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-02-06 14:38:26,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626188436] [2025-02-06 14:38:26,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:38:26,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 14:38:26,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:38:26,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 14:38:26,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 14:38:26,837 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-02-06 14:38:26,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:38:26,986 INFO L93 Difference]: Finished difference Result 153 states and 223 transitions. [2025-02-06 14:38:26,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 14:38:26,990 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-06 14:38:26,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:38:26,992 INFO L225 Difference]: With dead ends: 153 [2025-02-06 14:38:26,994 INFO L226 Difference]: Without dead ends: 152 [2025-02-06 14:38:26,995 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 14:38:26,995 INFO L435 NwaCegarLoop]: 212 mSDtfsCounter, 3 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 419 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.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:38:26,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 419 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:38:26,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2025-02-06 14:38:27,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2025-02-06 14:38:27,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 102 states have (on average 1.4607843137254901) 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-02-06 14:38:27,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 222 transitions. [2025-02-06 14:38:27,018 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 222 transitions. Word has length 8 [2025-02-06 14:38:27,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:38:27,019 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 222 transitions. [2025-02-06 14:38:27,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 14:38:27,019 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 222 transitions. [2025-02-06 14:38:27,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-06 14:38:27,020 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:38:27,020 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-02-06 14:38:27,030 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 14:38:27,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:38:27,221 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-06 14:38:27,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:38:27,221 INFO L85 PathProgramCache]: Analyzing trace with hash -989920772, now seen corresponding path program 1 times [2025-02-06 14:38:27,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:38:27,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287216898] [2025-02-06 14:38:27,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:38:27,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:38:27,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 14:38:27,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 14:38:27,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:38:27,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:38:27,389 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:38:27,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:38:27,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287216898] [2025-02-06 14:38:27,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287216898] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:38:27,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1647864591] [2025-02-06 14:38:27,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:38:27,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:38:27,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:38:27,392 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 14:38:27,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 14:38:27,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 14:38:27,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 14:38:27,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:38:27,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:38:27,609 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 14:38:27,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:38:27,635 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:38:27,636 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 14:38:27,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1647864591] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:38:27,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 14:38:27,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-02-06 14:38:27,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332688373] [2025-02-06 14:38:27,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:38:27,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 14:38:27,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:38:27,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 14:38:27,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 14:38:27,639 INFO L87 Difference]: Start difference. First operand 152 states and 222 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-02-06 14:38:27,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:38:27,688 INFO L93 Difference]: Finished difference Result 152 states and 222 transitions. [2025-02-06 14:38:27,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 14:38:27,688 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-02-06 14:38:27,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:38:27,690 INFO L225 Difference]: With dead ends: 152 [2025-02-06 14:38:27,690 INFO L226 Difference]: Without dead ends: 151 [2025-02-06 14:38:27,691 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-02-06 14:38:27,691 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 1 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 424 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-02-06 14:38:27,692 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 424 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:38:27,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-02-06 14:38:27,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2025-02-06 14:38:27,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 102 states have (on average 1.4509803921568627) internal successors, (148), 108 states have internal predecessors, (148), 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-02-06 14:38:27,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 221 transitions. [2025-02-06 14:38:27,703 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 221 transitions. Word has length 8 [2025-02-06 14:38:27,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:38:27,703 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 221 transitions. [2025-02-06 14:38:27,703 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-02-06 14:38:27,703 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 221 transitions. [2025-02-06 14:38:27,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-06 14:38:27,704 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:38:27,704 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:38:27,714 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 14:38:27,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:38:27,910 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-06 14:38:27,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:38:27,910 INFO L85 PathProgramCache]: Analyzing trace with hash -622777561, now seen corresponding path program 1 times [2025-02-06 14:38:27,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:38:27,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898202711] [2025-02-06 14:38:27,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:38:27,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:38:27,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 14:38:27,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 14:38:27,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:38:27,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:38:28,014 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:38:28,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:38:28,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898202711] [2025-02-06 14:38:28,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898202711] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:38:28,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [658657300] [2025-02-06 14:38:28,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:38:28,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:38:28,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:38:28,017 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 14:38:28,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 14:38:28,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 14:38:28,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 14:38:28,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:38:28,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:38:28,205 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 14:38:28,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:38:28,222 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 14:38:28,222 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 14:38:28,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [658657300] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:38:28,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 14:38:28,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-02-06 14:38:28,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803505806] [2025-02-06 14:38:28,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:38:28,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 14:38:28,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:38:28,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 14:38:28,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 14:38:28,224 INFO L87 Difference]: Start difference. First operand 151 states and 221 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-02-06 14:38:28,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:38:28,336 INFO L93 Difference]: Finished difference Result 300 states and 440 transitions. [2025-02-06 14:38:28,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 14:38:28,337 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-02-06 14:38:28,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:38:28,340 INFO L225 Difference]: With dead ends: 300 [2025-02-06 14:38:28,340 INFO L226 Difference]: Without dead ends: 161 [2025-02-06 14:38:28,342 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-02-06 14:38:28,342 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 1 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 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-02-06 14:38:28,342 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 423 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:38:28,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2025-02-06 14:38:28,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 160. [2025-02-06 14:38:28,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 111 states have (on average 1.4324324324324325) internal successors, (159), 117 states have internal predecessors, (159), 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-02-06 14:38:28,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 232 transitions. [2025-02-06 14:38:28,364 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 232 transitions. Word has length 9 [2025-02-06 14:38:28,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:38:28,365 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 232 transitions. [2025-02-06 14:38:28,365 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-02-06 14:38:28,365 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 232 transitions. [2025-02-06 14:38:28,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-06 14:38:28,365 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:38:28,365 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2025-02-06 14:38:28,374 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-06 14:38:28,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:38:28,566 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-06 14:38:28,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:38:28,567 INFO L85 PathProgramCache]: Analyzing trace with hash -622772596, now seen corresponding path program 1 times [2025-02-06 14:38:28,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:38:28,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810824112] [2025-02-06 14:38:28,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:38:28,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:38:28,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 14:38:28,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 14:38:28,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:38:28,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:38:28,641 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 14:38:28,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:38:28,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810824112] [2025-02-06 14:38:28,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810824112] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:38:28,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:38:28,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 14:38:28,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527725101] [2025-02-06 14:38:28,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:38:28,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 14:38:28,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:38:28,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 14:38:28,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 14:38:28,643 INFO L87 Difference]: Start difference. First operand 160 states and 232 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-02-06 14:38:28,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:38:28,663 INFO L93 Difference]: Finished difference Result 160 states and 232 transitions. [2025-02-06 14:38:28,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 14:38:28,664 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-02-06 14:38:28,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:38:28,665 INFO L225 Difference]: With dead ends: 160 [2025-02-06 14:38:28,665 INFO L226 Difference]: Without dead ends: 159 [2025-02-06 14:38:28,666 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 14:38:28,666 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 0 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 14:38:28,667 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 425 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:38:28,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-02-06 14:38:28,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 155. [2025-02-06 14:38:28,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 107 states have (on average 1.4299065420560748) internal successors, (153), 112 states have internal predecessors, (153), 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-02-06 14:38:28,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 226 transitions. [2025-02-06 14:38:28,677 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 226 transitions. Word has length 9 [2025-02-06 14:38:28,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:38:28,677 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 226 transitions. [2025-02-06 14:38:28,678 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-02-06 14:38:28,678 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 226 transitions. [2025-02-06 14:38:28,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-06 14:38:28,678 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:38:28,678 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2025-02-06 14:38:28,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 14:38:28,679 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-06 14:38:28,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:38:28,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1781907105, now seen corresponding path program 1 times [2025-02-06 14:38:28,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:38:28,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909890362] [2025-02-06 14:38:28,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:38:28,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:38:28,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 14:38:28,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 14:38:28,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:38:28,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:38:28,763 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 14:38:28,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:38:28,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909890362] [2025-02-06 14:38:28,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909890362] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:38:28,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1296734328] [2025-02-06 14:38:28,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:38:28,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:38:28,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:38:28,766 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 14:38:28,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 14:38:28,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 14:38:28,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 14:38:28,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:38:28,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:38:28,958 INFO L256 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 14:38:28,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:38:28,973 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 14:38:28,974 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 14:38:28,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1296734328] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:38:28,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 14:38:28,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-02-06 14:38:28,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769440048] [2025-02-06 14:38:28,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:38:28,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 14:38:28,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:38:28,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 14:38:28,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 14:38:28,975 INFO L87 Difference]: Start difference. First operand 155 states and 226 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-02-06 14:38:29,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:38:29,041 INFO L93 Difference]: Finished difference Result 155 states and 226 transitions. [2025-02-06 14:38:29,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 14:38:29,053 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-02-06 14:38:29,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:38:29,054 INFO L225 Difference]: With dead ends: 155 [2025-02-06 14:38:29,054 INFO L226 Difference]: Without dead ends: 154 [2025-02-06 14:38:29,055 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-02-06 14:38:29,055 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 0 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:38:29,055 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 418 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:38:29,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-02-06 14:38:29,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 148. [2025-02-06 14:38:29,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 101 states have (on average 1.4356435643564356) internal successors, (145), 105 states have internal predecessors, (145), 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-02-06 14:38:29,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 218 transitions. [2025-02-06 14:38:29,088 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 218 transitions. Word has length 16 [2025-02-06 14:38:29,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:38:29,088 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 218 transitions. [2025-02-06 14:38:29,088 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-02-06 14:38:29,088 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 218 transitions. [2025-02-06 14:38:29,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-02-06 14:38:29,091 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:38:29,091 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, 1, 1] [2025-02-06 14:38:29,102 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-02-06 14:38:29,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-02-06 14:38:29,294 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ##fun~$Pointer$~TO~$Pointer$Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-06 14:38:29,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:38:29,294 INFO L85 PathProgramCache]: Analyzing trace with hash 359962087, now seen corresponding path program 1 times [2025-02-06 14:38:29,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:38:29,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646735721] [2025-02-06 14:38:29,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:38:29,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:38:29,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-06 14:38:29,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-06 14:38:29,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:38:29,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:38:29,494 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-06 14:38:29,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:38:29,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646735721] [2025-02-06 14:38:29,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646735721] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:38:29,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1240553977] [2025-02-06 14:38:29,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:38:29,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:38:29,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:38:29,497 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 14:38:29,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 14:38:29,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-06 14:38:29,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-06 14:38:29,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:38:29,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:38:29,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 634 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 14:38:29,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:38:29,807 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-06 14:38:29,808 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 14:38:29,866 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-06 14:38:29,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1240553977] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 14:38:29,866 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 14:38:29,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-06 14:38:29,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643118785] [2025-02-06 14:38:29,866 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 14:38:29,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 14:38:29,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:38:29,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 14:38:29,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 14:38:29,871 INFO L87 Difference]: Start difference. First operand 148 states and 218 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-02-06 14:38:29,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:38:29,929 INFO L93 Difference]: Finished difference Result 302 states and 445 transitions. [2025-02-06 14:38:29,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 14:38:29,930 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 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 45 [2025-02-06 14:38:29,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:38:29,931 INFO L225 Difference]: With dead ends: 302 [2025-02-06 14:38:29,932 INFO L226 Difference]: Without dead ends: 157 [2025-02-06 14:38:29,934 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 14:38:29,935 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 4 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 14:38:29,935 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 423 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:38:29,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-02-06 14:38:29,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2025-02-06 14:38:29,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 110 states have (on average 1.4) internal successors, (154), 114 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-02-06 14:38:29,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 227 transitions. [2025-02-06 14:38:29,950 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 227 transitions. Word has length 45 [2025-02-06 14:38:29,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:38:29,950 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 227 transitions. [2025-02-06 14:38:29,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-02-06 14:38:29,953 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 227 transitions. [2025-02-06 14:38:29,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-02-06 14:38:29,959 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:38:29,959 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] [2025-02-06 14:38:29,967 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-02-06 14:38:30,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:38:30,160 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ##fun~$Pointer$~TO~$Pointer$Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-06 14:38:30,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:38:30,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1927849767, now seen corresponding path program 2 times [2025-02-06 14:38:30,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:38:30,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367656297] [2025-02-06 14:38:30,160 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 14:38:30,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:38:30,210 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 2 equivalence classes. [2025-02-06 14:38:30,231 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 22 of 54 statements. [2025-02-06 14:38:30,231 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 14:38:30,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:38:30,437 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-02-06 14:38:30,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:38:30,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367656297] [2025-02-06 14:38:30,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367656297] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:38:30,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:38:30,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 14:38:30,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926126370] [2025-02-06 14:38:30,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:38:30,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 14:38:30,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:38:30,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 14:38:30,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 14:38:30,439 INFO L87 Difference]: Start difference. First operand 157 states and 227 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-02-06 14:38:30,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:38:30,793 INFO L93 Difference]: Finished difference Result 422 states and 625 transitions. [2025-02-06 14:38:30,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 14:38:30,794 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 54 [2025-02-06 14:38:30,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:38:30,798 INFO L225 Difference]: With dead ends: 422 [2025-02-06 14:38:30,798 INFO L226 Difference]: Without dead ends: 290 [2025-02-06 14:38:30,799 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 14:38:30,800 INFO L435 NwaCegarLoop]: 276 mSDtfsCounter, 198 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 746 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 14:38:30,800 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 746 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 14:38:30,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2025-02-06 14:38:30,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 286. [2025-02-06 14:38:30,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 198 states have (on average 1.4191919191919191) internal successors, (281), 202 states have internal predecessors, (281), 72 states have call successors, (72), 12 states have call predecessors, (72), 12 states have return successors, (75), 71 states have call predecessors, (75), 70 states have call successors, (75) [2025-02-06 14:38:30,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 428 transitions. [2025-02-06 14:38:30,821 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 428 transitions. Word has length 54 [2025-02-06 14:38:30,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:38:30,821 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 428 transitions. [2025-02-06 14:38:30,821 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-02-06 14:38:30,821 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 428 transitions. [2025-02-06 14:38:30,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-02-06 14:38:30,823 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:38:30,823 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-02-06 14:38:30,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 14:38:30,823 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ##fun~$Pointer$~TO~$Pointer$Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-06 14:38:30,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:38:30,824 INFO L85 PathProgramCache]: Analyzing trace with hash 782752568, now seen corresponding path program 1 times [2025-02-06 14:38:30,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:38:30,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488651455] [2025-02-06 14:38:30,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:38:30,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:38:30,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-06 14:38:30,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-06 14:38:30,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:38:30,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:38:31,029 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-06 14:38:31,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:38:31,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488651455] [2025-02-06 14:38:31,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488651455] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:38:31,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [631133529] [2025-02-06 14:38:31,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:38:31,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:38:31,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:38:31,032 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 14:38:31,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 14:38:31,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-06 14:38:31,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-06 14:38:31,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:38:31,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:38:31,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 718 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 14:38:31,364 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:38:31,406 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-06 14:38:31,406 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 14:38:31,457 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-06 14:38:31,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [631133529] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 14:38:31,457 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 14:38:31,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2025-02-06 14:38:31,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311859583] [2025-02-06 14:38:31,458 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 14:38:31,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 14:38:31,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:38:31,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 14:38:31,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-06 14:38:31,459 INFO L87 Difference]: Start difference. First operand 286 states and 428 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-02-06 14:38:31,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:38:31,567 INFO L93 Difference]: Finished difference Result 569 states and 853 transitions. [2025-02-06 14:38:31,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 14:38:31,568 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 52 [2025-02-06 14:38:31,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:38:31,572 INFO L225 Difference]: With dead ends: 569 [2025-02-06 14:38:31,572 INFO L226 Difference]: Without dead ends: 302 [2025-02-06 14:38:31,576 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 101 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-06 14:38:31,576 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 6 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:38:31,576 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 420 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:38:31,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2025-02-06 14:38:31,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 302. [2025-02-06 14:38:31,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 214 states have (on average 1.3925233644859814) internal successors, (298), 218 states have internal predecessors, (298), 72 states have call successors, (72), 12 states have call predecessors, (72), 12 states have return successors, (75), 71 states have call predecessors, (75), 70 states have call successors, (75) [2025-02-06 14:38:31,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 445 transitions. [2025-02-06 14:38:31,595 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 445 transitions. Word has length 52 [2025-02-06 14:38:31,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:38:31,596 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 445 transitions. [2025-02-06 14:38:31,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-02-06 14:38:31,596 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 445 transitions. [2025-02-06 14:38:31,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-06 14:38:31,597 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:38:31,597 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] [2025-02-06 14:38:31,607 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-02-06 14:38:31,798 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-02-06 14:38:31,798 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ##fun~$Pointer$~TO~$Pointer$Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-06 14:38:31,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:38:31,799 INFO L85 PathProgramCache]: Analyzing trace with hash 605115120, now seen corresponding path program 2 times [2025-02-06 14:38:31,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:38:31,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340075932] [2025-02-06 14:38:31,799 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 14:38:31,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:38:31,854 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 68 statements into 2 equivalence classes. [2025-02-06 14:38:31,885 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 68 statements. [2025-02-06 14:38:31,885 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 14:38:31,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:38:32,133 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-02-06 14:38:32,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:38:32,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340075932] [2025-02-06 14:38:32,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340075932] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:38:32,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:38:32,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 14:38:32,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763749508] [2025-02-06 14:38:32,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:38:32,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 14:38:32,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:38:32,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 14:38:32,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 14:38:32,135 INFO L87 Difference]: Start difference. First operand 302 states and 445 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-02-06 14:38:36,152 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 14:38:36,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:38:36,557 INFO L93 Difference]: Finished difference Result 569 states and 842 transitions. [2025-02-06 14:38:36,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 14:38:36,557 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 68 [2025-02-06 14:38:36,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:38:36,560 INFO L225 Difference]: With dead ends: 569 [2025-02-06 14:38:36,560 INFO L226 Difference]: Without dead ends: 314 [2025-02-06 14:38:36,563 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 14:38:36,564 INFO L435 NwaCegarLoop]: 244 mSDtfsCounter, 223 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 25 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 767 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-02-06 14:38:36,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 767 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 178 Invalid, 1 Unknown, 0 Unchecked, 4.4s Time] [2025-02-06 14:38:36,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2025-02-06 14:38:36,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 310. [2025-02-06 14:38:36,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 220 states have (on average 1.3818181818181818) internal successors, (304), 225 states have internal predecessors, (304), 72 states have call successors, (72), 13 states have call predecessors, (72), 14 states have return successors, (78), 71 states have call predecessors, (78), 70 states have call successors, (78) [2025-02-06 14:38:36,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 454 transitions. [2025-02-06 14:38:36,614 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 454 transitions. Word has length 68 [2025-02-06 14:38:36,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:38:36,614 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 454 transitions. [2025-02-06 14:38:36,614 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-02-06 14:38:36,614 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 454 transitions. [2025-02-06 14:38:36,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-02-06 14:38:36,616 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:38:36,616 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-02-06 14:38:36,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 14:38:36,617 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ##fun~$Pointer$~TO~$Pointer$Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-06 14:38:36,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:38:36,617 INFO L85 PathProgramCache]: Analyzing trace with hash 179262866, now seen corresponding path program 1 times [2025-02-06 14:38:36,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:38:36,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812215416] [2025-02-06 14:38:36,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:38:36,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:38:36,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-06 14:38:36,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-06 14:38:36,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:38:36,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:38:37,048 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-02-06 14:38:37,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:38:37,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812215416] [2025-02-06 14:38:37,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812215416] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:38:37,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:38:37,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 14:38:37,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51758606] [2025-02-06 14:38:37,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:38:37,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 14:38:37,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:38:37,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 14:38:37,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 14:38:37,051 INFO L87 Difference]: Start difference. First operand 310 states and 454 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-02-06 14:38:37,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:38:37,403 INFO L93 Difference]: Finished difference Result 566 states and 830 transitions. [2025-02-06 14:38:37,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 14:38:37,403 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-02-06 14:38:37,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:38:37,406 INFO L225 Difference]: With dead ends: 566 [2025-02-06 14:38:37,406 INFO L226 Difference]: Without dead ends: 271 [2025-02-06 14:38:37,409 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 14:38:37,410 INFO L435 NwaCegarLoop]: 260 mSDtfsCounter, 190 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 715 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.3s IncrementalHoareTripleChecker+Time [2025-02-06 14:38:37,410 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 715 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 14:38:37,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2025-02-06 14:38:37,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 267. [2025-02-06 14:38:37,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 193 states have (on average 1.3316062176165804) internal successors, (257), 197 states have internal predecessors, (257), 58 states have call successors, (58), 12 states have call predecessors, (58), 12 states have return successors, (62), 57 states have call predecessors, (62), 56 states have call successors, (62) [2025-02-06 14:38:37,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 377 transitions. [2025-02-06 14:38:37,430 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 377 transitions. Word has length 72 [2025-02-06 14:38:37,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:38:37,430 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 377 transitions. [2025-02-06 14:38:37,431 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-02-06 14:38:37,431 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 377 transitions. [2025-02-06 14:38:37,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-02-06 14:38:37,432 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:38:37,432 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-02-06 14:38:37,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 14:38:37,432 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ##fun~$Pointer$~TO~$Pointer$Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-06 14:38:37,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:38:37,433 INFO L85 PathProgramCache]: Analyzing trace with hash 526300147, now seen corresponding path program 1 times [2025-02-06 14:38:37,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:38:37,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364908427] [2025-02-06 14:38:37,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:38:37,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:38:37,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-06 14:38:37,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-06 14:38:37,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:38:37,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:38:37,842 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-02-06 14:38:37,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:38:37,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364908427] [2025-02-06 14:38:37,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364908427] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:38:37,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:38:37,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 14:38:37,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209698893] [2025-02-06 14:38:37,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:38:37,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 14:38:37,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:38:37,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 14:38:37,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 14:38:37,844 INFO L87 Difference]: Start difference. First operand 267 states and 377 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-02-06 14:38:41,857 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 14:38:42,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:38:42,063 INFO L93 Difference]: Finished difference Result 373 states and 523 transitions. [2025-02-06 14:38:42,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 14:38:42,064 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-02-06 14:38:42,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:38:42,066 INFO L225 Difference]: With dead ends: 373 [2025-02-06 14:38:42,066 INFO L226 Difference]: Without dead ends: 204 [2025-02-06 14:38:42,067 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 14:38:42,068 INFO L435 NwaCegarLoop]: 261 mSDtfsCounter, 85 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-02-06 14:38:42,068 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 717 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2025-02-06 14:38:42,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2025-02-06 14:38:42,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2025-02-06 14:38:42,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 147 states have (on average 1.3061224489795917) internal successors, (192), 152 states have internal predecessors, (192), 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-02-06 14:38:42,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 283 transitions. [2025-02-06 14:38:42,083 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 283 transitions. Word has length 74 [2025-02-06 14:38:42,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:38:42,083 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 283 transitions. [2025-02-06 14:38:42,083 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-02-06 14:38:42,084 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 283 transitions. [2025-02-06 14:38:42,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-02-06 14:38:42,085 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:38:42,085 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-02-06 14:38:42,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 14:38:42,086 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ##fun~$Pointer$~TO~$Pointer$Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-06 14:38:42,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:38:42,086 INFO L85 PathProgramCache]: Analyzing trace with hash 507732081, now seen corresponding path program 1 times [2025-02-06 14:38:42,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:38:42,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026581552] [2025-02-06 14:38:42,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:38:42,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:38:42,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-06 14:38:42,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-06 14:38:42,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:38:42,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:38:43,153 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2025-02-06 14:38:43,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:38:43,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026581552] [2025-02-06 14:38:43,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026581552] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:38:43,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:38:43,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 14:38:43,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420233776] [2025-02-06 14:38:43,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:38:43,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 14:38:43,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:38:43,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 14:38:43,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-02-06 14:38:43,156 INFO L87 Difference]: Start difference. First operand 204 states and 283 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-02-06 14:38:43,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:38:43,931 INFO L93 Difference]: Finished difference Result 421 states and 607 transitions. [2025-02-06 14:38:43,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 14:38:43,931 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-02-06 14:38:43,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:38:43,934 INFO L225 Difference]: With dead ends: 421 [2025-02-06 14:38:43,934 INFO L226 Difference]: Without dead ends: 282 [2025-02-06 14:38:43,937 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-02-06 14:38:43,938 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 286 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 14:38:43,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 603 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 573 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 14:38:43,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2025-02-06 14:38:43,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 250. [2025-02-06 14:38:43,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 182 states have (on average 1.2472527472527473) internal successors, (227), 182 states have internal predecessors, (227), 50 states have call successors, (50), 10 states have call predecessors, (50), 14 states have return successors, (64), 57 states have call predecessors, (64), 49 states have call successors, (64) [2025-02-06 14:38:43,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 341 transitions. [2025-02-06 14:38:43,964 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 341 transitions. Word has length 116 [2025-02-06 14:38:43,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:38:43,965 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 341 transitions. [2025-02-06 14:38:43,965 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-02-06 14:38:43,966 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 341 transitions. [2025-02-06 14:38:43,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-02-06 14:38:43,968 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:38:43,968 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-02-06 14:38:43,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 14:38:43,969 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ##fun~$Pointer$~TO~$Pointer$Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-06 14:38:43,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:38:43,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1933827243, now seen corresponding path program 1 times [2025-02-06 14:38:43,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:38:43,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440936312] [2025-02-06 14:38:43,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:38:43,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:38:44,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-02-06 14:38:44,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-02-06 14:38:44,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:38:44,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:38:45,217 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2025-02-06 14:38:45,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:38:45,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440936312] [2025-02-06 14:38:45,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440936312] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:38:45,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:38:45,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 14:38:45,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756867889] [2025-02-06 14:38:45,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:38:45,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 14:38:45,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:38:45,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 14:38:45,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-06 14:38:45,218 INFO L87 Difference]: Start difference. First operand 250 states and 341 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-02-06 14:38:49,339 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 14:38:50,578 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 14:38:54,586 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 14:38:55,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:38:55,614 INFO L93 Difference]: Finished difference Result 745 states and 1072 transitions. [2025-02-06 14:38:55,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 14:38:55,615 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 120 [2025-02-06 14:38:55,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:38:55,622 INFO L225 Difference]: With dead ends: 745 [2025-02-06 14:38:55,623 INFO L226 Difference]: Without dead ends: 540 [2025-02-06 14:38:55,624 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-02-06 14:38:55,626 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 390 mSDsluCounter, 630 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 193 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 836 SdHoareTripleChecker+Invalid, 770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 193 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.2s IncrementalHoareTripleChecker+Time [2025-02-06 14:38:55,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [426 Valid, 836 Invalid, 770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [193 Valid, 575 Invalid, 2 Unknown, 0 Unchecked, 10.2s Time] [2025-02-06 14:38:55,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2025-02-06 14:38:55,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 524. [2025-02-06 14:38:55,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 364 states have (on average 1.2747252747252746) internal successors, (464), 352 states have internal predecessors, (464), 127 states have call successors, (127), 17 states have call predecessors, (127), 29 states have return successors, (175), 154 states have call predecessors, (175), 125 states have call successors, (175) [2025-02-06 14:38:55,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 766 transitions. [2025-02-06 14:38:55,683 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 766 transitions. Word has length 120 [2025-02-06 14:38:55,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:38:55,684 INFO L471 AbstractCegarLoop]: Abstraction has 524 states and 766 transitions. [2025-02-06 14:38:55,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-02-06 14:38:55,684 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 766 transitions. [2025-02-06 14:38:55,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-02-06 14:38:55,688 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:38:55,688 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, 1, 1] [2025-02-06 14:38:55,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 14:38:55,689 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ##fun~$Pointer$~TO~$Pointer$Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-06 14:38:55,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:38:55,689 INFO L85 PathProgramCache]: Analyzing trace with hash 299464054, now seen corresponding path program 1 times [2025-02-06 14:38:55,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:38:55,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819849143] [2025-02-06 14:38:55,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:38:55,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:38:55,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-06 14:38:55,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-06 14:38:55,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:38:55,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:38:56,690 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2025-02-06 14:38:56,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:38:56,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819849143] [2025-02-06 14:38:56,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819849143] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:38:56,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:38:56,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 14:38:56,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772537562] [2025-02-06 14:38:56,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:38:56,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 14:38:56,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:38:56,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 14:38:56,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-06 14:38:56,692 INFO L87 Difference]: Start difference. First operand 524 states and 766 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-02-06 14:38:58,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:38:58,981 INFO L93 Difference]: Finished difference Result 795 states and 1144 transitions. [2025-02-06 14:38:58,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 14:38:58,982 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 122 [2025-02-06 14:38:58,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:38:58,987 INFO L225 Difference]: With dead ends: 795 [2025-02-06 14:38:58,987 INFO L226 Difference]: Without dead ends: 436 [2025-02-06 14:38:58,990 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-02-06 14:38:58,991 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 570 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 301 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 606 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 301 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:38:58,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [606 Valid, 738 Invalid, 815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [301 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-02-06 14:38:58,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2025-02-06 14:38:59,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 432. [2025-02-06 14:38:59,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 303 states have (on average 1.2343234323432344) internal successors, (374), 296 states have internal predecessors, (374), 100 states have call successors, (100), 16 states have call predecessors, (100), 25 states have return successors, (140), 119 states have call predecessors, (140), 99 states have call successors, (140) [2025-02-06 14:38:59,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 614 transitions. [2025-02-06 14:38:59,046 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 614 transitions. Word has length 122 [2025-02-06 14:38:59,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:38:59,046 INFO L471 AbstractCegarLoop]: Abstraction has 432 states and 614 transitions. [2025-02-06 14:38:59,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-02-06 14:38:59,047 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 614 transitions. [2025-02-06 14:38:59,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-02-06 14:38:59,050 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:38:59,050 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] [2025-02-06 14:38:59,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 14:38:59,051 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ##fun~$Pointer$~TO~$Pointer$Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-06 14:38:59,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:38:59,051 INFO L85 PathProgramCache]: Analyzing trace with hash 318325908, now seen corresponding path program 1 times [2025-02-06 14:38:59,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:38:59,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806741160] [2025-02-06 14:38:59,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:38:59,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:38:59,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-06 14:38:59,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-06 14:38:59,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:38:59,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:39:00,195 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 18 proven. 16 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2025-02-06 14:39:00,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:39:00,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806741160] [2025-02-06 14:39:00,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806741160] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:39:00,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1965543434] [2025-02-06 14:39:00,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:39:00,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:39:00,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:39:00,200 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-02-06 14:39:00,201 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-02-06 14:39:00,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-06 14:39:00,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-06 14:39:00,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:39:00,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:39:00,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 1276 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-02-06 14:39:00,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:39:01,107 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-02-06 14:39:01,157 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-02-06 14:39:01,161 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-02-06 14:39:01,203 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 14:39:01,204 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-02-06 14:39:01,802 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 14:39:01,803 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-02-06 14:39:01,876 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 56 proven. 64 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-02-06 14:39:01,876 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 14:39:02,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1965543434] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:39:02,270 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 14:39:02,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12] total 21 [2025-02-06 14:39:02,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548555226] [2025-02-06 14:39:02,270 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 14:39:02,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-06 14:39:02,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:39:02,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-06 14:39:02,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=464, Unknown=0, NotChecked=0, Total=552 [2025-02-06 14:39:02,274 INFO L87 Difference]: Start difference. First operand 432 states and 614 transitions. Second operand has 21 states, 21 states have (on average 5.904761904761905) internal successors, (124), 19 states have internal predecessors, (124), 6 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (16), 8 states have call predecessors, (16), 6 states have call successors, (16) [2025-02-06 14:39:06,679 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 14:39:10,820 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 14:39:14,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:39:14,834 INFO L93 Difference]: Finished difference Result 1240 states and 1785 transitions. [2025-02-06 14:39:14,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-02-06 14:39:14,834 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 5.904761904761905) internal successors, (124), 19 states have internal predecessors, (124), 6 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (16), 8 states have call predecessors, (16), 6 states have call successors, (16) Word has length 118 [2025-02-06 14:39:14,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:39:14,841 INFO L225 Difference]: With dead ends: 1240 [2025-02-06 14:39:14,841 INFO L226 Difference]: Without dead ends: 932 [2025-02-06 14:39:14,845 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1038 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=781, Invalid=2879, Unknown=0, NotChecked=0, Total=3660 [2025-02-06 14:39:14,846 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 1782 mSDsluCounter, 1002 mSDsCounter, 0 mSdLazyCounter, 2380 mSolverCounterSat, 1181 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1782 SdHoareTripleChecker+Valid, 1158 SdHoareTripleChecker+Invalid, 3563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1181 IncrementalHoareTripleChecker+Valid, 2380 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.4s IncrementalHoareTripleChecker+Time [2025-02-06 14:39:14,847 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1782 Valid, 1158 Invalid, 3563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1181 Valid, 2380 Invalid, 2 Unknown, 0 Unchecked, 11.4s Time] [2025-02-06 14:39:14,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2025-02-06 14:39:14,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 721. [2025-02-06 14:39:14,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 721 states, 512 states have (on average 1.234375) internal successors, (632), 488 states have internal predecessors, (632), 154 states have call successors, (154), 26 states have call predecessors, (154), 51 states have return successors, (239), 206 states have call predecessors, (239), 152 states have call successors, (239) [2025-02-06 14:39:14,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 1025 transitions. [2025-02-06 14:39:14,922 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 1025 transitions. Word has length 118 [2025-02-06 14:39:14,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:39:14,923 INFO L471 AbstractCegarLoop]: Abstraction has 721 states and 1025 transitions. [2025-02-06 14:39:14,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 5.904761904761905) internal successors, (124), 19 states have internal predecessors, (124), 6 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (16), 8 states have call predecessors, (16), 6 states have call successors, (16) [2025-02-06 14:39:14,923 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 1025 transitions. [2025-02-06 14:39:14,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-02-06 14:39:14,925 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:39:14,925 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] [2025-02-06 14:39:14,937 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-02-06 14:39:15,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:39:15,126 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ##fun~$Pointer$~TO~$Pointer$Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-06 14:39:15,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:39:15,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1831264991, now seen corresponding path program 1 times [2025-02-06 14:39:15,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:39:15,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667874520] [2025-02-06 14:39:15,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:39:15,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:39:15,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-06 14:39:15,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-06 14:39:15,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:39:15,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:39:16,143 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2025-02-06 14:39:16,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:39:16,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667874520] [2025-02-06 14:39:16,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667874520] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:39:16,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1487076229] [2025-02-06 14:39:16,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:39:16,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:39:16,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:39:16,147 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-02-06 14:39:16,149 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-02-06 14:39:16,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-06 14:39:16,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-06 14:39:16,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:39:16,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:39:16,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 1266 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-02-06 14:39:16,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:39:16,910 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-02-06 14:39:17,219 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-02-06 14:39:17,260 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 64 proven. 2 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2025-02-06 14:39:17,261 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 14:39:17,513 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-02-06 14:39:17,518 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-02-06 14:39:17,742 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-02-06 14:39:17,746 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-02-06 14:39:17,866 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-02-06 14:39:17,875 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-02-06 14:39:18,082 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2025-02-06 14:39:18,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1487076229] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 14:39:18,082 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 14:39:18,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14, 14] total 32 [2025-02-06 14:39:18,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038261950] [2025-02-06 14:39:18,083 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 14:39:18,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-02-06 14:39:18,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:39:18,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-02-06 14:39:18,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=872, Unknown=0, NotChecked=0, Total=992 [2025-02-06 14:39:18,085 INFO L87 Difference]: Start difference. First operand 721 states and 1025 transitions. Second operand has 32 states, 28 states have (on average 4.714285714285714) internal successors, (132), 31 states have internal predecessors, (132), 12 states have call successors, (23), 10 states have call predecessors, (23), 10 states have return successors, (21), 10 states have call predecessors, (21), 10 states have call successors, (21) [2025-02-06 14:39:22,282 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 14:39:26,288 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 14:39:34,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:39:34,035 INFO L93 Difference]: Finished difference Result 2052 states and 2848 transitions. [2025-02-06 14:39:34,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2025-02-06 14:39:34,036 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 28 states have (on average 4.714285714285714) internal successors, (132), 31 states have internal predecessors, (132), 12 states have call successors, (23), 10 states have call predecessors, (23), 10 states have return successors, (21), 10 states have call predecessors, (21), 10 states have call successors, (21) Word has length 118 [2025-02-06 14:39:34,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:39:34,045 INFO L225 Difference]: With dead ends: 2052 [2025-02-06 14:39:34,045 INFO L226 Difference]: Without dead ends: 1361 [2025-02-06 14:39:34,051 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 221 SyntacticMatches, 3 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1539 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1008, Invalid=5312, Unknown=0, NotChecked=0, Total=6320 [2025-02-06 14:39:34,052 INFO L435 NwaCegarLoop]: 328 mSDtfsCounter, 1661 mSDsluCounter, 4041 mSDsCounter, 0 mSdLazyCounter, 6142 mSolverCounterSat, 974 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1667 SdHoareTripleChecker+Valid, 4369 SdHoareTripleChecker+Invalid, 7118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 974 IncrementalHoareTripleChecker+Valid, 6142 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:39:34,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1667 Valid, 4369 Invalid, 7118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [974 Valid, 6142 Invalid, 2 Unknown, 0 Unchecked, 14.1s Time] [2025-02-06 14:39:34,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1361 states. [2025-02-06 14:39:34,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1361 to 1279. [2025-02-06 14:39:34,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1279 states, 920 states have (on average 1.2228260869565217) internal successors, (1125), 886 states have internal predecessors, (1125), 249 states have call successors, (249), 57 states have call predecessors, (249), 106 states have return successors, (387), 335 states have call predecessors, (387), 243 states have call successors, (387) [2025-02-06 14:39:34,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1279 states to 1279 states and 1761 transitions. [2025-02-06 14:39:34,217 INFO L78 Accepts]: Start accepts. Automaton has 1279 states and 1761 transitions. Word has length 118 [2025-02-06 14:39:34,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:39:34,218 INFO L471 AbstractCegarLoop]: Abstraction has 1279 states and 1761 transitions. [2025-02-06 14:39:34,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 28 states have (on average 4.714285714285714) internal successors, (132), 31 states have internal predecessors, (132), 12 states have call successors, (23), 10 states have call predecessors, (23), 10 states have return successors, (21), 10 states have call predecessors, (21), 10 states have call successors, (21) [2025-02-06 14:39:34,218 INFO L276 IsEmpty]: Start isEmpty. Operand 1279 states and 1761 transitions. [2025-02-06 14:39:34,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-02-06 14:39:34,220 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:39:34,220 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-02-06 14:39:34,234 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-06 14:39:34,422 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,SelfDestructingSolverStorable16 [2025-02-06 14:39:34,423 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-02-06 14:39:34,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:39:34,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1383994593, now seen corresponding path program 1 times [2025-02-06 14:39:34,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:39:34,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468388971] [2025-02-06 14:39:34,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:39:34,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:39:34,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-06 14:39:35,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-06 14:39:35,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:39:35,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 14:39:35,051 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 14:39:35,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-06 14:39:35,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-06 14:39:35,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:39:35,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 14:39:35,537 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 14:39:35,537 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 14:39:35,538 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ##fun~$Pointer$~TO~$Pointer$Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 16 remaining) [2025-02-06 14:39:35,541 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location __CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 16 remaining) [2025-02-06 14:39:35,541 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 16 remaining) [2025-02-06 14:39:35,541 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ##fun~$Pointer$~TO~$Pointer$Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 16 remaining) [2025-02-06 14:39:35,544 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ##fun~$Pointer$~TO~$Pointer$Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 16 remaining) [2025-02-06 14:39:35,544 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ##fun~$Pointer$~TO~$Pointer$Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 16 remaining) [2025-02-06 14:39:35,544 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location __CS_csErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 16 remaining) [2025-02-06 14:39:35,544 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location __CS_csErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 16 remaining) [2025-02-06 14:39:35,544 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location __CS_csErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 16 remaining) [2025-02-06 14:39:35,544 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location __CS_csErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 16 remaining) [2025-02-06 14:39:35,544 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location __CS_pthread_mutex_unlockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 16 remaining) [2025-02-06 14:39:35,544 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location __CS_pthread_mutex_unlockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 16 remaining) [2025-02-06 14:39:35,544 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 16 remaining) [2025-02-06 14:39:35,545 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 16 remaining) [2025-02-06 14:39:35,545 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 16 remaining) [2025-02-06 14:39:35,545 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 16 remaining) [2025-02-06 14:39:35,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 14:39:35,548 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:39:35,765 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 14:39:35,768 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 02:39:35 BoogieIcfgContainer [2025-02-06 14:39:35,771 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 14:39:35,773 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 14:39:35,773 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 14:39:35,773 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 14:39:35,774 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:38:25" (3/4) ... [2025-02-06 14:39:35,778 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-02-06 14:39:35,980 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 48. [2025-02-06 14:39:36,062 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 14:39:36,064 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 14:39:36,064 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 14:39:36,065 INFO L158 Benchmark]: Toolchain (without parser) took 72213.00ms. Allocated memory was 142.6MB in the beginning and 226.5MB in the end (delta: 83.9MB). Free memory was 111.1MB in the beginning and 134.4MB in the end (delta: -23.4MB). Peak memory consumption was 60.0MB. Max. memory is 16.1GB. [2025-02-06 14:39:36,066 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 201.3MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 14:39:36,066 INFO L158 Benchmark]: CACSL2BoogieTranslator took 501.28ms. Allocated memory is still 142.6MB. Free memory was 111.1MB in the beginning and 86.1MB in the end (delta: 24.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-06 14:39:36,067 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.39ms. Allocated memory is still 142.6MB. Free memory was 85.6MB in the beginning and 81.2MB in the end (delta: 4.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 14:39:36,067 INFO L158 Benchmark]: Boogie Preprocessor took 118.24ms. Allocated memory is still 142.6MB. Free memory was 81.2MB in the beginning and 74.7MB in the end (delta: 6.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 14:39:36,067 INFO L158 Benchmark]: IcfgBuilder took 1215.26ms. Allocated memory is still 142.6MB. Free memory was 74.7MB in the beginning and 82.5MB in the end (delta: -7.8MB). Peak memory consumption was 42.8MB. Max. memory is 16.1GB. [2025-02-06 14:39:36,068 INFO L158 Benchmark]: TraceAbstraction took 70006.94ms. Allocated memory was 142.6MB in the beginning and 226.5MB in the end (delta: 83.9MB). Free memory was 81.9MB in the beginning and 156.4MB in the end (delta: -74.6MB). Peak memory consumption was 210.1MB. Max. memory is 16.1GB. [2025-02-06 14:39:36,068 INFO L158 Benchmark]: Witness Printer took 291.90ms. Allocated memory is still 226.5MB. Free memory was 156.4MB in the beginning and 134.4MB in the end (delta: 22.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-06 14:39:36,070 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.37ms. Allocated memory is still 201.3MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 501.28ms. Allocated memory is still 142.6MB. Free memory was 111.1MB in the beginning and 86.1MB in the end (delta: 24.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.39ms. Allocated memory is still 142.6MB. Free memory was 85.6MB in the beginning and 81.2MB in the end (delta: 4.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 118.24ms. Allocated memory is still 142.6MB. Free memory was 81.2MB in the beginning and 74.7MB in the end (delta: 6.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 1215.26ms. Allocated memory is still 142.6MB. Free memory was 74.7MB in the beginning and 82.5MB in the end (delta: -7.8MB). Peak memory consumption was 42.8MB. Max. memory is 16.1GB. * TraceAbstraction took 70006.94ms. Allocated memory was 142.6MB in the beginning and 226.5MB in the end (delta: 83.9MB). Free memory was 81.9MB in the beginning and 156.4MB in the end (delta: -74.6MB). Peak memory consumption was 210.1MB. Max. memory is 16.1GB. * Witness Printer took 291.90ms. Allocated memory is still 226.5MB. Free memory was 156.4MB in the beginning and 134.4MB in the end (delta: 22.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={17:0}, __CS_cp___CS_thread_status={15:0}, __CS_cp_data={14:0}, __CS_cp_mutex={13: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={17:0}, __CS_cp___CS_thread_status={15:0}, __CS_cp_data={14:0}, __CS_cp_mutex={13: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={17:0}, __CS_cp___CS_thread_status={15:0}, __CS_cp_data={14:0}, __CS_cp_mutex={13: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={17:0}, __CS_cp___CS_thread_status={15:0}, __CS_cp_data={14:0}, __CS_cp_mutex={13: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={17:0}, __CS_cp___CS_thread_status={15:0}, __CS_cp_data={14:0}, __CS_cp_mutex={13: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={17:0}, __CS_cp___CS_thread_status={15:0}, __CS_cp_data={14:0}, __CS_cp_mutex={13: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={17:0}, __CS_cp___CS_thread_status={15:0}, __CS_cp_data={14:0}, __CS_cp_mutex={13: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={17:0}, __CS_cp___CS_thread_status={15:0}, __CS_cp_data={14:0}, __CS_cp_mutex={13: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={17:0}, __CS_cp___CS_thread_status={15:0}, __CS_cp_data={14:0}, __CS_cp_mutex={13: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={17:0}, __CS_cp___CS_thread_status={15:0}, __CS_cp_data={14:0}, __CS_cp_mutex={13: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={17:0}, __CS_cp___CS_thread_status={15:0}, __CS_cp_data={14:0}, __CS_cp_mutex={13: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={17:0}, __CS_cp___CS_thread_status={15:0}, __CS_cp_data={14:0}, __CS_cp_mutex={13: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={17:0}, __CS_cp___CS_thread_status={15:0}, __CS_cp_data={14:0}, __CS_cp_mutex={13: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={11:0}, t2={19:0}, t3={18: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={11:0}, t2={19:0}, t3={18: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={11:0}, t2={19:0}, t3={18: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)={11: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)={11: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={11:0}, t2={19:0}, t3={18: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={11:0}, t2={19:0}, t3={18: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={17:0}, __CS_cp___CS_thread_status={15:0}, __CS_cp_data={14:0}, __CS_cp_mutex={13: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) [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: 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: 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: 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: 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. - 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. - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 189 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 69.7s, OverallIterations: 18, TraceHistogramMax: 8, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 52.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 8 mSolverCounterUnknown, 5512 SdHoareTripleChecker+Valid, 48.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5402 mSDsluCounter, 14093 SdHoareTripleChecker+Invalid, 46.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10190 mSDsCounter, 2786 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10512 IncrementalHoareTripleChecker+Invalid, 13306 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2786 mSolverCounterUnsat, 3903 mSDtfsCounter, 10512 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 813 GetRequests, 606 SyntacticMatches, 5 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2618 ImplicationChecksByTransitivity, 4.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1279occurred in iteration=17, InterpolantAutomatonStates: 166, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 17 MinimizatonAttempts, 368 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 9.8s InterpolantComputationTime, 1507 NumberOfCodeBlocks, 1427 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1575 ConstructedInterpolants, 0 QuantifiedInterpolants, 7802 SizeOfPredicates, 27 NumberOfNonLiveVariables, 5137 ConjunctsInSsa, 72 ConjunctsInUnsatCore, 28 InterpolantComputations, 13 PerfectInterpolantSequences, 1936/2033 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-02-06 14:39:36,105 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)