./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-overflow.prp --file ../../../trunk/examples/svcomp/pthread-C-DAC/pthread-demo-datarace-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version da043454 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 ../../../trunk/examples/svcomp/pthread-C-DAC/pthread-demo-datarace-1.c -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 f3a0a18d534b5c74c7f313c135e18ad72f924c260e0f7593009872b066240777 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:04:18,223 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:04:18,272 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-04-29 11:04:18,276 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:04:18,278 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:04:18,297 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:04:18,298 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:04:18,298 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:04:18,298 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-29 11:04:18,298 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-29 11:04:18,299 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:04:18,299 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:04:18,299 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:04:18,299 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:04:18,300 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:04:18,300 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:04:18,300 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-29 11:04:18,300 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:04:18,300 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:04:18,300 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:04:18,300 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:04:18,300 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-29 11:04:18,300 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:04:18,300 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-29 11:04:18,300 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-04-29 11:04:18,300 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:04:18,300 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:04:18,300 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-29 11:04:18,300 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:04:18,300 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:04:18,301 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:04:18,301 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:04:18,301 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:04:18,301 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:04:18,301 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:04:18,301 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:04:18,301 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:04:18,301 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:04:18,301 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:04:18,301 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:04:18,301 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:04:18,301 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:04:18,301 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-29 11:04:18,301 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-29 11:04:18,302 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:04:18,302 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:04:18,302 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:04:18,302 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:04:18,302 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:04:18,302 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 -> f3a0a18d534b5c74c7f313c135e18ad72f924c260e0f7593009872b066240777 [2025-04-29 11:04:18,542 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:04:18,548 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:04:18,549 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:04:18,550 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:04:18,551 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:04:18,552 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-C-DAC/pthread-demo-datarace-1.c [2025-04-29 11:04:19,915 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f3b5ee40/19e99f27dd8b4db48a3a16ce7bf3c19c/FLAG95ff89e23 [2025-04-29 11:04:20,131 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:04:20,132 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-C-DAC/pthread-demo-datarace-1.c [2025-04-29 11:04:20,133 WARN L117 ultiparseSymbolTable]: System include assert.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:04:20,133 WARN L117 ultiparseSymbolTable]: System include pthread.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:04:20,133 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:04:20,133 WARN L117 ultiparseSymbolTable]: System include stdio.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:04:20,138 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f3b5ee40/19e99f27dd8b4db48a3a16ce7bf3c19c/FLAG95ff89e23 [2025-04-29 11:04:20,916 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f3b5ee40/19e99f27dd8b4db48a3a16ce7bf3c19c [2025-04-29 11:04:20,918 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:04:20,919 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:04:20,920 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:04:20,920 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:04:20,925 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:04:20,926 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:04:20" (1/1) ... [2025-04-29 11:04:20,927 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72a13d23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:04:20, skipping insertion in model container [2025-04-29 11:04:20,927 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:04:20" (1/1) ... [2025-04-29 11:04:20,938 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:04:21,082 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:04:21,088 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:04:21,110 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:04:21,124 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:04:21,125 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:04:21 WrapperNode [2025-04-29 11:04:21,125 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:04:21,125 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:04:21,127 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:04:21,127 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:04:21,131 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:04:21" (1/1) ... [2025-04-29 11:04:21,136 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:04:21" (1/1) ... [2025-04-29 11:04:21,149 INFO L138 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 57 [2025-04-29 11:04:21,150 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:04:21,151 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:04:21,151 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:04:21,151 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:04:21,156 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:04:21" (1/1) ... [2025-04-29 11:04:21,156 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:04:21" (1/1) ... [2025-04-29 11:04:21,157 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:04:21" (1/1) ... [2025-04-29 11:04:21,169 INFO L175 MemorySlicer]: Split 1 memory accesses to 1 slices as follows [1]. 100 percent of accesses are in the largest equivalence class. The 1 initializations are split as follows [1]. The 0 writes are split as follows [0]. [2025-04-29 11:04:21,169 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:04:21" (1/1) ... [2025-04-29 11:04:21,169 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:04:21" (1/1) ... [2025-04-29 11:04:21,172 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:04:21" (1/1) ... [2025-04-29 11:04:21,172 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:04:21" (1/1) ... [2025-04-29 11:04:21,174 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:04:21" (1/1) ... [2025-04-29 11:04:21,175 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:04:21" (1/1) ... [2025-04-29 11:04:21,175 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:04:21" (1/1) ... [2025-04-29 11:04:21,178 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:04:21,178 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:04:21,178 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:04:21,179 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:04:21,179 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:04:21" (1/1) ... [2025-04-29 11:04:21,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:04:21,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:04:21,206 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-04-29 11:04:21,208 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-04-29 11:04:21,225 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-29 11:04:21,226 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-29 11:04:21,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-29 11:04:21,226 INFO L130 BoogieDeclarations]: Found specification of procedure thread_function_mutex [2025-04-29 11:04:21,226 INFO L138 BoogieDeclarations]: Found implementation of procedure thread_function_mutex [2025-04-29 11:04:21,227 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-29 11:04:21,227 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:04:21,227 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:04:21,228 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-29 11:04:21,291 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:04:21,293 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:04:21,439 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-29 11:04:21,440 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:04:21,508 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:04:21,508 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-29 11:04:21,508 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:04:21 BoogieIcfgContainer [2025-04-29 11:04:21,509 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:04:21,510 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:04:21,510 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:04:21,513 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:04:21,514 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:04:20" (1/3) ... [2025-04-29 11:04:21,514 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d961c50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:04:21, skipping insertion in model container [2025-04-29 11:04:21,514 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:04:21" (2/3) ... [2025-04-29 11:04:21,514 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d961c50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:04:21, skipping insertion in model container [2025-04-29 11:04:21,514 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:04:21" (3/3) ... [2025-04-29 11:04:21,515 INFO L128 eAbstractionObserver]: Analyzing ICFG pthread-demo-datarace-1.c [2025-04-29 11:04:21,526 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:04:21,527 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pthread-demo-datarace-1.c that has 2 procedures, 34 locations, 34 edges, 1 initial locations, 2 loop locations, and 8 error locations. [2025-04-29 11:04:21,527 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-29 11:04:21,563 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-04-29 11:04:21,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 35 transitions, 77 flow [2025-04-29 11:04:21,607 INFO L116 PetriNetUnfolderBase]: 2/34 cut-off events. [2025-04-29 11:04:21,610 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-29 11:04:21,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 34 events. 2/34 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 70 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 30. Up to 2 conditions per place. [2025-04-29 11:04:21,611 INFO L82 GeneralOperation]: Start removeDead. Operand has 37 places, 35 transitions, 77 flow [2025-04-29 11:04:21,613 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 34 places, 32 transitions, 67 flow [2025-04-29 11:04:21,622 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:04:21,633 INFO L340 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;@1cbff961, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:04:21,634 INFO L341 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-04-29 11:04:21,639 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-29 11:04:21,639 INFO L116 PetriNetUnfolderBase]: 0/12 cut-off events. [2025-04-29 11:04:21,639 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:04:21,639 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:04:21,643 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:04:21,643 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-04-29 11:04:21,648 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:04:21,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1591952135, now seen corresponding path program 1 times [2025-04-29 11:04:21,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:04:21,654 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366504119] [2025-04-29 11:04:21,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:04:21,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:04:21,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-29 11:04:21,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-29 11:04:21,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:04:21,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:04:21,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:04:21,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:04:21,798 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366504119] [2025-04-29 11:04:21,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366504119] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:04:21,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:04:21,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-29 11:04:21,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949523017] [2025-04-29 11:04:21,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:04:21,806 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:04:21,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:04:21,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:04:21,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:04:21,837 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 35 [2025-04-29 11:04:21,839 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 32 transitions, 67 flow. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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-04-29 11:04:21,839 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:04:21,839 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 35 [2025-04-29 11:04:21,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:04:21,916 INFO L116 PetriNetUnfolderBase]: 79/235 cut-off events. [2025-04-29 11:04:21,916 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:04:21,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 398 conditions, 235 events. 79/235 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1052 event pairs, 26 based on Foata normal form. 3/203 useless extension candidates. Maximal degree in co-relation 389. Up to 135 conditions per place. [2025-04-29 11:04:21,919 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 23 selfloop transitions, 3 changer transitions 0/40 dead transitions. [2025-04-29 11:04:21,920 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 40 transitions, 135 flow [2025-04-29 11:04:21,921 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:04:21,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:04:21,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2025-04-29 11:04:21,929 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6952380952380952 [2025-04-29 11:04:21,930 INFO L175 Difference]: Start difference. First operand has 34 places, 32 transitions, 67 flow. Second operand 3 states and 73 transitions. [2025-04-29 11:04:21,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 40 transitions, 135 flow [2025-04-29 11:04:21,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 40 transitions, 134 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:04:21,936 INFO L231 Difference]: Finished difference. Result has 36 places, 34 transitions, 87 flow [2025-04-29 11:04:21,937 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=87, PETRI_PLACES=36, PETRI_TRANSITIONS=34} [2025-04-29 11:04:21,940 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 2 predicate places. [2025-04-29 11:04:21,940 INFO L485 AbstractCegarLoop]: Abstraction has has 36 places, 34 transitions, 87 flow [2025-04-29 11:04:21,940 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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-04-29 11:04:21,940 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:04:21,940 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:04:21,941 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:04:21,941 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting thread_function_mutexErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-04-29 11:04:21,941 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:04:21,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1617915314, now seen corresponding path program 1 times [2025-04-29 11:04:21,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:04:21,942 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042223153] [2025-04-29 11:04:21,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:04:21,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:04:21,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-29 11:04:21,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-29 11:04:21,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:04:21,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:04:22,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:04:22,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:04:22,007 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042223153] [2025-04-29 11:04:22,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042223153] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:04:22,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:04:22,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:04:22,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074073670] [2025-04-29 11:04:22,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:04:22,009 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:04:22,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:04:22,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:04:22,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:04:22,023 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2025-04-29 11:04:22,023 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 34 transitions, 87 flow. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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-04-29 11:04:22,023 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:04:22,024 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2025-04-29 11:04:22,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:04:22,155 INFO L116 PetriNetUnfolderBase]: 102/272 cut-off events. [2025-04-29 11:04:22,155 INFO L117 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2025-04-29 11:04:22,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 547 conditions, 272 events. 102/272 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1264 event pairs, 34 based on Foata normal form. 20/262 useless extension candidates. Maximal degree in co-relation 536. Up to 173 conditions per place. [2025-04-29 11:04:22,157 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 33 selfloop transitions, 6 changer transitions 0/51 dead transitions. [2025-04-29 11:04:22,157 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 51 transitions, 210 flow [2025-04-29 11:04:22,159 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:04:22,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-29 11:04:22,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 108 transitions. [2025-04-29 11:04:22,161 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6171428571428571 [2025-04-29 11:04:22,161 INFO L175 Difference]: Start difference. First operand has 36 places, 34 transitions, 87 flow. Second operand 5 states and 108 transitions. [2025-04-29 11:04:22,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 51 transitions, 210 flow [2025-04-29 11:04:22,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 51 transitions, 206 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:04:22,162 INFO L231 Difference]: Finished difference. Result has 42 places, 37 transitions, 126 flow [2025-04-29 11:04:22,162 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=126, PETRI_PLACES=42, PETRI_TRANSITIONS=37} [2025-04-29 11:04:22,163 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 8 predicate places. [2025-04-29 11:04:22,163 INFO L485 AbstractCegarLoop]: Abstraction has has 42 places, 37 transitions, 126 flow [2025-04-29 11:04:22,163 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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-04-29 11:04:22,163 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:04:22,163 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:04:22,163 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 11:04:22,163 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting thread_function_mutexErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-04-29 11:04:22,165 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:04:22,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1690651787, now seen corresponding path program 1 times [2025-04-29 11:04:22,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:04:22,165 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676852553] [2025-04-29 11:04:22,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:04:22,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:04:22,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-29 11:04:22,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-29 11:04:22,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:04:22,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:04:22,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:04:22,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:04:22,237 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676852553] [2025-04-29 11:04:22,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676852553] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:04:22,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:04:22,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:04:22,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167890092] [2025-04-29 11:04:22,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:04:22,237 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:04:22,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:04:22,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:04:22,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:04:22,245 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 35 [2025-04-29 11:04:22,245 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 37 transitions, 126 flow. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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-04-29 11:04:22,245 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:04:22,245 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 35 [2025-04-29 11:04:22,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:04:22,362 INFO L116 PetriNetUnfolderBase]: 117/340 cut-off events. [2025-04-29 11:04:22,362 INFO L117 PetriNetUnfolderBase]: For 131/141 co-relation queries the response was YES. [2025-04-29 11:04:22,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 744 conditions, 340 events. 117/340 cut-off events. For 131/141 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1622 event pairs, 39 based on Foata normal form. 14/330 useless extension candidates. Maximal degree in co-relation 729. Up to 132 conditions per place. [2025-04-29 11:04:22,364 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 39 selfloop transitions, 3 changer transitions 0/56 dead transitions. [2025-04-29 11:04:22,364 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 56 transitions, 263 flow [2025-04-29 11:04:22,365 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:04:22,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-29 11:04:22,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions. [2025-04-29 11:04:22,366 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7071428571428572 [2025-04-29 11:04:22,366 INFO L175 Difference]: Start difference. First operand has 42 places, 37 transitions, 126 flow. Second operand 4 states and 99 transitions. [2025-04-29 11:04:22,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 56 transitions, 263 flow [2025-04-29 11:04:22,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 56 transitions, 253 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:04:22,368 INFO L231 Difference]: Finished difference. Result has 45 places, 39 transitions, 142 flow [2025-04-29 11:04:22,369 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=142, PETRI_PLACES=45, PETRI_TRANSITIONS=39} [2025-04-29 11:04:22,369 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 11 predicate places. [2025-04-29 11:04:22,369 INFO L485 AbstractCegarLoop]: Abstraction has has 45 places, 39 transitions, 142 flow [2025-04-29 11:04:22,369 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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-04-29 11:04:22,369 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:04:22,369 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:04:22,370 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 11:04:22,370 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-04-29 11:04:22,370 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:04:22,370 INFO L85 PathProgramCache]: Analyzing trace with hash -429758435, now seen corresponding path program 1 times [2025-04-29 11:04:22,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:04:22,370 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359186891] [2025-04-29 11:04:22,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:04:22,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:04:22,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-29 11:04:22,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-29 11:04:22,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:04:22,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:04:22,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:04:22,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:04:22,416 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359186891] [2025-04-29 11:04:22,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359186891] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:04:22,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:04:22,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:04:22,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875726988] [2025-04-29 11:04:22,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:04:22,417 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:04:22,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:04:22,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:04:22,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:04:22,432 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 35 [2025-04-29 11:04:22,432 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 39 transitions, 142 flow. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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-04-29 11:04:22,432 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:04:22,432 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 35 [2025-04-29 11:04:22,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:04:22,561 INFO L116 PetriNetUnfolderBase]: 217/596 cut-off events. [2025-04-29 11:04:22,562 INFO L117 PetriNetUnfolderBase]: For 391/451 co-relation queries the response was YES. [2025-04-29 11:04:22,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1378 conditions, 596 events. 217/596 cut-off events. For 391/451 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 3089 event pairs, 79 based on Foata normal form. 29/604 useless extension candidates. Maximal degree in co-relation 1362. Up to 278 conditions per place. [2025-04-29 11:04:22,566 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 52 selfloop transitions, 3 changer transitions 0/68 dead transitions. [2025-04-29 11:04:22,567 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 68 transitions, 371 flow [2025-04-29 11:04:22,567 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:04:22,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-29 11:04:22,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions. [2025-04-29 11:04:22,567 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7071428571428572 [2025-04-29 11:04:22,568 INFO L175 Difference]: Start difference. First operand has 45 places, 39 transitions, 142 flow. Second operand 4 states and 99 transitions. [2025-04-29 11:04:22,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 68 transitions, 371 flow [2025-04-29 11:04:22,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 68 transitions, 365 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:04:22,570 INFO L231 Difference]: Finished difference. Result has 49 places, 41 transitions, 164 flow [2025-04-29 11:04:22,570 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=164, PETRI_PLACES=49, PETRI_TRANSITIONS=41} [2025-04-29 11:04:22,570 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 15 predicate places. [2025-04-29 11:04:22,571 INFO L485 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 164 flow [2025-04-29 11:04:22,571 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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-04-29 11:04:22,571 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:04:22,571 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:04:22,571 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-29 11:04:22,571 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-04-29 11:04:22,571 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:04:22,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1253272637, now seen corresponding path program 1 times [2025-04-29 11:04:22,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:04:22,572 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478758126] [2025-04-29 11:04:22,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:04:22,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:04:22,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-29 11:04:22,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-29 11:04:22,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:04:22,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:04:22,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:04:22,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:04:22,619 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478758126] [2025-04-29 11:04:22,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478758126] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:04:22,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:04:22,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:04:22,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107664293] [2025-04-29 11:04:22,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:04:22,619 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:04:22,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:04:22,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:04:22,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:04:22,620 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 35 [2025-04-29 11:04:22,620 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 164 flow. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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-04-29 11:04:22,620 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:04:22,620 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 35 [2025-04-29 11:04:22,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:04:22,691 INFO L116 PetriNetUnfolderBase]: 111/410 cut-off events. [2025-04-29 11:04:22,691 INFO L117 PetriNetUnfolderBase]: For 271/287 co-relation queries the response was YES. [2025-04-29 11:04:22,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1013 conditions, 410 events. 111/410 cut-off events. For 271/287 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1954 event pairs, 37 based on Foata normal form. 20/428 useless extension candidates. Maximal degree in co-relation 995. Up to 128 conditions per place. [2025-04-29 11:04:22,695 INFO L140 encePairwiseOnDemand]: 31/35 looper letters, 30 selfloop transitions, 4 changer transitions 0/50 dead transitions. [2025-04-29 11:04:22,696 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 50 transitions, 269 flow [2025-04-29 11:04:22,696 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:04:22,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:04:22,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2025-04-29 11:04:22,697 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7238095238095238 [2025-04-29 11:04:22,697 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 164 flow. Second operand 3 states and 76 transitions. [2025-04-29 11:04:22,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 50 transitions, 269 flow [2025-04-29 11:04:22,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 50 transitions, 259 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-04-29 11:04:22,701 INFO L231 Difference]: Finished difference. Result has 48 places, 39 transitions, 151 flow [2025-04-29 11:04:22,701 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=151, PETRI_PLACES=48, PETRI_TRANSITIONS=39} [2025-04-29 11:04:22,702 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 14 predicate places. [2025-04-29 11:04:22,702 INFO L485 AbstractCegarLoop]: Abstraction has has 48 places, 39 transitions, 151 flow [2025-04-29 11:04:22,702 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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-04-29 11:04:22,702 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:04:22,702 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:04:22,702 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-29 11:04:22,702 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-04-29 11:04:22,703 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:04:22,703 INFO L85 PathProgramCache]: Analyzing trace with hash 838827785, now seen corresponding path program 1 times [2025-04-29 11:04:22,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:04:22,703 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452328435] [2025-04-29 11:04:22,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:04:22,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:04:22,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-29 11:04:22,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-29 11:04:22,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:04:22,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:04:22,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:04:22,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:04:22,766 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452328435] [2025-04-29 11:04:22,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452328435] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:04:22,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:04:22,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:04:22,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665838104] [2025-04-29 11:04:22,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:04:22,767 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:04:22,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:04:22,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:04:22,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:04:22,779 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2025-04-29 11:04:22,779 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 39 transitions, 151 flow. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 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-04-29 11:04:22,780 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:04:22,780 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2025-04-29 11:04:22,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:04:22,889 INFO L116 PetriNetUnfolderBase]: 206/602 cut-off events. [2025-04-29 11:04:22,889 INFO L117 PetriNetUnfolderBase]: For 412/448 co-relation queries the response was YES. [2025-04-29 11:04:22,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1611 conditions, 602 events. 206/602 cut-off events. For 412/448 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 3213 event pairs, 81 based on Foata normal form. 10/587 useless extension candidates. Maximal degree in co-relation 1594. Up to 223 conditions per place. [2025-04-29 11:04:22,892 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 46 selfloop transitions, 6 changer transitions 0/64 dead transitions. [2025-04-29 11:04:22,892 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 64 transitions, 359 flow [2025-04-29 11:04:22,892 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:04:22,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-29 11:04:22,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 110 transitions. [2025-04-29 11:04:22,893 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6285714285714286 [2025-04-29 11:04:22,893 INFO L175 Difference]: Start difference. First operand has 48 places, 39 transitions, 151 flow. Second operand 5 states and 110 transitions. [2025-04-29 11:04:22,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 64 transitions, 359 flow [2025-04-29 11:04:22,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 64 transitions, 349 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:04:22,896 INFO L231 Difference]: Finished difference. Result has 53 places, 41 transitions, 180 flow [2025-04-29 11:04:22,896 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=147, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=180, PETRI_PLACES=53, PETRI_TRANSITIONS=41} [2025-04-29 11:04:22,896 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 19 predicate places. [2025-04-29 11:04:22,896 INFO L485 AbstractCegarLoop]: Abstraction has has 53 places, 41 transitions, 180 flow [2025-04-29 11:04:22,896 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 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-04-29 11:04:22,897 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:04:22,897 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:04:22,897 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-29 11:04:22,897 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting thread_function_mutexErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-04-29 11:04:22,897 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:04:22,897 INFO L85 PathProgramCache]: Analyzing trace with hash 119676153, now seen corresponding path program 1 times [2025-04-29 11:04:22,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:04:22,897 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998110589] [2025-04-29 11:04:22,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:04:22,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:04:22,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-29 11:04:22,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-29 11:04:22,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:04:22,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:04:22,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:04:22,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:04:22,936 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998110589] [2025-04-29 11:04:22,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998110589] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:04:22,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:04:22,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:04:22,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414679603] [2025-04-29 11:04:22,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:04:22,936 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:04:22,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:04:22,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:04:22,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:04:22,948 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2025-04-29 11:04:22,949 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 180 flow. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 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-04-29 11:04:22,949 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:04:22,949 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2025-04-29 11:04:22,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:04:23,114 INFO L116 PetriNetUnfolderBase]: 245/768 cut-off events. [2025-04-29 11:04:23,115 INFO L117 PetriNetUnfolderBase]: For 731/762 co-relation queries the response was YES. [2025-04-29 11:04:23,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2036 conditions, 768 events. 245/768 cut-off events. For 731/762 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 4380 event pairs, 105 based on Foata normal form. 16/773 useless extension candidates. Maximal degree in co-relation 2015. Up to 272 conditions per place. [2025-04-29 11:04:23,118 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 65 selfloop transitions, 7 changer transitions 0/84 dead transitions. [2025-04-29 11:04:23,118 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 84 transitions, 509 flow [2025-04-29 11:04:23,119 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:04:23,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:04:23,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 135 transitions. [2025-04-29 11:04:23,120 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6428571428571429 [2025-04-29 11:04:23,120 INFO L175 Difference]: Start difference. First operand has 53 places, 41 transitions, 180 flow. Second operand 6 states and 135 transitions. [2025-04-29 11:04:23,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 84 transitions, 509 flow [2025-04-29 11:04:23,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 84 transitions, 504 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:04:23,124 INFO L231 Difference]: Finished difference. Result has 59 places, 45 transitions, 233 flow [2025-04-29 11:04:23,125 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=233, PETRI_PLACES=59, PETRI_TRANSITIONS=45} [2025-04-29 11:04:23,125 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 25 predicate places. [2025-04-29 11:04:23,126 INFO L485 AbstractCegarLoop]: Abstraction has has 59 places, 45 transitions, 233 flow [2025-04-29 11:04:23,126 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 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-04-29 11:04:23,126 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:04:23,126 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:04:23,127 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-29 11:04:23,127 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-04-29 11:04:23,127 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:04:23,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1991724116, now seen corresponding path program 1 times [2025-04-29 11:04:23,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:04:23,127 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154296475] [2025-04-29 11:04:23,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:04:23,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:04:23,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-29 11:04:23,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-29 11:04:23,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:04:23,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:04:23,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:04:23,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:04:23,186 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154296475] [2025-04-29 11:04:23,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154296475] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:04:23,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:04:23,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:04:23,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980798555] [2025-04-29 11:04:23,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:04:23,189 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:04:23,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:04:23,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:04:23,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:04:23,208 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2025-04-29 11:04:23,209 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 45 transitions, 233 flow. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 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-04-29 11:04:23,209 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:04:23,209 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2025-04-29 11:04:23,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:04:23,308 INFO L116 PetriNetUnfolderBase]: 244/721 cut-off events. [2025-04-29 11:04:23,309 INFO L117 PetriNetUnfolderBase]: For 1022/1093 co-relation queries the response was YES. [2025-04-29 11:04:23,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2078 conditions, 721 events. 244/721 cut-off events. For 1022/1093 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 3896 event pairs, 100 based on Foata normal form. 5/724 useless extension candidates. Maximal degree in co-relation 2053. Up to 447 conditions per place. [2025-04-29 11:04:23,313 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 51 selfloop transitions, 7 changer transitions 0/70 dead transitions. [2025-04-29 11:04:23,313 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 70 transitions, 464 flow [2025-04-29 11:04:23,313 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:04:23,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-29 11:04:23,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 110 transitions. [2025-04-29 11:04:23,314 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6285714285714286 [2025-04-29 11:04:23,314 INFO L175 Difference]: Start difference. First operand has 59 places, 45 transitions, 233 flow. Second operand 5 states and 110 transitions. [2025-04-29 11:04:23,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 70 transitions, 464 flow [2025-04-29 11:04:23,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 70 transitions, 457 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-04-29 11:04:23,318 INFO L231 Difference]: Finished difference. Result has 63 places, 47 transitions, 267 flow [2025-04-29 11:04:23,318 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=267, PETRI_PLACES=63, PETRI_TRANSITIONS=47} [2025-04-29 11:04:23,318 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 29 predicate places. [2025-04-29 11:04:23,318 INFO L485 AbstractCegarLoop]: Abstraction has has 63 places, 47 transitions, 267 flow [2025-04-29 11:04:23,319 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 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-04-29 11:04:23,319 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:04:23,319 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:04:23,319 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-29 11:04:23,319 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting thread_function_mutexErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-04-29 11:04:23,319 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:04:23,319 INFO L85 PathProgramCache]: Analyzing trace with hash -585006286, now seen corresponding path program 1 times [2025-04-29 11:04:23,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:04:23,319 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669389395] [2025-04-29 11:04:23,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:04:23,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:04:23,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-29 11:04:23,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-29 11:04:23,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:04:23,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:04:23,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:04:23,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:04:23,355 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669389395] [2025-04-29 11:04:23,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669389395] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:04:23,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:04:23,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:04:23,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881611627] [2025-04-29 11:04:23,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:04:23,355 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:04:23,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:04:23,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:04:23,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:04:23,365 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2025-04-29 11:04:23,365 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 47 transitions, 267 flow. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 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-04-29 11:04:23,365 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:04:23,365 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2025-04-29 11:04:23,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:04:23,510 INFO L116 PetriNetUnfolderBase]: 242/799 cut-off events. [2025-04-29 11:04:23,510 INFO L117 PetriNetUnfolderBase]: For 1207/1214 co-relation queries the response was YES. [2025-04-29 11:04:23,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2272 conditions, 799 events. 242/799 cut-off events. For 1207/1214 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 4798 event pairs, 121 based on Foata normal form. 3/792 useless extension candidates. Maximal degree in co-relation 2245. Up to 457 conditions per place. [2025-04-29 11:04:23,515 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 50 selfloop transitions, 9 changer transitions 0/71 dead transitions. [2025-04-29 11:04:23,515 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 71 transitions, 494 flow [2025-04-29 11:04:23,516 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:04:23,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-29 11:04:23,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 137 transitions. [2025-04-29 11:04:23,516 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5591836734693878 [2025-04-29 11:04:23,516 INFO L175 Difference]: Start difference. First operand has 63 places, 47 transitions, 267 flow. Second operand 7 states and 137 transitions. [2025-04-29 11:04:23,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 71 transitions, 494 flow [2025-04-29 11:04:23,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 71 transitions, 481 flow, removed 4 selfloop flow, removed 2 redundant places. [2025-04-29 11:04:23,520 INFO L231 Difference]: Finished difference. Result has 69 places, 50 transitions, 310 flow [2025-04-29 11:04:23,521 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=310, PETRI_PLACES=69, PETRI_TRANSITIONS=50} [2025-04-29 11:04:23,522 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 35 predicate places. [2025-04-29 11:04:23,522 INFO L485 AbstractCegarLoop]: Abstraction has has 69 places, 50 transitions, 310 flow [2025-04-29 11:04:23,522 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 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-04-29 11:04:23,522 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:04:23,522 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:04:23,522 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-29 11:04:23,523 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting thread_function_mutexErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-04-29 11:04:23,523 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:04:23,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1549441248, now seen corresponding path program 1 times [2025-04-29 11:04:23,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:04:23,524 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118677998] [2025-04-29 11:04:23,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:04:23,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:04:23,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-29 11:04:23,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-29 11:04:23,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:04:23,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:04:23,604 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:04:23,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:04:23,604 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118677998] [2025-04-29 11:04:23,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118677998] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:04:23,604 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [237152950] [2025-04-29 11:04:23,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:04:23,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:04:23,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:04:23,608 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-04-29 11:04:23,609 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-04-29 11:04:23,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-29 11:04:23,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-29 11:04:23,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:04:23,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:04:23,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-29 11:04:23,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:04:23,714 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:04:23,714 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:04:23,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [237152950] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:04:23,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 11:04:23,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-04-29 11:04:23,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641303109] [2025-04-29 11:04:23,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:04:23,715 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:04:23,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:04:23,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:04:23,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:04:23,726 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2025-04-29 11:04:23,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 50 transitions, 310 flow. Second operand has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 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-04-29 11:04:23,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:04:23,727 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2025-04-29 11:04:23,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:04:23,849 INFO L116 PetriNetUnfolderBase]: 226/726 cut-off events. [2025-04-29 11:04:23,849 INFO L117 PetriNetUnfolderBase]: For 1356/1382 co-relation queries the response was YES. [2025-04-29 11:04:23,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2089 conditions, 726 events. 226/726 cut-off events. For 1356/1382 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 4170 event pairs, 102 based on Foata normal form. 22/738 useless extension candidates. Maximal degree in co-relation 2059. Up to 436 conditions per place. [2025-04-29 11:04:23,853 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 43 selfloop transitions, 6 changer transitions 0/61 dead transitions. [2025-04-29 11:04:23,853 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 61 transitions, 437 flow [2025-04-29 11:04:23,853 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:04:23,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:04:23,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 114 transitions. [2025-04-29 11:04:23,875 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5428571428571428 [2025-04-29 11:04:23,875 INFO L175 Difference]: Start difference. First operand has 69 places, 50 transitions, 310 flow. Second operand 6 states and 114 transitions. [2025-04-29 11:04:23,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 61 transitions, 437 flow [2025-04-29 11:04:23,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 61 transitions, 419 flow, removed 1 selfloop flow, removed 5 redundant places. [2025-04-29 11:04:23,878 INFO L231 Difference]: Finished difference. Result has 66 places, 48 transitions, 282 flow [2025-04-29 11:04:23,878 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=282, PETRI_PLACES=66, PETRI_TRANSITIONS=48} [2025-04-29 11:04:23,879 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 32 predicate places. [2025-04-29 11:04:23,879 INFO L485 AbstractCegarLoop]: Abstraction has has 66 places, 48 transitions, 282 flow [2025-04-29 11:04:23,879 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 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-04-29 11:04:23,879 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:04:23,879 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:04:23,886 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-04-29 11:04:24,084 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-04-29 11:04:24,084 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting thread_function_mutexErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-04-29 11:04:24,085 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:04:24,085 INFO L85 PathProgramCache]: Analyzing trace with hash -788038165, now seen corresponding path program 1 times [2025-04-29 11:04:24,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:04:24,085 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381005021] [2025-04-29 11:04:24,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:04:24,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:04:24,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-29 11:04:24,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-29 11:04:24,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:04:24,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:04:24,146 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:04:24,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:04:24,147 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381005021] [2025-04-29 11:04:24,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381005021] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:04:24,147 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2009081729] [2025-04-29 11:04:24,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:04:24,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:04:24,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:04:24,149 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-04-29 11:04:24,151 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-04-29 11:04:24,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-29 11:04:24,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-29 11:04:24,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:04:24,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:04:24,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-29 11:04:24,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:04:24,230 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:04:24,230 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:04:24,279 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:04:24,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2009081729] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:04:24,280 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:04:24,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-04-29 11:04:24,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902159566] [2025-04-29 11:04:24,280 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:04:24,280 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-29 11:04:24,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:04:24,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-29 11:04:24,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-04-29 11:04:24,305 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2025-04-29 11:04:24,305 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 48 transitions, 282 flow. Second operand has 12 states, 12 states have (on average 15.5) internal successors, (186), 12 states have internal predecessors, (186), 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-04-29 11:04:24,305 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:04:24,305 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2025-04-29 11:04:24,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:04:24,690 INFO L116 PetriNetUnfolderBase]: 535/1731 cut-off events. [2025-04-29 11:04:24,690 INFO L117 PetriNetUnfolderBase]: For 2788/2918 co-relation queries the response was YES. [2025-04-29 11:04:24,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4696 conditions, 1731 events. 535/1731 cut-off events. For 2788/2918 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 12840 event pairs, 86 based on Foata normal form. 66/1784 useless extension candidates. Maximal degree in co-relation 4668. Up to 354 conditions per place. [2025-04-29 11:04:24,701 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 153 selfloop transitions, 28 changer transitions 0/193 dead transitions. [2025-04-29 11:04:24,701 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 193 transitions, 1310 flow [2025-04-29 11:04:24,701 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-29 11:04:24,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-04-29 11:04:24,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 367 transitions. [2025-04-29 11:04:24,702 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6553571428571429 [2025-04-29 11:04:24,702 INFO L175 Difference]: Start difference. First operand has 66 places, 48 transitions, 282 flow. Second operand 16 states and 367 transitions. [2025-04-29 11:04:24,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 193 transitions, 1310 flow [2025-04-29 11:04:24,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 193 transitions, 1295 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-29 11:04:24,711 INFO L231 Difference]: Finished difference. Result has 85 places, 73 transitions, 576 flow [2025-04-29 11:04:24,711 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=576, PETRI_PLACES=85, PETRI_TRANSITIONS=73} [2025-04-29 11:04:24,712 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 51 predicate places. [2025-04-29 11:04:24,712 INFO L485 AbstractCegarLoop]: Abstraction has has 85 places, 73 transitions, 576 flow [2025-04-29 11:04:24,712 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 15.5) internal successors, (186), 12 states have internal predecessors, (186), 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-04-29 11:04:24,712 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:04:24,713 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-04-29 11:04:24,718 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-29 11:04:24,913 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-04-29 11:04:24,914 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting thread_function_mutexErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-04-29 11:04:24,914 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:04:24,915 INFO L85 PathProgramCache]: Analyzing trace with hash -153467421, now seen corresponding path program 1 times [2025-04-29 11:04:24,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:04:24,915 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587966028] [2025-04-29 11:04:24,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:04:24,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:04:24,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-29 11:04:24,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-29 11:04:24,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:04:24,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:04:24,981 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:04:24,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:04:24,981 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587966028] [2025-04-29 11:04:24,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587966028] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:04:24,982 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1479931576] [2025-04-29 11:04:24,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:04:24,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:04:24,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:04:24,984 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-04-29 11:04:24,985 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-04-29 11:04:25,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-29 11:04:25,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-29 11:04:25,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:04:25,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:04:25,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-29 11:04:25,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:04:25,057 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:04:25,058 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:04:25,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1479931576] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:04:25,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 11:04:25,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2025-04-29 11:04:25,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192535567] [2025-04-29 11:04:25,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:04:25,059 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:04:25,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:04:25,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:04:25,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-04-29 11:04:25,067 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 35 [2025-04-29 11:04:25,068 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 73 transitions, 576 flow. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 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-04-29 11:04:25,068 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:04:25,068 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 35 [2025-04-29 11:04:25,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:04:25,228 INFO L116 PetriNetUnfolderBase]: 649/1811 cut-off events. [2025-04-29 11:04:25,228 INFO L117 PetriNetUnfolderBase]: For 3306/3407 co-relation queries the response was YES. [2025-04-29 11:04:25,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5447 conditions, 1811 events. 649/1811 cut-off events. For 3306/3407 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 13269 event pairs, 175 based on Foata normal form. 55/1810 useless extension candidates. Maximal degree in co-relation 5411. Up to 850 conditions per place. [2025-04-29 11:04:25,236 INFO L140 encePairwiseOnDemand]: 31/35 looper letters, 81 selfloop transitions, 5 changer transitions 0/101 dead transitions. [2025-04-29 11:04:25,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 101 transitions, 940 flow [2025-04-29 11:04:25,236 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:04:25,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-29 11:04:25,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2025-04-29 11:04:25,237 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6214285714285714 [2025-04-29 11:04:25,237 INFO L175 Difference]: Start difference. First operand has 85 places, 73 transitions, 576 flow. Second operand 4 states and 87 transitions. [2025-04-29 11:04:25,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 101 transitions, 940 flow [2025-04-29 11:04:25,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 101 transitions, 793 flow, removed 59 selfloop flow, removed 6 redundant places. [2025-04-29 11:04:25,244 INFO L231 Difference]: Finished difference. Result has 81 places, 72 transitions, 478 flow [2025-04-29 11:04:25,244 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=468, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=478, PETRI_PLACES=81, PETRI_TRANSITIONS=72} [2025-04-29 11:04:25,245 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 47 predicate places. [2025-04-29 11:04:25,245 INFO L485 AbstractCegarLoop]: Abstraction has has 81 places, 72 transitions, 478 flow [2025-04-29 11:04:25,245 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 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-04-29 11:04:25,245 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:04:25,245 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-04-29 11:04:25,251 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-04-29 11:04:25,449 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:04:25,449 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-04-29 11:04:25,449 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:04:25,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1377066030, now seen corresponding path program 1 times [2025-04-29 11:04:25,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:04:25,449 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244900678] [2025-04-29 11:04:25,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:04:25,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:04:25,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-29 11:04:25,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-29 11:04:25,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:04:25,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:04:25,487 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:04:25,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:04:25,487 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244900678] [2025-04-29 11:04:25,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244900678] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:04:25,487 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1998850723] [2025-04-29 11:04:25,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:04:25,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:04:25,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:04:25,489 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-04-29 11:04:25,490 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-04-29 11:04:25,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-29 11:04:25,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-29 11:04:25,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:04:25,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:04:25,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-29 11:04:25,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:04:25,549 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:04:25,549 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:04:25,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1998850723] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:04:25,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 11:04:25,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-04-29 11:04:25,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741473237] [2025-04-29 11:04:25,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:04:25,549 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:04:25,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:04:25,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:04:25,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:04:25,557 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 35 [2025-04-29 11:04:25,558 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 72 transitions, 478 flow. Second operand has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 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-04-29 11:04:25,558 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:04:25,558 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 35 [2025-04-29 11:04:25,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:04:25,749 INFO L116 PetriNetUnfolderBase]: 675/1975 cut-off events. [2025-04-29 11:04:25,749 INFO L117 PetriNetUnfolderBase]: For 3556/3596 co-relation queries the response was YES. [2025-04-29 11:04:25,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5833 conditions, 1975 events. 675/1975 cut-off events. For 3556/3596 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 14713 event pairs, 145 based on Foata normal form. 75/1966 useless extension candidates. Maximal degree in co-relation 5799. Up to 798 conditions per place. [2025-04-29 11:04:25,760 INFO L140 encePairwiseOnDemand]: 31/35 looper letters, 138 selfloop transitions, 5 changer transitions 0/157 dead transitions. [2025-04-29 11:04:25,760 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 157 transitions, 1317 flow [2025-04-29 11:04:25,760 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:04:25,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:04:25,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 140 transitions. [2025-04-29 11:04:25,761 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-04-29 11:04:25,761 INFO L175 Difference]: Start difference. First operand has 81 places, 72 transitions, 478 flow. Second operand 6 states and 140 transitions. [2025-04-29 11:04:25,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 157 transitions, 1317 flow [2025-04-29 11:04:25,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 157 transitions, 1267 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-29 11:04:25,768 INFO L231 Difference]: Finished difference. Result has 82 places, 71 transitions, 474 flow [2025-04-29 11:04:25,768 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=464, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=474, PETRI_PLACES=82, PETRI_TRANSITIONS=71} [2025-04-29 11:04:25,769 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 48 predicate places. [2025-04-29 11:04:25,769 INFO L485 AbstractCegarLoop]: Abstraction has has 82 places, 71 transitions, 474 flow [2025-04-29 11:04:25,769 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 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-04-29 11:04:25,769 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:04:25,769 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-04-29 11:04:25,776 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-29 11:04:25,969 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:04:25,970 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-04-29 11:04:25,970 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:04:25,970 INFO L85 PathProgramCache]: Analyzing trace with hash 260626259, now seen corresponding path program 1 times [2025-04-29 11:04:25,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:04:25,970 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904891378] [2025-04-29 11:04:25,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:04:25,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:04:25,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-29 11:04:25,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-29 11:04:25,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:04:25,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:04:25,992 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:04:25,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:04:25,992 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904891378] [2025-04-29 11:04:25,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904891378] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:04:25,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:04:25,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:04:25,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474261179] [2025-04-29 11:04:25,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:04:25,993 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:04:25,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:04:25,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:04:25,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:04:25,998 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2025-04-29 11:04:25,998 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 71 transitions, 474 flow. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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-04-29 11:04:25,998 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:04:25,998 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2025-04-29 11:04:25,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:04:26,176 INFO L116 PetriNetUnfolderBase]: 739/2091 cut-off events. [2025-04-29 11:04:26,176 INFO L117 PetriNetUnfolderBase]: For 3717/3727 co-relation queries the response was YES. [2025-04-29 11:04:26,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6144 conditions, 2091 events. 739/2091 cut-off events. For 3717/3727 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 15123 event pairs, 177 based on Foata normal form. 75/2159 useless extension candidates. Maximal degree in co-relation 6110. Up to 824 conditions per place. [2025-04-29 11:04:26,187 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 112 selfloop transitions, 6 changer transitions 0/131 dead transitions. [2025-04-29 11:04:26,187 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 131 transitions, 1119 flow [2025-04-29 11:04:26,188 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:04:26,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-29 11:04:26,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 88 transitions. [2025-04-29 11:04:26,188 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6285714285714286 [2025-04-29 11:04:26,188 INFO L175 Difference]: Start difference. First operand has 82 places, 71 transitions, 474 flow. Second operand 4 states and 88 transitions. [2025-04-29 11:04:26,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 131 transitions, 1119 flow [2025-04-29 11:04:26,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 131 transitions, 1110 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-04-29 11:04:26,196 INFO L231 Difference]: Finished difference. Result has 81 places, 71 transitions, 481 flow [2025-04-29 11:04:26,197 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=461, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=481, PETRI_PLACES=81, PETRI_TRANSITIONS=71} [2025-04-29 11:04:26,197 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 47 predicate places. [2025-04-29 11:04:26,197 INFO L485 AbstractCegarLoop]: Abstraction has has 81 places, 71 transitions, 481 flow [2025-04-29 11:04:26,197 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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-04-29 11:04:26,197 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:04:26,197 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-04-29 11:04:26,197 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-29 11:04:26,197 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting thread_function_mutexErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-04-29 11:04:26,198 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:04:26,198 INFO L85 PathProgramCache]: Analyzing trace with hash -462522482, now seen corresponding path program 1 times [2025-04-29 11:04:26,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:04:26,198 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181144228] [2025-04-29 11:04:26,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:04:26,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:04:26,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-29 11:04:26,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-29 11:04:26,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:04:26,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:04:26,223 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:04:26,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:04:26,223 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181144228] [2025-04-29 11:04:26,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181144228] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:04:26,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:04:26,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:04:26,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376546910] [2025-04-29 11:04:26,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:04:26,223 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:04:26,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:04:26,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:04:26,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:04:26,228 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 35 [2025-04-29 11:04:26,228 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 71 transitions, 481 flow. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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-04-29 11:04:26,228 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:04:26,228 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 35 [2025-04-29 11:04:26,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:04:26,381 INFO L116 PetriNetUnfolderBase]: 605/1741 cut-off events. [2025-04-29 11:04:26,381 INFO L117 PetriNetUnfolderBase]: For 3551/3574 co-relation queries the response was YES. [2025-04-29 11:04:26,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5390 conditions, 1741 events. 605/1741 cut-off events. For 3551/3574 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 12286 event pairs, 139 based on Foata normal form. 0/1737 useless extension candidates. Maximal degree in co-relation 5357. Up to 706 conditions per place. [2025-04-29 11:04:26,392 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 89 selfloop transitions, 6 changer transitions 0/109 dead transitions. [2025-04-29 11:04:26,392 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 109 transitions, 904 flow [2025-04-29 11:04:26,393 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:04:26,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-29 11:04:26,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2025-04-29 11:04:26,393 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6214285714285714 [2025-04-29 11:04:26,393 INFO L175 Difference]: Start difference. First operand has 81 places, 71 transitions, 481 flow. Second operand 4 states and 87 transitions. [2025-04-29 11:04:26,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 109 transitions, 904 flow [2025-04-29 11:04:26,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 109 transitions, 882 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:04:26,400 INFO L231 Difference]: Finished difference. Result has 82 places, 71 transitions, 489 flow [2025-04-29 11:04:26,400 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=469, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=489, PETRI_PLACES=82, PETRI_TRANSITIONS=71} [2025-04-29 11:04:26,400 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 48 predicate places. [2025-04-29 11:04:26,400 INFO L485 AbstractCegarLoop]: Abstraction has has 82 places, 71 transitions, 489 flow [2025-04-29 11:04:26,400 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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-04-29 11:04:26,400 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:04:26,400 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:04:26,400 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-29 11:04:26,400 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-04-29 11:04:26,401 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:04:26,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1212416874, now seen corresponding path program 1 times [2025-04-29 11:04:26,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:04:26,401 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027442816] [2025-04-29 11:04:26,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:04:26,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:04:26,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-29 11:04:26,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-29 11:04:26,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:04:26,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:04:26,574 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:04:26,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:04:26,575 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027442816] [2025-04-29 11:04:26,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027442816] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:04:26,575 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1677776112] [2025-04-29 11:04:26,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:04:26,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:04:26,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:04:26,577 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-04-29 11:04:26,579 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-04-29 11:04:26,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-29 11:04:26,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-29 11:04:26,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:04:26,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:04:26,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-29 11:04:26,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:04:26,703 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:04:26,703 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:04:26,824 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:04:26,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1677776112] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:04:26,824 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:04:26,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2025-04-29 11:04:26,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290097698] [2025-04-29 11:04:26,824 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:04:26,825 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-29 11:04:26,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:04:26,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-29 11:04:26,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=330, Unknown=0, NotChecked=0, Total=462 [2025-04-29 11:04:26,876 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2025-04-29 11:04:26,876 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 71 transitions, 489 flow. Second operand has 22 states, 22 states have (on average 15.818181818181818) internal successors, (348), 22 states have internal predecessors, (348), 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-04-29 11:04:26,876 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:04:26,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2025-04-29 11:04:26,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:04:28,653 INFO L116 PetriNetUnfolderBase]: 2602/7916 cut-off events. [2025-04-29 11:04:28,653 INFO L117 PetriNetUnfolderBase]: For 28624/28624 co-relation queries the response was YES. [2025-04-29 11:04:28,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24523 conditions, 7916 events. 2602/7916 cut-off events. For 28624/28624 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 66063 event pairs, 266 based on Foata normal form. 392/8282 useless extension candidates. Maximal degree in co-relation 24489. Up to 1128 conditions per place. [2025-04-29 11:04:28,688 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 597 selfloop transitions, 116 changer transitions 0/723 dead transitions. [2025-04-29 11:04:28,689 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 723 transitions, 5660 flow [2025-04-29 11:04:28,689 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2025-04-29 11:04:28,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2025-04-29 11:04:28,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 1398 transitions. [2025-04-29 11:04:28,692 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.676997578692494 [2025-04-29 11:04:28,692 INFO L175 Difference]: Start difference. First operand has 82 places, 71 transitions, 489 flow. Second operand 59 states and 1398 transitions. [2025-04-29 11:04:28,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 723 transitions, 5660 flow [2025-04-29 11:04:28,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 723 transitions, 5390 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:04:28,720 INFO L231 Difference]: Finished difference. Result has 177 places, 170 transitions, 1787 flow [2025-04-29 11:04:28,720 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=481, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=59, PETRI_FLOW=1787, PETRI_PLACES=177, PETRI_TRANSITIONS=170} [2025-04-29 11:04:28,720 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 143 predicate places. [2025-04-29 11:04:28,720 INFO L485 AbstractCegarLoop]: Abstraction has has 177 places, 170 transitions, 1787 flow [2025-04-29 11:04:28,721 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 15.818181818181818) internal successors, (348), 22 states have internal predecessors, (348), 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-04-29 11:04:28,721 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:04:28,721 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:04:28,727 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-04-29 11:04:28,925 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-04-29 11:04:28,925 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting thread_function_mutexErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-04-29 11:04:28,925 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:04:28,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1683570294, now seen corresponding path program 1 times [2025-04-29 11:04:28,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:04:28,926 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927577849] [2025-04-29 11:04:28,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:04:28,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:04:28,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-04-29 11:04:28,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-04-29 11:04:28,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:04:28,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:04:29,128 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 157 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:04:29,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:04:29,128 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927577849] [2025-04-29 11:04:29,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927577849] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:04:29,129 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [679040917] [2025-04-29 11:04:29,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:04:29,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:04:29,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:04:29,132 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-04-29 11:04:29,133 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-04-29 11:04:29,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-04-29 11:04:29,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-04-29 11:04:29,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:04:29,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:04:29,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-29 11:04:29,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:04:29,285 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 157 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:04:29,285 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:04:29,488 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 157 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:04:29,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [679040917] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:04:29,488 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:04:29,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 23 [2025-04-29 11:04:29,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839192873] [2025-04-29 11:04:29,489 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:04:29,489 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-29 11:04:29,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:04:29,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-29 11:04:29,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=376, Unknown=0, NotChecked=0, Total=600 [2025-04-29 11:04:29,519 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2025-04-29 11:04:29,520 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 170 transitions, 1787 flow. Second operand has 25 states, 25 states have (on average 16.92) internal successors, (423), 25 states have internal predecessors, (423), 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-04-29 11:04:29,520 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:04:29,520 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2025-04-29 11:04:29,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:04:33,190 INFO L116 PetriNetUnfolderBase]: 6673/21008 cut-off events. [2025-04-29 11:04:33,190 INFO L117 PetriNetUnfolderBase]: For 404842/404842 co-relation queries the response was YES. [2025-04-29 11:04:33,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69764 conditions, 21008 events. 6673/21008 cut-off events. For 404842/404842 co-relation queries the response was YES. Maximal size of possible extension queue 341. Compared 201699 event pairs, 1339 based on Foata normal form. 553/21514 useless extension candidates. Maximal degree in co-relation 69689. Up to 3010 conditions per place. [2025-04-29 11:04:33,343 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 574 selfloop transitions, 382 changer transitions 0/966 dead transitions. [2025-04-29 11:04:33,344 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 966 transitions, 9859 flow [2025-04-29 11:04:33,344 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2025-04-29 11:04:33,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2025-04-29 11:04:33,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 1225 transitions. [2025-04-29 11:04:33,349 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6481481481481481 [2025-04-29 11:04:33,349 INFO L175 Difference]: Start difference. First operand has 177 places, 170 transitions, 1787 flow. Second operand 54 states and 1225 transitions. [2025-04-29 11:04:33,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 966 transitions, 9859 flow [2025-04-29 11:04:33,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 966 transitions, 8003 flow, removed 831 selfloop flow, removed 15 redundant places. [2025-04-29 11:04:33,791 INFO L231 Difference]: Finished difference. Result has 248 places, 504 transitions, 5184 flow [2025-04-29 11:04:33,792 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1275, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=106, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=54, PETRI_FLOW=5184, PETRI_PLACES=248, PETRI_TRANSITIONS=504} [2025-04-29 11:04:33,792 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 214 predicate places. [2025-04-29 11:04:33,792 INFO L485 AbstractCegarLoop]: Abstraction has has 248 places, 504 transitions, 5184 flow [2025-04-29 11:04:33,792 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 16.92) internal successors, (423), 25 states have internal predecessors, (423), 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-04-29 11:04:33,792 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:04:33,792 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1] [2025-04-29 11:04:33,803 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-29 11:04:33,993 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-04-29 11:04:33,994 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting thread_function_mutexErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-04-29 11:04:33,994 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:04:33,994 INFO L85 PathProgramCache]: Analyzing trace with hash 401083233, now seen corresponding path program 2 times [2025-04-29 11:04:33,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:04:33,994 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715869280] [2025-04-29 11:04:33,995 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:04:33,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:04:34,017 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 78 statements into 2 equivalence classes. [2025-04-29 11:04:34,034 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 78 of 78 statements. [2025-04-29 11:04:34,038 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:04:34,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:04:34,461 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:04:34,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:04:34,462 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715869280] [2025-04-29 11:04:34,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715869280] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:04:34,462 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1349358355] [2025-04-29 11:04:34,462 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:04:34,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:04:34,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:04:34,465 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-04-29 11:04:34,482 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-04-29 11:04:34,536 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 78 statements into 2 equivalence classes. [2025-04-29 11:04:34,564 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 78 of 78 statements. [2025-04-29 11:04:34,564 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:04:34,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:04:34,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-29 11:04:34,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:04:34,663 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:04:34,664 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:04:34,928 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:04:34,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1349358355] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:04:34,929 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:04:34,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 29 [2025-04-29 11:04:34,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299223760] [2025-04-29 11:04:34,929 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:04:34,929 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-04-29 11:04:34,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:04:34,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-29 11:04:34,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=275, Invalid=655, Unknown=0, NotChecked=0, Total=930 [2025-04-29 11:04:34,985 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2025-04-29 11:04:34,985 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 504 transitions, 5184 flow. Second operand has 31 states, 31 states have (on average 16.35483870967742) internal successors, (507), 31 states have internal predecessors, (507), 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-04-29 11:04:34,985 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:04:34,985 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2025-04-29 11:04:34,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:04:47,348 INFO L116 PetriNetUnfolderBase]: 15575/48700 cut-off events. [2025-04-29 11:04:47,348 INFO L117 PetriNetUnfolderBase]: For 2084067/2084067 co-relation queries the response was YES. [2025-04-29 11:04:47,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 162024 conditions, 48700 events. 15575/48700 cut-off events. For 2084067/2084067 co-relation queries the response was YES. Maximal size of possible extension queue 583. Compared 539620 event pairs, 1660 based on Foata normal form. 1245/49851 useless extension candidates. Maximal degree in co-relation 161916. Up to 7265 conditions per place. [2025-04-29 11:04:48,064 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 1155 selfloop transitions, 1084 changer transitions 0/2249 dead transitions. [2025-04-29 11:04:48,064 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 359 places, 2249 transitions, 23124 flow [2025-04-29 11:04:48,064 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2025-04-29 11:04:48,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2025-04-29 11:04:48,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 2618 transitions. [2025-04-29 11:04:48,068 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6678571428571428 [2025-04-29 11:04:48,068 INFO L175 Difference]: Start difference. First operand has 248 places, 504 transitions, 5184 flow. Second operand 112 states and 2618 transitions. [2025-04-29 11:04:48,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 359 places, 2249 transitions, 23124 flow [2025-04-29 11:04:50,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 348 places, 2249 transitions, 22459 flow, removed 317 selfloop flow, removed 11 redundant places. [2025-04-29 11:04:50,253 INFO L231 Difference]: Finished difference. Result has 403 places, 1189 transitions, 15399 flow [2025-04-29 11:04:50,253 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=4749, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=504, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=450, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=112, PETRI_FLOW=15399, PETRI_PLACES=403, PETRI_TRANSITIONS=1189} [2025-04-29 11:04:50,253 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 369 predicate places. [2025-04-29 11:04:50,253 INFO L485 AbstractCegarLoop]: Abstraction has has 403 places, 1189 transitions, 15399 flow [2025-04-29 11:04:50,254 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 16.35483870967742) internal successors, (507), 31 states have internal predecessors, (507), 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-04-29 11:04:50,254 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:04:50,254 INFO L206 CegarLoopForPetriNet]: trace histogram [8, 8, 8, 8, 8, 8, 7, 7, 7, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-04-29 11:04:50,260 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-29 11:04:50,454 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:04:50,454 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-04-29 11:04:50,455 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:04:50,455 INFO L85 PathProgramCache]: Analyzing trace with hash -10690756, now seen corresponding path program 1 times [2025-04-29 11:04:50,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:04:50,455 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198340563] [2025-04-29 11:04:50,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:04:50,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:04:50,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-04-29 11:04:50,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-04-29 11:04:50,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:04:50,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:04:50,882 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:04:50,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:04:50,882 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198340563] [2025-04-29 11:04:50,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198340563] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:04:50,882 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1651773545] [2025-04-29 11:04:50,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:04:50,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:04:50,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:04:50,884 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-04-29 11:04:50,886 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-04-29 11:04:50,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-04-29 11:04:50,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-04-29 11:04:50,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:04:50,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:04:50,959 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-29 11:04:50,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:04:51,059 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:04:51,059 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:04:51,389 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:04:51,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1651773545] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:04:51,389 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:04:51,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 40 [2025-04-29 11:04:51,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261319868] [2025-04-29 11:04:51,390 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:04:51,390 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-04-29 11:04:51,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:04:51,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-04-29 11:04:51,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=470, Invalid=1252, Unknown=0, NotChecked=0, Total=1722 [2025-04-29 11:04:51,447 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2025-04-29 11:04:51,448 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 403 places, 1189 transitions, 15399 flow. Second operand has 42 states, 42 states have (on average 16.11904761904762) internal successors, (677), 42 states have internal predecessors, (677), 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-04-29 11:04:51,448 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:04:51,448 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2025-04-29 11:04:51,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand