./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 e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-pthread/cs_lazy.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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-?-e2fb8be-m [2025-03-09 02:48:09,311 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 02:48:09,364 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-09 02:48:09,369 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 02:48:09,370 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 02:48:09,387 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 02:48:09,387 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 02:48:09,387 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 02:48:09,388 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 02:48:09,388 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 02:48:09,388 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 02:48:09,388 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 02:48:09,389 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 02:48:09,389 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 02:48:09,389 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 02:48:09,389 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 02:48:09,389 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 02:48:09,389 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 02:48:09,389 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 02:48:09,390 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 02:48:09,390 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 02:48:09,390 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 02:48:09,390 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 02:48:09,390 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 02:48:09,390 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 02:48:09,390 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 02:48:09,390 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 02:48:09,390 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 02:48:09,390 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 02:48:09,390 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 02:48:09,391 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 02:48:09,391 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 02:48:09,391 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 02:48:09,391 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 02:48:09,391 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 02:48:09,391 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 02:48:09,391 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 02:48:09,392 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 02:48:09,392 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 02:48:09,392 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 02:48:09,392 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 02:48:09,392 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 02:48:09,392 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 02:48:09,392 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 02:48:09,392 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 02:48:09,392 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/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-03-09 02:48:09,606 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 02:48:09,611 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 02:48:09,613 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 02:48:09,614 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 02:48:09,614 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 02:48:09,615 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-pthread/cs_lazy.i [2025-03-09 02:48:10,774 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b9869b35/d822077c655f482ea06382f89f4eeec2/FLAGbbcf2cbe1 [2025-03-09 02:48:11,069 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 02:48:11,069 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_lazy.i [2025-03-09 02:48:11,083 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b9869b35/d822077c655f482ea06382f89f4eeec2/FLAGbbcf2cbe1 [2025-03-09 02:48:11,322 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b9869b35/d822077c655f482ea06382f89f4eeec2 [2025-03-09 02:48:11,324 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 02:48:11,325 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 02:48:11,326 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 02:48:11,326 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 02:48:11,329 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 02:48:11,329 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 02:48:11" (1/1) ... [2025-03-09 02:48:11,330 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5aba4d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:48:11, skipping insertion in model container [2025-03-09 02:48:11,330 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 02:48:11" (1/1) ... [2025-03-09 02:48:11,359 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 02:48:11,676 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 02:48:11,688 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 02:48:11,737 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 02:48:11,759 INFO L204 MainTranslator]: Completed translation [2025-03-09 02:48:11,760 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:48:11 WrapperNode [2025-03-09 02:48:11,760 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 02:48:11,761 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 02:48:11,761 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 02:48:11,761 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 02:48:11,766 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:48:11" (1/1) ... [2025-03-09 02:48:11,789 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:48:11" (1/1) ... [2025-03-09 02:48:11,812 INFO L138 Inliner]: procedures = 145, calls = 224, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 533 [2025-03-09 02:48:11,812 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 02:48:11,812 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 02:48:11,813 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 02:48:11,813 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 02:48:11,820 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:48:11" (1/1) ... [2025-03-09 02:48:11,820 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:48:11" (1/1) ... [2025-03-09 02:48:11,827 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:48:11" (1/1) ... [2025-03-09 02:48:11,851 INFO L175 MemorySlicer]: Split 119 memory accesses to 14 slices as follows [2, 10, 10, 10, 25, 16, 9, 9, 3, 0, 9, 5, 8, 3]. 21 percent of accesses are in the largest equivalence class. The 34 initializations are split as follows [2, 4, 4, 4, 8, 8, 2, 0, 0, 0, 0, 0, 2, 0]. The 32 writes are split as follows [0, 2, 2, 2, 10, 4, 3, 1, 1, 0, 1, 2, 3, 1]. [2025-03-09 02:48:11,851 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:48:11" (1/1) ... [2025-03-09 02:48:11,851 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:48:11" (1/1) ... [2025-03-09 02:48:11,868 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:48:11" (1/1) ... [2025-03-09 02:48:11,869 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:48:11" (1/1) ... [2025-03-09 02:48:11,872 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:48:11" (1/1) ... [2025-03-09 02:48:11,874 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:48:11" (1/1) ... [2025-03-09 02:48:11,879 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 02:48:11,879 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 02:48:11,880 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 02:48:11,880 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 02:48:11,880 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:48:11" (1/1) ... [2025-03-09 02:48:11,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 02:48:11,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:48:11,916 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 02:48:11,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 02:48:11,936 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 02:48:11,936 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 02:48:11,936 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-09 02:48:11,936 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-09 02:48:11,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-09 02:48:11,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-09 02:48:11,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-09 02:48:11,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-09 02:48:11,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-09 02:48:11,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-09 02:48:11,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-09 02:48:11,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-09 02:48:11,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-09 02:48:11,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-09 02:48:11,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 02:48:11,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 02:48:11,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-09 02:48:11,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-09 02:48:11,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-09 02:48:11,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-09 02:48:11,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-09 02:48:11,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-09 02:48:11,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-09 02:48:11,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-09 02:48:11,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-09 02:48:11,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-09 02:48:11,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-09 02:48:11,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-09 02:48:11,938 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 02:48:11,938 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-09 02:48:11,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-09 02:48:11,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-09 02:48:11,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-09 02:48:11,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-09 02:48:11,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-09 02:48:11,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-09 02:48:11,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-09 02:48:11,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-09 02:48:11,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-09 02:48:11,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-09 02:48:11,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-03-09 02:48:11,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-03-09 02:48:11,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-03-09 02:48:11,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-03-09 02:48:11,939 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_lock [2025-03-09 02:48:11,939 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_lock [2025-03-09 02:48:11,939 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2025-03-09 02:48:11,940 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2025-03-09 02:48:11,940 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-09 02:48:11,940 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-09 02:48:11,940 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-09 02:48:11,940 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-09 02:48:11,940 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-09 02:48:11,940 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-09 02:48:11,940 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-09 02:48:11,940 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-09 02:48:11,940 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-09 02:48:11,940 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-09 02:48:11,940 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-03-09 02:48:11,940 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-03-09 02:48:11,940 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-03-09 02:48:11,940 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-03-09 02:48:11,940 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2025-03-09 02:48:11,941 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2025-03-09 02:48:11,941 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-03-09 02:48:11,941 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-03-09 02:48:11,941 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 02:48:11,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-09 02:48:11,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-09 02:48:11,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-09 02:48:11,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-09 02:48:11,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-09 02:48:11,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-03-09 02:48:11,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-03-09 02:48:11,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-03-09 02:48:11,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-03-09 02:48:11,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-03-09 02:48:11,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-03-09 02:48:11,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-03-09 02:48:11,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-03-09 02:48:11,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-03-09 02:48:11,941 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2025-03-09 02:48:11,941 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2025-03-09 02:48:11,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 02:48:11,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 02:48:11,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-09 02:48:11,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-09 02:48:11,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-09 02:48:11,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-09 02:48:11,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-09 02:48:11,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-09 02:48:11,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-09 02:48:11,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-09 02:48:11,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-09 02:48:11,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-09 02:48:11,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-09 02:48:11,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-09 02:48:11,942 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_unlock [2025-03-09 02:48:11,942 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_unlock [2025-03-09 02:48:11,942 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 02:48:11,943 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 02:48:12,128 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 02:48:12,130 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 02:48:12,441 INFO L1307 $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-03-09 02:48:12,441 INFO L1307 $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-03-09 02:48:12,442 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L714-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-09 02:48:12,442 INFO L1307 $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-03-09 02:48:12,442 INFO L1307 $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-03-09 02:48:12,442 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L710-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-09 02:48:12,442 INFO L1307 $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-03-09 02:48:12,442 INFO L1307 $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-03-09 02:48:12,442 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L712-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-09 02:48:13,342 INFO L? ?]: Removed 98 outVars from TransFormulas that were not future-live. [2025-03-09 02:48:13,343 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 02:48:13,353 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 02:48:13,354 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 02:48:13,355 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:48:13 BoogieIcfgContainer [2025-03-09 02:48:13,355 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 02:48:13,356 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 02:48:13,356 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 02:48:13,359 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 02:48:13,359 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 02:48:11" (1/3) ... [2025-03-09 02:48:13,359 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e88cea3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 02:48:13, skipping insertion in model container [2025-03-09 02:48:13,359 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:48:11" (2/3) ... [2025-03-09 02:48:13,360 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e88cea3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 02:48:13, skipping insertion in model container [2025-03-09 02:48:13,360 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:48:13" (3/3) ... [2025-03-09 02:48:13,360 INFO L128 eAbstractionObserver]: Analyzing ICFG cs_lazy.i [2025-03-09 02:48:13,369 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 02:48:13,371 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-03-09 02:48:13,415 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 02:48:13,425 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;@5389f474, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 02:48:13,425 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-03-09 02:48:13,428 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-03-09 02:48:13,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-09 02:48:13,433 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:48:13,433 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-09 02:48:13,433 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-03-09 02:48:13,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:48:13,438 INFO L85 PathProgramCache]: Analyzing trace with hash 315842986, now seen corresponding path program 1 times [2025-03-09 02:48:13,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:48:13,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387634002] [2025-03-09 02:48:13,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:13,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:48:13,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 02:48:13,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 02:48:13,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:13,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:13,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:48:13,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:48:13,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387634002] [2025-03-09 02:48:13,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387634002] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:48:13,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:48:13,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 02:48:13,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051964902] [2025-03-09 02:48:13,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:48:13,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:48:13,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:48:13,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:48:13,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:48:13,712 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-03-09 02:48:13,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:48:13,787 INFO L93 Difference]: Finished difference Result 370 states and 581 transitions. [2025-03-09 02:48:13,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:48:13,789 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-03-09 02:48:13,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:48:13,795 INFO L225 Difference]: With dead ends: 370 [2025-03-09 02:48:13,795 INFO L226 Difference]: Without dead ends: 153 [2025-03-09 02:48:13,799 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-03-09 02:48:13,802 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-03-09 02:48:13,802 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-03-09 02:48:13,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2025-03-09 02:48:13,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2025-03-09 02:48:13,833 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-03-09 02:48:13,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 223 transitions. [2025-03-09 02:48:13,842 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 223 transitions. Word has length 5 [2025-03-09 02:48:13,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:48:13,843 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 223 transitions. [2025-03-09 02:48:13,843 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-03-09 02:48:13,844 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 223 transitions. [2025-03-09 02:48:13,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-09 02:48:13,844 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:48:13,844 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:48:13,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 02:48:13,844 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-03-09 02:48:13,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:48:13,845 INFO L85 PathProgramCache]: Analyzing trace with hash -989920932, now seen corresponding path program 1 times [2025-03-09 02:48:13,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:48:13,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420449617] [2025-03-09 02:48:13,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:13,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:48:13,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 02:48:13,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 02:48:13,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:13,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:13,996 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:48:13,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:48:13,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420449617] [2025-03-09 02:48:13,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420449617] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:48:13,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [138641991] [2025-03-09 02:48:13,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:13,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:48:13,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:48:14,000 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:48:14,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 02:48:14,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 02:48:14,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 02:48:14,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:14,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:14,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 02:48:14,185 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:48:14,203 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 02:48:14,204 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:48:14,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [138641991] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:48:14,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:48:14,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-09 02:48:14,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859321996] [2025-03-09 02:48:14,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:48:14,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:48:14,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:48:14,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:48:14,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:48:14,207 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-03-09 02:48:14,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:48:14,345 INFO L93 Difference]: Finished difference Result 153 states and 223 transitions. [2025-03-09 02:48:14,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:48:14,346 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-03-09 02:48:14,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:48:14,347 INFO L225 Difference]: With dead ends: 153 [2025-03-09 02:48:14,347 INFO L226 Difference]: Without dead ends: 152 [2025-03-09 02:48:14,348 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-03-09 02:48:14,348 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-03-09 02:48:14,348 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-03-09 02:48:14,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2025-03-09 02:48:14,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2025-03-09 02:48:14,358 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-03-09 02:48:14,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 222 transitions. [2025-03-09 02:48:14,360 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 222 transitions. Word has length 8 [2025-03-09 02:48:14,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:48:14,361 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 222 transitions. [2025-03-09 02:48:14,361 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-03-09 02:48:14,361 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 222 transitions. [2025-03-09 02:48:14,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-09 02:48:14,361 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:48:14,361 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-09 02:48:14,369 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-09 02:48:14,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:48:14,562 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-03-09 02:48:14,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:48:14,562 INFO L85 PathProgramCache]: Analyzing trace with hash -989920772, now seen corresponding path program 1 times [2025-03-09 02:48:14,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:48:14,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487093295] [2025-03-09 02:48:14,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:14,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:48:14,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 02:48:14,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 02:48:14,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:14,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:14,651 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:48:14,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:48:14,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487093295] [2025-03-09 02:48:14,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487093295] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:48:14,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [67828034] [2025-03-09 02:48:14,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:14,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:48:14,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:48:14,655 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:48:14,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 02:48:14,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 02:48:14,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 02:48:14,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:14,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:14,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 02:48:14,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:48:14,811 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:48:14,811 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:48:14,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [67828034] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:48:14,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:48:14,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-09 02:48:14,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683989377] [2025-03-09 02:48:14,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:48:14,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:48:14,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:48:14,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:48:14,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:48:14,813 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-03-09 02:48:14,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:48:14,846 INFO L93 Difference]: Finished difference Result 152 states and 222 transitions. [2025-03-09 02:48:14,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:48:14,847 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-03-09 02:48:14,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:48:14,849 INFO L225 Difference]: With dead ends: 152 [2025-03-09 02:48:14,849 INFO L226 Difference]: Without dead ends: 151 [2025-03-09 02:48:14,849 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-03-09 02:48:14,849 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-03-09 02:48:14,850 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-03-09 02:48:14,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-03-09 02:48:14,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2025-03-09 02:48:14,861 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-03-09 02:48:14,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 221 transitions. [2025-03-09 02:48:14,864 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 221 transitions. Word has length 8 [2025-03-09 02:48:14,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:48:14,864 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 221 transitions. [2025-03-09 02:48:14,864 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-03-09 02:48:14,864 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 221 transitions. [2025-03-09 02:48:14,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-09 02:48:14,865 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:48:14,865 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:48:14,872 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-09 02:48:15,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-09 02:48:15,066 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-03-09 02:48:15,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:48:15,066 INFO L85 PathProgramCache]: Analyzing trace with hash -622777561, now seen corresponding path program 1 times [2025-03-09 02:48:15,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:48:15,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087527470] [2025-03-09 02:48:15,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:15,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:48:15,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 02:48:15,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 02:48:15,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:15,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:15,154 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:48:15,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:48:15,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087527470] [2025-03-09 02:48:15,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087527470] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:48:15,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1080711071] [2025-03-09 02:48:15,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:15,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:48:15,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:48:15,156 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:48:15,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 02:48:15,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 02:48:15,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 02:48:15,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:15,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:15,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 02:48:15,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:48:15,311 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 02:48:15,312 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:48:15,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1080711071] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:48:15,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:48:15,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-09 02:48:15,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649080729] [2025-03-09 02:48:15,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:48:15,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:48:15,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:48:15,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:48:15,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:48:15,314 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-03-09 02:48:15,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:48:15,453 INFO L93 Difference]: Finished difference Result 300 states and 440 transitions. [2025-03-09 02:48:15,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:48:15,453 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-03-09 02:48:15,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:48:15,455 INFO L225 Difference]: With dead ends: 300 [2025-03-09 02:48:15,455 INFO L226 Difference]: Without dead ends: 161 [2025-03-09 02:48:15,455 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-03-09 02:48:15,456 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-03-09 02:48:15,456 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-03-09 02:48:15,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2025-03-09 02:48:15,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 160. [2025-03-09 02:48:15,462 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-03-09 02:48:15,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 232 transitions. [2025-03-09 02:48:15,464 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 232 transitions. Word has length 9 [2025-03-09 02:48:15,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:48:15,464 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 232 transitions. [2025-03-09 02:48:15,464 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-03-09 02:48:15,464 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 232 transitions. [2025-03-09 02:48:15,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-09 02:48:15,464 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:48:15,464 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2025-03-09 02:48:15,471 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-09 02:48:15,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:48:15,665 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-03-09 02:48:15,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:48:15,666 INFO L85 PathProgramCache]: Analyzing trace with hash -622772596, now seen corresponding path program 1 times [2025-03-09 02:48:15,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:48:15,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744708605] [2025-03-09 02:48:15,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:15,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:48:15,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 02:48:15,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 02:48:15,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:15,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:15,713 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 02:48:15,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:48:15,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744708605] [2025-03-09 02:48:15,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744708605] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:48:15,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:48:15,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 02:48:15,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18486464] [2025-03-09 02:48:15,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:48:15,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:48:15,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:48:15,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:48:15,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:48:15,715 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-03-09 02:48:15,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:48:15,729 INFO L93 Difference]: Finished difference Result 160 states and 232 transitions. [2025-03-09 02:48:15,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:48:15,730 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-03-09 02:48:15,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:48:15,732 INFO L225 Difference]: With dead ends: 160 [2025-03-09 02:48:15,732 INFO L226 Difference]: Without dead ends: 159 [2025-03-09 02:48:15,733 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-03-09 02:48:15,733 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-03-09 02:48:15,733 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-03-09 02:48:15,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-03-09 02:48:15,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 155. [2025-03-09 02:48:15,742 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-03-09 02:48:15,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 226 transitions. [2025-03-09 02:48:15,743 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 226 transitions. Word has length 9 [2025-03-09 02:48:15,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:48:15,743 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 226 transitions. [2025-03-09 02:48:15,743 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-03-09 02:48:15,743 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 226 transitions. [2025-03-09 02:48:15,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-09 02:48:15,744 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:48:15,744 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2025-03-09 02:48:15,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 02:48:15,744 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-03-09 02:48:15,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:48:15,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1781907105, now seen corresponding path program 1 times [2025-03-09 02:48:15,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:48:15,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482937169] [2025-03-09 02:48:15,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:15,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:48:15,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 02:48:15,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 02:48:15,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:15,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:15,805 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 02:48:15,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:48:15,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482937169] [2025-03-09 02:48:15,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482937169] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:48:15,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [989538619] [2025-03-09 02:48:15,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:15,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:48:15,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:48:15,807 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:48:15,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 02:48:15,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 02:48:15,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 02:48:15,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:15,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:15,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 02:48:15,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:48:15,958 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 02:48:15,958 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:48:15,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [989538619] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:48:15,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:48:15,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-09 02:48:15,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114764618] [2025-03-09 02:48:15,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:48:15,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:48:15,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:48:15,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:48:15,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:48:15,959 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-03-09 02:48:16,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:48:16,056 INFO L93 Difference]: Finished difference Result 155 states and 226 transitions. [2025-03-09 02:48:16,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:48:16,067 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-03-09 02:48:16,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:48:16,068 INFO L225 Difference]: With dead ends: 155 [2025-03-09 02:48:16,068 INFO L226 Difference]: Without dead ends: 154 [2025-03-09 02:48:16,069 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-03-09 02:48:16,069 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-03-09 02:48:16,069 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-03-09 02:48:16,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-03-09 02:48:16,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 148. [2025-03-09 02:48:16,075 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-03-09 02:48:16,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 218 transitions. [2025-03-09 02:48:16,077 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 218 transitions. Word has length 16 [2025-03-09 02:48:16,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:48:16,077 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 218 transitions. [2025-03-09 02:48:16,077 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-03-09 02:48:16,077 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 218 transitions. [2025-03-09 02:48:16,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-09 02:48:16,078 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:48:16,079 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-03-09 02:48:16,085 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-09 02:48:16,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:48:16,279 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-03-09 02:48:16,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:48:16,280 INFO L85 PathProgramCache]: Analyzing trace with hash 359962087, now seen corresponding path program 1 times [2025-03-09 02:48:16,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:48:16,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428340884] [2025-03-09 02:48:16,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:16,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:48:16,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-09 02:48:16,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-09 02:48:16,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:16,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:16,412 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-09 02:48:16,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:48:16,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428340884] [2025-03-09 02:48:16,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428340884] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:48:16,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2031381730] [2025-03-09 02:48:16,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:16,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:48:16,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:48:16,415 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:48:16,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-09 02:48:16,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-09 02:48:16,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-09 02:48:16,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:16,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:16,623 INFO L256 TraceCheckSpWp]: Trace formula consists of 634 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 02:48:16,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:48:16,638 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-09 02:48:16,638 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:48:16,679 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-09 02:48:16,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2031381730] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:48:16,679 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:48:16,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-09 02:48:16,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452863771] [2025-03-09 02:48:16,679 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:48:16,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 02:48:16,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:48:16,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 02:48:16,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:48:16,680 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-03-09 02:48:16,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:48:16,717 INFO L93 Difference]: Finished difference Result 302 states and 445 transitions. [2025-03-09 02:48:16,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:48:16,718 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-03-09 02:48:16,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:48:16,720 INFO L225 Difference]: With dead ends: 302 [2025-03-09 02:48:16,720 INFO L226 Difference]: Without dead ends: 157 [2025-03-09 02:48:16,721 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-03-09 02:48:16,723 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-03-09 02:48:16,723 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-03-09 02:48:16,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-03-09 02:48:16,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2025-03-09 02:48:16,730 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-03-09 02:48:16,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 227 transitions. [2025-03-09 02:48:16,731 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 227 transitions. Word has length 45 [2025-03-09 02:48:16,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:48:16,732 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 227 transitions. [2025-03-09 02:48:16,732 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-03-09 02:48:16,732 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 227 transitions. [2025-03-09 02:48:16,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-09 02:48:16,739 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:48:16,739 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-03-09 02:48:16,746 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-09 02:48:16,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:48:16,940 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-03-09 02:48:16,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:48:16,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1927849767, now seen corresponding path program 2 times [2025-03-09 02:48:16,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:48:16,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392894838] [2025-03-09 02:48:16,940 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:48:16,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:48:16,973 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 2 equivalence classes. [2025-03-09 02:48:16,985 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 22 of 54 statements. [2025-03-09 02:48:16,986 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 02:48:16,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:17,129 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-09 02:48:17,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:48:17,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392894838] [2025-03-09 02:48:17,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392894838] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:48:17,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:48:17,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:48:17,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760900739] [2025-03-09 02:48:17,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:48:17,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:48:17,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:48:17,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:48:17,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:48:17,130 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-03-09 02:48:17,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:48:17,267 INFO L93 Difference]: Finished difference Result 422 states and 625 transitions. [2025-03-09 02:48:17,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:48:17,267 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-03-09 02:48:17,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:48:17,270 INFO L225 Difference]: With dead ends: 422 [2025-03-09 02:48:17,270 INFO L226 Difference]: Without dead ends: 290 [2025-03-09 02:48:17,271 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-03-09 02:48:17,271 INFO L435 NwaCegarLoop]: 276 mSDtfsCounter, 198 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:48:17,272 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.1s Time] [2025-03-09 02:48:17,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2025-03-09 02:48:17,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 286. [2025-03-09 02:48:17,285 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-03-09 02:48:17,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 428 transitions. [2025-03-09 02:48:17,289 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 428 transitions. Word has length 54 [2025-03-09 02:48:17,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:48:17,289 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 428 transitions. [2025-03-09 02:48:17,289 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-03-09 02:48:17,290 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 428 transitions. [2025-03-09 02:48:17,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-09 02:48:17,292 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:48:17,292 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-03-09 02:48:17,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 02:48:17,292 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-03-09 02:48:17,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:48:17,293 INFO L85 PathProgramCache]: Analyzing trace with hash 782752568, now seen corresponding path program 1 times [2025-03-09 02:48:17,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:48:17,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697954171] [2025-03-09 02:48:17,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:17,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:48:17,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-09 02:48:17,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-09 02:48:17,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:17,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:17,454 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-09 02:48:17,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:48:17,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697954171] [2025-03-09 02:48:17,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697954171] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:48:17,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [330950455] [2025-03-09 02:48:17,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:17,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:48:17,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:48:17,457 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:48:17,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-09 02:48:17,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-09 02:48:17,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-09 02:48:17,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:17,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:17,707 INFO L256 TraceCheckSpWp]: Trace formula consists of 718 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 02:48:17,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:48:17,740 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-09 02:48:17,741 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:48:17,779 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-09 02:48:17,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [330950455] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:48:17,780 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:48:17,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2025-03-09 02:48:17,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824125899] [2025-03-09 02:48:17,780 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:48:17,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:48:17,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:48:17,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:48:17,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:48:17,781 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-03-09 02:48:17,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:48:17,906 INFO L93 Difference]: Finished difference Result 569 states and 853 transitions. [2025-03-09 02:48:17,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:48:17,906 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-03-09 02:48:17,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:48:17,910 INFO L225 Difference]: With dead ends: 569 [2025-03-09 02:48:17,911 INFO L226 Difference]: Without dead ends: 302 [2025-03-09 02:48:17,913 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-03-09 02:48:17,913 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-03-09 02:48:17,913 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-03-09 02:48:17,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2025-03-09 02:48:17,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 302. [2025-03-09 02:48:17,933 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-03-09 02:48:17,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 445 transitions. [2025-03-09 02:48:17,937 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 445 transitions. Word has length 52 [2025-03-09 02:48:17,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:48:17,937 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 445 transitions. [2025-03-09 02:48:17,937 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-03-09 02:48:17,937 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 445 transitions. [2025-03-09 02:48:17,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-09 02:48:17,938 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:48:17,938 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-03-09 02:48:17,945 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-09 02:48:18,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:48:18,139 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-03-09 02:48:18,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:48:18,140 INFO L85 PathProgramCache]: Analyzing trace with hash 605115120, now seen corresponding path program 2 times [2025-03-09 02:48:18,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:48:18,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740556509] [2025-03-09 02:48:18,140 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:48:18,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:48:18,197 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 68 statements into 2 equivalence classes. [2025-03-09 02:48:18,206 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 68 statements. [2025-03-09 02:48:18,206 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 02:48:18,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:18,412 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-03-09 02:48:18,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:48:18,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740556509] [2025-03-09 02:48:18,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740556509] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:48:18,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:48:18,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 02:48:18,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047961248] [2025-03-09 02:48:18,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:48:18,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:48:18,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:48:18,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:48:18,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:48:18,414 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-03-09 02:48:22,431 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-03-09 02:48:22,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:48:22,842 INFO L93 Difference]: Finished difference Result 569 states and 842 transitions. [2025-03-09 02:48:22,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 02:48:22,843 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-03-09 02:48:22,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:48:22,845 INFO L225 Difference]: With dead ends: 569 [2025-03-09 02:48:22,845 INFO L226 Difference]: Without dead ends: 314 [2025-03-09 02:48:22,846 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-03-09 02:48:22,846 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-03-09 02:48:22,846 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-03-09 02:48:22,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2025-03-09 02:48:22,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 310. [2025-03-09 02:48:22,868 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-03-09 02:48:22,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 454 transitions. [2025-03-09 02:48:22,870 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 454 transitions. Word has length 68 [2025-03-09 02:48:22,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:48:22,870 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 454 transitions. [2025-03-09 02:48:22,871 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-03-09 02:48:22,871 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 454 transitions. [2025-03-09 02:48:22,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-09 02:48:22,872 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:48:22,872 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-03-09 02:48:22,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-09 02:48:22,872 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-03-09 02:48:22,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:48:22,873 INFO L85 PathProgramCache]: Analyzing trace with hash 179262866, now seen corresponding path program 1 times [2025-03-09 02:48:22,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:48:22,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818744901] [2025-03-09 02:48:22,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:22,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:48:22,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-09 02:48:22,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-09 02:48:22,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:22,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:23,143 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-03-09 02:48:23,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:48:23,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818744901] [2025-03-09 02:48:23,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818744901] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:48:23,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:48:23,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:48:23,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544386315] [2025-03-09 02:48:23,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:48:23,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:48:23,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:48:23,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:48:23,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:48:23,144 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-03-09 02:48:23,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:48:23,319 INFO L93 Difference]: Finished difference Result 566 states and 830 transitions. [2025-03-09 02:48:23,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:48:23,319 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-03-09 02:48:23,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:48:23,321 INFO L225 Difference]: With dead ends: 566 [2025-03-09 02:48:23,322 INFO L226 Difference]: Without dead ends: 271 [2025-03-09 02:48:23,323 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-03-09 02:48:23,323 INFO L435 NwaCegarLoop]: 260 mSDtfsCounter, 190 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:48:23,324 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.1s Time] [2025-03-09 02:48:23,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2025-03-09 02:48:23,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 267. [2025-03-09 02:48:23,336 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-03-09 02:48:23,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 377 transitions. [2025-03-09 02:48:23,338 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 377 transitions. Word has length 72 [2025-03-09 02:48:23,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:48:23,338 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 377 transitions. [2025-03-09 02:48:23,339 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-03-09 02:48:23,339 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 377 transitions. [2025-03-09 02:48:23,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-09 02:48:23,339 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:48:23,339 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-03-09 02:48:23,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-09 02:48:23,340 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-03-09 02:48:23,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:48:23,340 INFO L85 PathProgramCache]: Analyzing trace with hash 526300147, now seen corresponding path program 1 times [2025-03-09 02:48:23,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:48:23,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69494295] [2025-03-09 02:48:23,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:23,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:48:23,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-09 02:48:23,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-09 02:48:23,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:23,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:23,607 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-03-09 02:48:23,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:48:23,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69494295] [2025-03-09 02:48:23,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69494295] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:48:23,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:48:23,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:48:23,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800116624] [2025-03-09 02:48:23,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:48:23,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:48:23,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:48:23,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:48:23,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:48:23,609 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-03-09 02:48:27,710 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-03-09 02:48:27,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:48:27,765 INFO L93 Difference]: Finished difference Result 373 states and 523 transitions. [2025-03-09 02:48:27,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:48:27,766 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-03-09 02:48:27,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:48:27,767 INFO L225 Difference]: With dead ends: 373 [2025-03-09 02:48:27,767 INFO L226 Difference]: Without dead ends: 204 [2025-03-09 02:48:27,768 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-03-09 02:48:27,768 INFO L435 NwaCegarLoop]: 261 mSDtfsCounter, 85 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s 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.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:48:27,768 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.1s Time] [2025-03-09 02:48:27,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2025-03-09 02:48:27,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2025-03-09 02:48:27,781 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-03-09 02:48:27,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 283 transitions. [2025-03-09 02:48:27,783 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 283 transitions. Word has length 74 [2025-03-09 02:48:27,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:48:27,783 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 283 transitions. [2025-03-09 02:48:27,783 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-03-09 02:48:27,783 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 283 transitions. [2025-03-09 02:48:27,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-09 02:48:27,785 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:48:27,785 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-03-09 02:48:27,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-09 02:48:27,786 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-03-09 02:48:27,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:48:27,786 INFO L85 PathProgramCache]: Analyzing trace with hash 507732081, now seen corresponding path program 1 times [2025-03-09 02:48:27,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:48:27,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996886247] [2025-03-09 02:48:27,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:27,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:48:27,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-09 02:48:27,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-09 02:48:27,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:27,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:28,483 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2025-03-09 02:48:28,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:48:28,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996886247] [2025-03-09 02:48:28,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996886247] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:48:28,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:48:28,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-09 02:48:28,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246570435] [2025-03-09 02:48:28,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:48:28,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 02:48:28,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:48:28,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 02:48:28,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-09 02:48:28,485 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-03-09 02:48:28,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:48:28,990 INFO L93 Difference]: Finished difference Result 421 states and 607 transitions. [2025-03-09 02:48:28,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 02:48:28,991 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-03-09 02:48:28,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:48:28,993 INFO L225 Difference]: With dead ends: 421 [2025-03-09 02:48:28,993 INFO L226 Difference]: Without dead ends: 282 [2025-03-09 02:48:28,994 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2025-03-09 02:48:28,995 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 286 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2025-03-09 02:48:28,995 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.4s Time] [2025-03-09 02:48:28,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2025-03-09 02:48:29,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 250. [2025-03-09 02:48:29,012 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-03-09 02:48:29,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 341 transitions. [2025-03-09 02:48:29,014 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 341 transitions. Word has length 116 [2025-03-09 02:48:29,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:48:29,015 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 341 transitions. [2025-03-09 02:48:29,015 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-03-09 02:48:29,015 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 341 transitions. [2025-03-09 02:48:29,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-09 02:48:29,018 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:48:29,018 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-03-09 02:48:29,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-09 02:48:29,019 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-03-09 02:48:29,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:48:29,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1933827243, now seen corresponding path program 1 times [2025-03-09 02:48:29,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:48:29,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619373096] [2025-03-09 02:48:29,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:29,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:48:29,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-09 02:48:29,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-09 02:48:29,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:29,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:29,917 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2025-03-09 02:48:29,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:48:29,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619373096] [2025-03-09 02:48:29,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619373096] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:48:29,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:48:29,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-09 02:48:29,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066703923] [2025-03-09 02:48:29,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:48:29,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 02:48:29,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:48:29,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 02:48:29,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-09 02:48:29,919 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-03-09 02:48:34,145 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-03-09 02:48:38,546 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-03-09 02:48:39,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:48:39,344 INFO L93 Difference]: Finished difference Result 745 states and 1072 transitions. [2025-03-09 02:48:39,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 02:48:39,345 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-03-09 02:48:39,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:48:39,348 INFO L225 Difference]: With dead ends: 745 [2025-03-09 02:48:39,348 INFO L226 Difference]: Without dead ends: 540 [2025-03-09 02:48:39,350 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-03-09 02:48:39,350 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 390 mSDsluCounter, 630 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 193 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.2s 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, 9.3s IncrementalHoareTripleChecker+Time [2025-03-09 02:48:39,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [426 Valid, 836 Invalid, 770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [193 Valid, 575 Invalid, 2 Unknown, 0 Unchecked, 9.3s Time] [2025-03-09 02:48:39,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2025-03-09 02:48:39,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 524. [2025-03-09 02:48:39,385 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-03-09 02:48:39,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 766 transitions. [2025-03-09 02:48:39,390 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 766 transitions. Word has length 120 [2025-03-09 02:48:39,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:48:39,390 INFO L471 AbstractCegarLoop]: Abstraction has 524 states and 766 transitions. [2025-03-09 02:48:39,390 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-03-09 02:48:39,390 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 766 transitions. [2025-03-09 02:48:39,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-09 02:48:39,392 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:48:39,392 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-03-09 02:48:39,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-09 02:48:39,393 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-03-09 02:48:39,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:48:39,394 INFO L85 PathProgramCache]: Analyzing trace with hash 299464054, now seen corresponding path program 1 times [2025-03-09 02:48:39,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:48:39,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298210070] [2025-03-09 02:48:39,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:39,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:48:39,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-09 02:48:39,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-09 02:48:39,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:39,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:40,124 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2025-03-09 02:48:40,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:48:40,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298210070] [2025-03-09 02:48:40,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298210070] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:48:40,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:48:40,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-09 02:48:40,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112405031] [2025-03-09 02:48:40,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:48:40,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 02:48:40,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:48:40,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 02:48:40,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-09 02:48:40,126 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-03-09 02:48:41,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:48:41,205 INFO L93 Difference]: Finished difference Result 795 states and 1144 transitions. [2025-03-09 02:48:41,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 02:48:41,207 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-03-09 02:48:41,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:48:41,210 INFO L225 Difference]: With dead ends: 795 [2025-03-09 02:48:41,210 INFO L226 Difference]: Without dead ends: 436 [2025-03-09 02:48:41,212 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-03-09 02:48:41,212 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 570 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 301 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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, 1.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:48:41,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [606 Valid, 738 Invalid, 815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [301 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-09 02:48:41,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2025-03-09 02:48:41,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 432. [2025-03-09 02:48:41,239 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-03-09 02:48:41,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 614 transitions. [2025-03-09 02:48:41,242 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 614 transitions. Word has length 122 [2025-03-09 02:48:41,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:48:41,242 INFO L471 AbstractCegarLoop]: Abstraction has 432 states and 614 transitions. [2025-03-09 02:48:41,242 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-03-09 02:48:41,242 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 614 transitions. [2025-03-09 02:48:41,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-09 02:48:41,244 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:48:41,245 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-03-09 02:48:41,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-09 02:48:41,245 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-03-09 02:48:41,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:48:41,245 INFO L85 PathProgramCache]: Analyzing trace with hash 318325908, now seen corresponding path program 1 times [2025-03-09 02:48:41,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:48:41,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032192588] [2025-03-09 02:48:41,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:41,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:48:41,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-09 02:48:41,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-09 02:48:41,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:41,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:42,865 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 32 proven. 30 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2025-03-09 02:48:42,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:48:42,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032192588] [2025-03-09 02:48:42,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032192588] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:48:42,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [261538201] [2025-03-09 02:48:42,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:42,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:48:42,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:48:42,869 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:48:42,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-09 02:48:43,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-09 02:48:43,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-09 02:48:43,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:43,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:43,268 INFO L256 TraceCheckSpWp]: Trace formula consists of 1276 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-09 02:48:43,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:48:43,510 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2025-03-09 02:48:43,510 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:48:43,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [261538201] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:48:43,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:48:43,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [12] total 17 [2025-03-09 02:48:43,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292644291] [2025-03-09 02:48:43,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:48:43,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 02:48:43,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:48:43,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 02:48:43,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2025-03-09 02:48:43,512 INFO L87 Difference]: Start difference. First operand 432 states and 614 transitions. Second operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 7 states have internal predecessors, (62), 3 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-09 02:48:44,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:48:44,429 INFO L93 Difference]: Finished difference Result 1002 states and 1476 transitions. [2025-03-09 02:48:44,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-09 02:48:44,430 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 7 states have internal predecessors, (62), 3 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) Word has length 118 [2025-03-09 02:48:44,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:48:44,435 INFO L225 Difference]: With dead ends: 1002 [2025-03-09 02:48:44,435 INFO L226 Difference]: Without dead ends: 694 [2025-03-09 02:48:44,437 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=159, Invalid=393, Unknown=0, NotChecked=0, Total=552 [2025-03-09 02:48:44,438 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 521 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 823 mSolverCounterSat, 357 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 527 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 1180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 357 IncrementalHoareTripleChecker+Valid, 823 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-09 02:48:44,438 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [527 Valid, 693 Invalid, 1180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [357 Valid, 823 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-09 02:48:44,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2025-03-09 02:48:44,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 552. [2025-03-09 02:48:44,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 389 states have (on average 1.2416452442159382) internal successors, (483), 378 states have internal predecessors, (483), 123 states have call successors, (123), 20 states have call predecessors, (123), 36 states have return successors, (204), 153 states have call predecessors, (204), 122 states have call successors, (204) [2025-03-09 02:48:44,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 810 transitions. [2025-03-09 02:48:44,481 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 810 transitions. Word has length 118 [2025-03-09 02:48:44,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:48:44,482 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 810 transitions. [2025-03-09 02:48:44,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 7 states have internal predecessors, (62), 3 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-09 02:48:44,482 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 810 transitions. [2025-03-09 02:48:44,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-09 02:48:44,483 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:48:44,483 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-03-09 02:48:44,493 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-09 02:48:44,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:48:44,688 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ##fun~$Pointer$~TO~$Pointer$Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-09 02:48:44,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:48:44,688 INFO L85 PathProgramCache]: Analyzing trace with hash 648091669, now seen corresponding path program 1 times [2025-03-09 02:48:44,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:48:44,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984004222] [2025-03-09 02:48:44,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:44,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:48:44,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-09 02:48:45,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-09 02:48:45,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:45,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:46,467 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 16 proven. 64 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2025-03-09 02:48:46,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:48:46,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984004222] [2025-03-09 02:48:46,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984004222] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:48:46,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [358838714] [2025-03-09 02:48:46,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:46,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:48:46,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:48:46,469 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:48:46,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-09 02:48:46,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-09 02:48:46,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-09 02:48:46,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:46,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:46,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 1265 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-09 02:48:46,887 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:48:47,121 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-03-09 02:48:47,163 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-03-09 02:48:47,165 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-03-09 02:48:47,195 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 02:48:47,195 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-03-09 02:48:47,542 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 02:48:47,542 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-03-09 02:48:47,603 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 52 proven. 64 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-03-09 02:48:47,603 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:48:47,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [358838714] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:48:47,838 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 02:48:47,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 23 [2025-03-09 02:48:47,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445774660] [2025-03-09 02:48:47,838 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 02:48:47,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-09 02:48:47,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:48:47,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-09 02:48:47,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=544, Unknown=0, NotChecked=0, Total=650 [2025-03-09 02:48:47,840 INFO L87 Difference]: Start difference. First operand 552 states and 810 transitions. Second operand has 24 states, 23 states have (on average 5.434782608695652) internal successors, (125), 23 states have internal predecessors, (125), 4 states have call successors, (18), 6 states have call predecessors, (18), 7 states have return successors, (16), 6 states have call predecessors, (16), 4 states have call successors, (16) [2025-03-09 02:48:50,308 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-09 02:48:52,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:48:52,253 INFO L93 Difference]: Finished difference Result 910 states and 1333 transitions. [2025-03-09 02:48:52,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-09 02:48:52,253 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 5.434782608695652) internal successors, (125), 23 states have internal predecessors, (125), 4 states have call successors, (18), 6 states have call predecessors, (18), 7 states have return successors, (16), 6 states have call predecessors, (16), 4 states have call successors, (16) Word has length 118 [2025-03-09 02:48:52,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:48:52,260 INFO L225 Difference]: With dead ends: 910 [2025-03-09 02:48:52,260 INFO L226 Difference]: Without dead ends: 909 [2025-03-09 02:48:52,261 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 113 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 480 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=348, Invalid=1458, Unknown=0, NotChecked=0, Total=1806 [2025-03-09 02:48:52,262 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 1217 mSDsluCounter, 1076 mSDsCounter, 0 mSdLazyCounter, 1617 mSolverCounterSat, 637 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1222 SdHoareTripleChecker+Valid, 1211 SdHoareTripleChecker+Invalid, 2254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 637 IncrementalHoareTripleChecker+Valid, 1617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2025-03-09 02:48:52,263 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1222 Valid, 1211 Invalid, 2254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [637 Valid, 1617 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2025-03-09 02:48:52,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2025-03-09 02:48:52,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 758. [2025-03-09 02:48:52,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 758 states, 536 states have (on average 1.2462686567164178) internal successors, (668), 522 states have internal predecessors, (668), 164 states have call successors, (164), 29 states have call predecessors, (164), 54 states have return successors, (269), 206 states have call predecessors, (269), 162 states have call successors, (269) [2025-03-09 02:48:52,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 1101 transitions. [2025-03-09 02:48:52,324 INFO L78 Accepts]: Start accepts. Automaton has 758 states and 1101 transitions. Word has length 118 [2025-03-09 02:48:52,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:48:52,325 INFO L471 AbstractCegarLoop]: Abstraction has 758 states and 1101 transitions. [2025-03-09 02:48:52,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 5.434782608695652) internal successors, (125), 23 states have internal predecessors, (125), 4 states have call successors, (18), 6 states have call predecessors, (18), 7 states have return successors, (16), 6 states have call predecessors, (16), 4 states have call successors, (16) [2025-03-09 02:48:52,325 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 1101 transitions. [2025-03-09 02:48:52,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-09 02:48:52,326 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:48:52,326 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-03-09 02:48:52,335 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-09 02:48:52,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-09 02:48:52,531 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ##fun~$Pointer$~TO~$Pointer$Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-09 02:48:52,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:48:52,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1831264991, now seen corresponding path program 1 times [2025-03-09 02:48:52,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:48:52,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155275381] [2025-03-09 02:48:52,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:52,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:48:52,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-09 02:48:52,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-09 02:48:52,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:52,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:53,307 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2025-03-09 02:48:53,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:48:53,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155275381] [2025-03-09 02:48:53,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155275381] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:48:53,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1046076314] [2025-03-09 02:48:53,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:53,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:48:53,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:48:53,310 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:48:53,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-09 02:48:53,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-09 02:48:53,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-09 02:48:53,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:53,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:53,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 1266 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-09 02:48:53,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:48:53,901 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-03-09 02:48:54,114 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-03-09 02:48:54,142 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 64 proven. 2 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2025-03-09 02:48:54,142 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:48:54,343 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-03-09 02:48:54,347 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-03-09 02:48:54,510 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-03-09 02:48:54,514 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-03-09 02:48:54,602 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-03-09 02:48:54,609 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-03-09 02:48:54,764 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2025-03-09 02:48:54,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1046076314] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:48:54,764 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:48:54,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 14] total 33 [2025-03-09 02:48:54,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4574885] [2025-03-09 02:48:54,764 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:48:54,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-09 02:48:54,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:48:54,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-09 02:48:54,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=939, Unknown=0, NotChecked=0, Total=1056 [2025-03-09 02:48:54,766 INFO L87 Difference]: Start difference. First operand 758 states and 1101 transitions. Second operand has 33 states, 29 states have (on average 4.551724137931035) internal successors, (132), 32 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-03-09 02:48:59,273 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-03-09 02:49:02,771 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-09 02:49:06,785 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-03-09 02:49:08,288 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-09 02:49:13,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:49:13,951 INFO L93 Difference]: Finished difference Result 2178 states and 3091 transitions. [2025-03-09 02:49:13,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2025-03-09 02:49:13,951 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 29 states have (on average 4.551724137931035) internal successors, (132), 32 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-03-09 02:49:13,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:49:13,958 INFO L225 Difference]: With dead ends: 2178 [2025-03-09 02:49:13,959 INFO L226 Difference]: Without dead ends: 1450 [2025-03-09 02:49:13,963 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 221 SyntacticMatches, 3 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1435 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=998, Invalid=5164, Unknown=0, NotChecked=0, Total=6162 [2025-03-09 02:49:13,963 INFO L435 NwaCegarLoop]: 321 mSDtfsCounter, 1437 mSDsluCounter, 3638 mSDsCounter, 0 mSdLazyCounter, 6145 mSolverCounterSat, 806 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1443 SdHoareTripleChecker+Valid, 3959 SdHoareTripleChecker+Invalid, 6953 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 806 IncrementalHoareTripleChecker+Valid, 6145 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.3s IncrementalHoareTripleChecker+Time [2025-03-09 02:49:13,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1443 Valid, 3959 Invalid, 6953 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [806 Valid, 6145 Invalid, 2 Unknown, 0 Unchecked, 17.3s Time] [2025-03-09 02:49:13,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2025-03-09 02:49:14,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 1369. [2025-03-09 02:49:14,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1369 states, 984 states have (on average 1.2408536585365855) internal successors, (1221), 968 states have internal predecessors, (1221), 267 states have call successors, (267), 65 states have call predecessors, (267), 114 states have return successors, (441), 335 states have call predecessors, (441), 261 states have call successors, (441) [2025-03-09 02:49:14,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1369 states to 1369 states and 1929 transitions. [2025-03-09 02:49:14,091 INFO L78 Accepts]: Start accepts. Automaton has 1369 states and 1929 transitions. Word has length 118 [2025-03-09 02:49:14,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:49:14,091 INFO L471 AbstractCegarLoop]: Abstraction has 1369 states and 1929 transitions. [2025-03-09 02:49:14,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 29 states have (on average 4.551724137931035) internal successors, (132), 32 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-03-09 02:49:14,092 INFO L276 IsEmpty]: Start isEmpty. Operand 1369 states and 1929 transitions. [2025-03-09 02:49:14,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-09 02:49:14,093 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:49:14,093 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-03-09 02:49:14,103 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-09 02:49:14,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-09 02:49:14,297 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ##fun~$Pointer$~TO~$Pointer$Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-09 02:49:14,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:49:14,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1383994593, now seen corresponding path program 1 times [2025-03-09 02:49:14,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:49:14,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261600551] [2025-03-09 02:49:14,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:49:14,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:49:14,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-09 02:49:14,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-09 02:49:14,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:49:14,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 02:49:14,582 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 02:49:14,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-09 02:49:14,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-09 02:49:14,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:49:14,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 02:49:14,864 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 02:49:14,866 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-09 02:49:14,867 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ##fun~$Pointer$~TO~$Pointer$Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 16 remaining) [2025-03-09 02:49:14,869 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location __CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 16 remaining) [2025-03-09 02:49:14,872 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 16 remaining) [2025-03-09 02:49:14,872 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ##fun~$Pointer$~TO~$Pointer$Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 16 remaining) [2025-03-09 02:49:14,872 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ##fun~$Pointer$~TO~$Pointer$Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 16 remaining) [2025-03-09 02:49:14,872 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ##fun~$Pointer$~TO~$Pointer$Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 16 remaining) [2025-03-09 02:49:14,872 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location __CS_csErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 16 remaining) [2025-03-09 02:49:14,872 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location __CS_csErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 16 remaining) [2025-03-09 02:49:14,872 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location __CS_csErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 16 remaining) [2025-03-09 02:49:14,872 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location __CS_csErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 16 remaining) [2025-03-09 02:49:14,872 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location __CS_pthread_mutex_unlockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 16 remaining) [2025-03-09 02:49:14,872 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location __CS_pthread_mutex_unlockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 16 remaining) [2025-03-09 02:49:14,872 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 16 remaining) [2025-03-09 02:49:14,872 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 16 remaining) [2025-03-09 02:49:14,872 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 16 remaining) [2025-03-09 02:49:14,872 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 16 remaining) [2025-03-09 02:49:14,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-09 02:49:14,875 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:49:14,991 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 02:49:14,994 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 02:49:14 BoogieIcfgContainer [2025-03-09 02:49:14,995 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 02:49:14,995 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 02:49:14,995 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 02:49:14,996 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 02:49:14,996 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:48:13" (3/4) ... [2025-03-09 02:49:14,997 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-09 02:49:15,085 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 48. [2025-03-09 02:49:15,149 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-09 02:49:15,149 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-09 02:49:15,149 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 02:49:15,150 INFO L158 Benchmark]: Toolchain (without parser) took 63824.82ms. Allocated memory was 167.8MB in the beginning and 276.8MB in the end (delta: 109.1MB). Free memory was 121.8MB in the beginning and 122.0MB in the end (delta: -138.5kB). Peak memory consumption was 106.5MB. Max. memory is 16.1GB. [2025-03-09 02:49:15,150 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 116.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 02:49:15,150 INFO L158 Benchmark]: CACSL2BoogieTranslator took 434.70ms. Allocated memory is still 167.8MB. Free memory was 121.8MB in the beginning and 96.9MB in the end (delta: 24.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-09 02:49:15,151 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.17ms. Allocated memory is still 167.8MB. Free memory was 96.9MB in the beginning and 92.3MB in the end (delta: 4.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 02:49:15,151 INFO L158 Benchmark]: Boogie Preprocessor took 66.48ms. Allocated memory is still 167.8MB. Free memory was 92.3MB in the beginning and 85.8MB in the end (delta: 6.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 02:49:15,151 INFO L158 Benchmark]: IcfgBuilder took 1475.21ms. Allocated memory is still 167.8MB. Free memory was 85.8MB in the beginning and 110.1MB in the end (delta: -24.3MB). Peak memory consumption was 69.3MB. Max. memory is 16.1GB. [2025-03-09 02:49:15,152 INFO L158 Benchmark]: TraceAbstraction took 61638.71ms. Allocated memory was 167.8MB in the beginning and 276.8MB in the end (delta: 109.1MB). Free memory was 109.3MB in the beginning and 144.3MB in the end (delta: -35.0MB). Peak memory consumption was 154.6MB. Max. memory is 16.1GB. [2025-03-09 02:49:15,152 INFO L158 Benchmark]: Witness Printer took 153.94ms. Allocated memory is still 276.8MB. Free memory was 144.3MB in the beginning and 122.0MB in the end (delta: 22.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-09 02:49:15,154 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.19ms. Allocated memory is still 201.3MB. Free memory is still 116.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 434.70ms. Allocated memory is still 167.8MB. Free memory was 121.8MB in the beginning and 96.9MB in the end (delta: 24.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.17ms. Allocated memory is still 167.8MB. Free memory was 96.9MB in the beginning and 92.3MB in the end (delta: 4.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.48ms. Allocated memory is still 167.8MB. Free memory was 92.3MB in the beginning and 85.8MB in the end (delta: 6.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 1475.21ms. Allocated memory is still 167.8MB. Free memory was 85.8MB in the beginning and 110.1MB in the end (delta: -24.3MB). Peak memory consumption was 69.3MB. Max. memory is 16.1GB. * TraceAbstraction took 61638.71ms. Allocated memory was 167.8MB in the beginning and 276.8MB in the end (delta: 109.1MB). Free memory was 109.3MB in the beginning and 144.3MB in the end (delta: -35.0MB). Peak memory consumption was 154.6MB. Max. memory is 16.1GB. * Witness Printer took 153.94ms. Allocated memory is still 276.8MB. Free memory was 144.3MB in the beginning and 122.0MB in the end (delta: 22.3MB). Peak memory consumption was 16.8MB. 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=1, 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=1, __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=1, __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=1, __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=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}] [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=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] CALL __CS_cs() VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=1, \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=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}] [L560] unsigned char k = __VERIFIER_nondet_uchar(); [L561] EXPR __CS_round+k VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=1, \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=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}] [L561] COND FALSE !(!(__CS_round+k < 2)) VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=1, \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=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}, k=0, 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=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}] [L780] CALL __CS_thread[1](0) VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=1, \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}] [L683] CALL __CS_cs() VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=1, \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}] [L560] unsigned char k = __VERIFIER_nondet_uchar(); [L561] EXPR __CS_round+k VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=1, \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}] [L561] COND FALSE !(!(__CS_round+k < 2)) VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=1, \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}, 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)=1, \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}] [L683] COND FALSE !(__CS_ret != 0) VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=1, \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}] [L684] CALL __CS_pthread_mutex_lock(&mutex[__CS_round]) VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=1, \old(__CS_thread_index)=1, \old(lock)={8: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}] [L580] EXPR \read(*lock) VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=1, \old(__CS_thread_index)=1, \old(lock)={8: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}, lock={8:1}, 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)=1, \old(__CS_thread_index)=1, \old(lock)={8:1}, \result=0, __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}] [L684] RET __CS_pthread_mutex_lock(&mutex[__CS_round]) VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=1, \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] CALL __CS_cs() VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=1, \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}] [L560] unsigned char k = __VERIFIER_nondet_uchar(); [L561] EXPR __CS_round+k VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=1, \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}] [L561] COND FALSE !(!(__CS_round+k < 2)) VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=1, \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}, k=0, 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)=1, \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)=1, \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, 312 edges, 16 error locations. Started 1 CEGAR loops. OverallTime: 61.5s, OverallIterations: 19, TraceHistogramMax: 8, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 45.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 6 mSolverCounterUnknown, 5255 SdHoareTripleChecker+Valid, 41.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5134 mSDsluCounter, 14429 SdHoareTripleChecker+Invalid, 40.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10340 mSDsCounter, 2431 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10575 IncrementalHoareTripleChecker+Invalid, 13012 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2431 mSolverCounterUnsat, 4089 mSDtfsCounter, 10575 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 930 GetRequests, 719 SyntacticMatches, 6 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2043 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1369occurred in iteration=18, InterpolantAutomatonStates: 161, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 18 MinimizatonAttempts, 449 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 9.4s InterpolantComputationTime, 1743 NumberOfCodeBlocks, 1663 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1809 ConstructedInterpolants, 0 QuantifiedInterpolants, 9496 SizeOfPredicates, 31 NumberOfNonLiveVariables, 6402 ConjunctsInSsa, 89 ConjunctsInUnsatCore, 30 InterpolantComputations, 14 PerfectInterpolantSequences, 2234/2409 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-03-09 02:49:15,180 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW)