./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/weaver/popl20-bad-commit-1.wvr-bad.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-bad-commit-1.wvr-bad.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 83c7202603a0719c5812e4d7043f4665de4d954c89c656bd6312ac9e8fdcb494 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 06:40:54,193 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 06:40:54,246 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-09 06:40:54,258 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 06:40:54,258 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 06:40:54,278 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 06:40:54,279 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 06:40:54,280 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 06:40:54,280 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 06:40:54,280 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 06:40:54,281 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 06:40:54,281 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 06:40:54,281 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 06:40:54,281 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 06:40:54,281 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 06:40:54,282 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 06:40:54,282 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 06:40:54,282 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 06:40:54,282 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 06:40:54,282 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 06:40:54,282 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 06:40:54,282 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 06:40:54,282 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 06:40:54,282 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 06:40:54,282 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 06:40:54,282 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 06:40:54,282 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 06:40:54,282 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 06:40:54,282 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 06:40:54,283 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 06:40:54,283 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 06:40:54,283 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 06:40:54,283 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 06:40:54,283 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 06:40:54,283 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 06:40:54,283 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 06:40:54,283 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 06:40:54,283 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 06:40:54,283 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 06:40:54,283 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 06:40:54,283 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 06:40:54,283 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 06:40:54,283 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 06:40:54,283 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 06:40:54,283 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 06:40:54,283 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 -> 83c7202603a0719c5812e4d7043f4665de4d954c89c656bd6312ac9e8fdcb494 [2025-03-09 06:40:54,513 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 06:40:54,521 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 06:40:54,523 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 06:40:54,524 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 06:40:54,524 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 06:40:54,527 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-bad-commit-1.wvr-bad.c [2025-03-09 06:40:55,660 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/304f0fe3f/6a9f81d122a94823a8e83f7c42f7b22c/FLAG693885588 [2025-03-09 06:40:55,874 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 06:40:55,875 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-commit-1.wvr-bad.c [2025-03-09 06:40:55,880 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/304f0fe3f/6a9f81d122a94823a8e83f7c42f7b22c/FLAG693885588 [2025-03-09 06:40:55,894 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/304f0fe3f/6a9f81d122a94823a8e83f7c42f7b22c [2025-03-09 06:40:55,896 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 06:40:55,897 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 06:40:55,899 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 06:40:55,899 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 06:40:55,903 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 06:40:55,903 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:40:55" (1/1) ... [2025-03-09 06:40:55,904 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4804099c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:40:55, skipping insertion in model container [2025-03-09 06:40:55,904 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:40:55" (1/1) ... [2025-03-09 06:40:55,917 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 06:40:56,067 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:40:56,078 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 06:40:56,110 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:40:56,125 INFO L204 MainTranslator]: Completed translation [2025-03-09 06:40:56,126 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:40:56 WrapperNode [2025-03-09 06:40:56,126 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 06:40:56,128 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 06:40:56,128 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 06:40:56,128 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 06:40:56,132 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:40:56" (1/1) ... [2025-03-09 06:40:56,143 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:40:56" (1/1) ... [2025-03-09 06:40:56,171 INFO L138 Inliner]: procedures = 24, calls = 54, calls flagged for inlining = 21, calls inlined = 25, statements flattened = 349 [2025-03-09 06:40:56,172 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 06:40:56,172 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 06:40:56,172 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 06:40:56,173 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 06:40:56,179 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:40:56" (1/1) ... [2025-03-09 06:40:56,180 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:40:56" (1/1) ... [2025-03-09 06:40:56,182 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:40:56" (1/1) ... [2025-03-09 06:40:56,197 INFO L175 MemorySlicer]: Split 13 memory accesses to 2 slices as follows [2, 11]. 85 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2025-03-09 06:40:56,199 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:40:56" (1/1) ... [2025-03-09 06:40:56,199 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:40:56" (1/1) ... [2025-03-09 06:40:56,206 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:40:56" (1/1) ... [2025-03-09 06:40:56,207 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:40:56" (1/1) ... [2025-03-09 06:40:56,208 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:40:56" (1/1) ... [2025-03-09 06:40:56,209 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:40:56" (1/1) ... [2025-03-09 06:40:56,210 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 06:40:56,211 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 06:40:56,211 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 06:40:56,211 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 06:40:56,212 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:40:56" (1/1) ... [2025-03-09 06:40:56,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 06:40:56,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:40:56,238 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 06:40:56,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 06:40:56,259 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 06:40:56,259 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-09 06:40:56,259 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-09 06:40:56,259 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-09 06:40:56,259 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-09 06:40:56,259 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-09 06:40:56,259 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-09 06:40:56,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 06:40:56,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 06:40:56,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 06:40:56,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 06:40:56,259 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-09 06:40:56,259 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-09 06:40:56,259 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 06:40:56,259 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 06:40:56,259 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 06:40:56,259 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 06:40:56,259 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 06:40:56,260 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-09 06:40:56,360 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 06:40:56,362 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 06:40:56,793 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 06:40:56,794 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 06:40:57,101 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 06:40:57,101 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 06:40:57,101 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:40:57 BoogieIcfgContainer [2025-03-09 06:40:57,102 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 06:40:57,105 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 06:40:57,105 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 06:40:57,108 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 06:40:57,108 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 06:40:55" (1/3) ... [2025-03-09 06:40:57,109 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10a369e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 06:40:57, skipping insertion in model container [2025-03-09 06:40:57,109 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:40:56" (2/3) ... [2025-03-09 06:40:57,110 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10a369e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 06:40:57, skipping insertion in model container [2025-03-09 06:40:57,110 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:40:57" (3/3) ... [2025-03-09 06:40:57,111 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-bad-commit-1.wvr-bad.c [2025-03-09 06:40:57,123 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 06:40:57,124 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-bad-commit-1.wvr-bad.c that has 4 procedures, 71 locations, 1 initial locations, 6 loop locations, and 22 error locations. [2025-03-09 06:40:57,125 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 06:40:57,188 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-09 06:40:57,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 80 places, 87 transitions, 195 flow [2025-03-09 06:40:57,280 INFO L124 PetriNetUnfolderBase]: 17/84 cut-off events. [2025-03-09 06:40:57,283 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-09 06:40:57,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 84 events. 17/84 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 253 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 67. Up to 6 conditions per place. [2025-03-09 06:40:57,289 INFO L82 GeneralOperation]: Start removeDead. Operand has 80 places, 87 transitions, 195 flow [2025-03-09 06:40:57,294 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 75 places, 82 transitions, 179 flow [2025-03-09 06:40:57,305 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 06:40:57,316 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4123efe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 06:40:57,317 INFO L334 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2025-03-09 06:40:57,321 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 06:40:57,321 INFO L124 PetriNetUnfolderBase]: 1/5 cut-off events. [2025-03-09 06:40:57,321 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 06:40:57,321 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:40:57,322 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 06:40:57,322 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-03-09 06:40:57,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:40:57,329 INFO L85 PathProgramCache]: Analyzing trace with hash 950510, now seen corresponding path program 1 times [2025-03-09 06:40:57,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:40:57,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624721435] [2025-03-09 06:40:57,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:40:57,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:40:57,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:40:57,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:40:57,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:40:57,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:40:57,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:40:57,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:40:57,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624721435] [2025-03-09 06:40:57,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624721435] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:40:57,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:40:57,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:40:57,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274738852] [2025-03-09 06:40:57,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:40:57,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:40:57,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:40:57,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:40:57,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:40:57,599 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 87 [2025-03-09 06:40:57,601 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 82 transitions, 179 flow. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:40:57,601 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:40:57,602 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 87 [2025-03-09 06:40:57,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:40:58,187 INFO L124 PetriNetUnfolderBase]: 3369/4949 cut-off events. [2025-03-09 06:40:58,187 INFO L125 PetriNetUnfolderBase]: For 191/191 co-relation queries the response was YES. [2025-03-09 06:40:58,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9471 conditions, 4949 events. 3369/4949 cut-off events. For 191/191 co-relation queries the response was YES. Maximal size of possible extension queue 390. Compared 27895 event pairs, 2182 based on Foata normal form. 3/3109 useless extension candidates. Maximal degree in co-relation 8998. Up to 4308 conditions per place. [2025-03-09 06:40:58,221 INFO L140 encePairwiseOnDemand]: 60/87 looper letters, 51 selfloop transitions, 10 changer transitions 0/80 dead transitions. [2025-03-09 06:40:58,221 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 80 transitions, 297 flow [2025-03-09 06:40:58,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:40:58,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:40:58,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 166 transitions. [2025-03-09 06:40:58,230 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47701149425287354 [2025-03-09 06:40:58,231 INFO L175 Difference]: Start difference. First operand has 75 places, 82 transitions, 179 flow. Second operand 4 states and 166 transitions. [2025-03-09 06:40:58,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 80 transitions, 297 flow [2025-03-09 06:40:58,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 80 transitions, 288 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-09 06:40:58,244 INFO L231 Difference]: Finished difference. Result has 68 places, 80 transitions, 236 flow [2025-03-09 06:40:58,246 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=236, PETRI_PLACES=68, PETRI_TRANSITIONS=80} [2025-03-09 06:40:58,249 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, -7 predicate places. [2025-03-09 06:40:58,249 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 80 transitions, 236 flow [2025-03-09 06:40:58,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:40:58,250 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:40:58,250 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-03-09 06:40:58,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 06:40:58,251 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-03-09 06:40:58,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:40:58,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1747263642, now seen corresponding path program 1 times [2025-03-09 06:40:58,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:40:58,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295056863] [2025-03-09 06:40:58,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:40:58,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:40:58,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:40:58,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:40:58,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:40:58,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:40:58,415 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:40:58,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:40:58,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295056863] [2025-03-09 06:40:58,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295056863] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:40:58,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [728255528] [2025-03-09 06:40:58,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:40:58,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:40:58,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:40:58,418 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:40:58,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 06:40:58,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:40:58,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:40:58,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:40:58,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:40:58,489 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 06:40:58,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:40:58,524 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:40:58,525 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 06:40:58,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [728255528] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:40:58,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 06:40:58,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-09 06:40:58,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095910772] [2025-03-09 06:40:58,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:40:58,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 06:40:58,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:40:58,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 06:40:58,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-09 06:40:58,547 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 87 [2025-03-09 06:40:58,548 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 80 transitions, 236 flow. Second operand has 6 states, 6 states have (on average 22.833333333333332) internal successors, (137), 6 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:40:58,549 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:40:58,549 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 87 [2025-03-09 06:40:58,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:40:59,035 INFO L124 PetriNetUnfolderBase]: 3369/4946 cut-off events. [2025-03-09 06:40:59,036 INFO L125 PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES. [2025-03-09 06:40:59,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9431 conditions, 4946 events. 3369/4946 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 390. Compared 27821 event pairs, 2182 based on Foata normal form. 3/3111 useless extension candidates. Maximal degree in co-relation 9358. Up to 4293 conditions per place. [2025-03-09 06:40:59,069 INFO L140 encePairwiseOnDemand]: 74/87 looper letters, 41 selfloop transitions, 17 changer transitions 0/77 dead transitions. [2025-03-09 06:40:59,070 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 77 transitions, 340 flow [2025-03-09 06:40:59,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 06:40:59,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 06:40:59,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 193 transitions. [2025-03-09 06:40:59,071 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.36973180076628354 [2025-03-09 06:40:59,071 INFO L175 Difference]: Start difference. First operand has 68 places, 80 transitions, 236 flow. Second operand 6 states and 193 transitions. [2025-03-09 06:40:59,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 77 transitions, 340 flow [2025-03-09 06:40:59,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 77 transitions, 340 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-09 06:40:59,075 INFO L231 Difference]: Finished difference. Result has 70 places, 77 transitions, 258 flow [2025-03-09 06:40:59,076 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=258, PETRI_PLACES=70, PETRI_TRANSITIONS=77} [2025-03-09 06:40:59,076 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, -5 predicate places. [2025-03-09 06:40:59,076 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 77 transitions, 258 flow [2025-03-09 06:40:59,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.833333333333332) internal successors, (137), 6 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:40:59,077 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:40:59,077 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2025-03-09 06:40:59,084 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-09 06:40:59,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:40:59,281 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-03-09 06:40:59,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:40:59,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1669402813, now seen corresponding path program 1 times [2025-03-09 06:40:59,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:40:59,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952725861] [2025-03-09 06:40:59,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:40:59,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:40:59,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 06:40:59,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 06:40:59,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:40:59,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:40:59,385 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:40:59,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:40:59,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952725861] [2025-03-09 06:40:59,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952725861] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:40:59,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1323587890] [2025-03-09 06:40:59,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:40:59,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:40:59,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:40:59,388 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:40:59,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 06:40:59,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 06:40:59,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 06:40:59,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:40:59,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:40:59,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 06:40:59,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:40:59,478 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:40:59,479 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:40:59,514 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:40:59,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1323587890] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:40:59,515 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:40:59,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-03-09 06:40:59,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569431784] [2025-03-09 06:40:59,515 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:40:59,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-09 06:40:59,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:40:59,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-09 06:40:59,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-09 06:40:59,565 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 87 [2025-03-09 06:40:59,566 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 77 transitions, 258 flow. Second operand has 12 states, 12 states have (on average 23.083333333333332) internal successors, (277), 12 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:40:59,566 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:40:59,566 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 87 [2025-03-09 06:40:59,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:41:00,022 INFO L124 PetriNetUnfolderBase]: 3378/4982 cut-off events. [2025-03-09 06:41:00,023 INFO L125 PetriNetUnfolderBase]: For 116/116 co-relation queries the response was YES. [2025-03-09 06:41:00,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9572 conditions, 4982 events. 3378/4982 cut-off events. For 116/116 co-relation queries the response was YES. Maximal size of possible extension queue 391. Compared 28229 event pairs, 2182 based on Foata normal form. 9/3153 useless extension candidates. Maximal degree in co-relation 9360. Up to 4308 conditions per place. [2025-03-09 06:41:00,052 INFO L140 encePairwiseOnDemand]: 74/87 looper letters, 48 selfloop transitions, 37 changer transitions 0/104 dead transitions. [2025-03-09 06:41:00,052 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 104 transitions, 602 flow [2025-03-09 06:41:00,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 06:41:00,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-09 06:41:00,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 314 transitions. [2025-03-09 06:41:00,054 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.36091954022988504 [2025-03-09 06:41:00,054 INFO L175 Difference]: Start difference. First operand has 70 places, 77 transitions, 258 flow. Second operand 10 states and 314 transitions. [2025-03-09 06:41:00,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 104 transitions, 602 flow [2025-03-09 06:41:00,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 104 transitions, 519 flow, removed 16 selfloop flow, removed 5 redundant places. [2025-03-09 06:41:00,057 INFO L231 Difference]: Finished difference. Result has 77 places, 104 transitions, 473 flow [2025-03-09 06:41:00,057 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=473, PETRI_PLACES=77, PETRI_TRANSITIONS=104} [2025-03-09 06:41:00,058 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 2 predicate places. [2025-03-09 06:41:00,058 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 104 transitions, 473 flow [2025-03-09 06:41:00,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 23.083333333333332) internal successors, (277), 12 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:41:00,058 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:41:00,058 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:41:00,065 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-03-09 06:41:00,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-09 06:41:00,263 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-03-09 06:41:00,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:41:00,264 INFO L85 PathProgramCache]: Analyzing trace with hash -439046064, now seen corresponding path program 1 times [2025-03-09 06:41:00,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:41:00,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602921728] [2025-03-09 06:41:00,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:41:00,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:41:00,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 06:41:00,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 06:41:00,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:41:00,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:41:00,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-03-09 06:41:00,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:41:00,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602921728] [2025-03-09 06:41:00,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602921728] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:41:00,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:41:00,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 06:41:00,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654275839] [2025-03-09 06:41:00,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:41:00,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 06:41:00,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:41:00,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:41:00,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:41:00,356 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 87 [2025-03-09 06:41:00,356 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 104 transitions, 473 flow. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:41:00,356 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:41:00,356 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 87 [2025-03-09 06:41:00,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:41:00,875 INFO L124 PetriNetUnfolderBase]: 5837/8619 cut-off events. [2025-03-09 06:41:00,876 INFO L125 PetriNetUnfolderBase]: For 208/208 co-relation queries the response was YES. [2025-03-09 06:41:00,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16505 conditions, 8619 events. 5837/8619 cut-off events. For 208/208 co-relation queries the response was YES. Maximal size of possible extension queue 549. Compared 51776 event pairs, 1884 based on Foata normal form. 220/5787 useless extension candidates. Maximal degree in co-relation 16407. Up to 4473 conditions per place. [2025-03-09 06:41:00,914 INFO L140 encePairwiseOnDemand]: 80/87 looper letters, 108 selfloop transitions, 3 changer transitions 0/133 dead transitions. [2025-03-09 06:41:00,914 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 133 transitions, 757 flow [2025-03-09 06:41:00,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:41:00,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 06:41:00,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 163 transitions. [2025-03-09 06:41:00,915 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6245210727969349 [2025-03-09 06:41:00,915 INFO L175 Difference]: Start difference. First operand has 77 places, 104 transitions, 473 flow. Second operand 3 states and 163 transitions. [2025-03-09 06:41:00,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 133 transitions, 757 flow [2025-03-09 06:41:00,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 133 transitions, 720 flow, removed 9 selfloop flow, removed 2 redundant places. [2025-03-09 06:41:00,920 INFO L231 Difference]: Finished difference. Result has 78 places, 106 transitions, 461 flow [2025-03-09 06:41:00,920 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=436, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=461, PETRI_PLACES=78, PETRI_TRANSITIONS=106} [2025-03-09 06:41:00,921 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 3 predicate places. [2025-03-09 06:41:00,922 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 106 transitions, 461 flow [2025-03-09 06:41:00,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:41:00,923 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:41:00,923 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:41:00,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 06:41:00,924 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-03-09 06:41:00,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:41:00,925 INFO L85 PathProgramCache]: Analyzing trace with hash -725524110, now seen corresponding path program 1 times [2025-03-09 06:41:00,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:41:00,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366735802] [2025-03-09 06:41:00,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:41:00,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:41:00,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 06:41:00,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 06:41:00,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:41:00,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:41:00,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:41:00,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:41:00,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366735802] [2025-03-09 06:41:00,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366735802] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:41:00,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:41:00,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:41:00,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142689272] [2025-03-09 06:41:00,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:41:00,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 06:41:00,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:41:00,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:41:00,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:41:00,986 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 87 [2025-03-09 06:41:00,986 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 106 transitions, 461 flow. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:41:00,986 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:41:00,986 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 87 [2025-03-09 06:41:00,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:41:01,779 INFO L124 PetriNetUnfolderBase]: 8495/12342 cut-off events. [2025-03-09 06:41:01,780 INFO L125 PetriNetUnfolderBase]: For 953/965 co-relation queries the response was YES. [2025-03-09 06:41:01,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25452 conditions, 12342 events. 8495/12342 cut-off events. For 953/965 co-relation queries the response was YES. Maximal size of possible extension queue 423. Compared 70391 event pairs, 3181 based on Foata normal form. 0/9349 useless extension candidates. Maximal degree in co-relation 25357. Up to 5816 conditions per place. [2025-03-09 06:41:01,827 INFO L140 encePairwiseOnDemand]: 82/87 looper letters, 111 selfloop transitions, 4 changer transitions 0/132 dead transitions. [2025-03-09 06:41:01,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 132 transitions, 751 flow [2025-03-09 06:41:01,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:41:01,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 06:41:01,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 147 transitions. [2025-03-09 06:41:01,829 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5632183908045977 [2025-03-09 06:41:01,830 INFO L175 Difference]: Start difference. First operand has 78 places, 106 transitions, 461 flow. Second operand 3 states and 147 transitions. [2025-03-09 06:41:01,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 132 transitions, 751 flow [2025-03-09 06:41:01,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 132 transitions, 748 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 06:41:01,834 INFO L231 Difference]: Finished difference. Result has 81 places, 107 transitions, 480 flow [2025-03-09 06:41:01,835 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=458, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=480, PETRI_PLACES=81, PETRI_TRANSITIONS=107} [2025-03-09 06:41:01,836 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 6 predicate places. [2025-03-09 06:41:01,836 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 107 transitions, 480 flow [2025-03-09 06:41:01,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:41:01,837 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:41:01,838 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:41:01,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 06:41:01,838 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-03-09 06:41:01,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:41:01,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1682578464, now seen corresponding path program 1 times [2025-03-09 06:41:01,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:41:01,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658211030] [2025-03-09 06:41:01,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:41:01,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:41:01,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 06:41:01,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 06:41:01,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:41:01,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:41:01,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:41:01,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:41:01,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658211030] [2025-03-09 06:41:01,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658211030] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:41:01,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:41:01,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:41:01,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807616187] [2025-03-09 06:41:01,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:41:01,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 06:41:01,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:41:01,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:41:01,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:41:01,934 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 87 [2025-03-09 06:41:01,934 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 107 transitions, 480 flow. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:41:01,934 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:41:01,934 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 87 [2025-03-09 06:41:01,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:41:02,728 INFO L124 PetriNetUnfolderBase]: 10419/15910 cut-off events. [2025-03-09 06:41:02,729 INFO L125 PetriNetUnfolderBase]: For 3354/3462 co-relation queries the response was YES. [2025-03-09 06:41:02,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33886 conditions, 15910 events. 10419/15910 cut-off events. For 3354/3462 co-relation queries the response was YES. Maximal size of possible extension queue 467. Compared 99331 event pairs, 4177 based on Foata normal form. 315/12543 useless extension candidates. Maximal degree in co-relation 33790. Up to 7196 conditions per place. [2025-03-09 06:41:02,794 INFO L140 encePairwiseOnDemand]: 83/87 looper letters, 113 selfloop transitions, 2 changer transitions 0/138 dead transitions. [2025-03-09 06:41:02,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 138 transitions, 796 flow [2025-03-09 06:41:02,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:41:02,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 06:41:02,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 163 transitions. [2025-03-09 06:41:02,796 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6245210727969349 [2025-03-09 06:41:02,796 INFO L175 Difference]: Start difference. First operand has 81 places, 107 transitions, 480 flow. Second operand 3 states and 163 transitions. [2025-03-09 06:41:02,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 138 transitions, 796 flow [2025-03-09 06:41:02,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 138 transitions, 784 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 06:41:02,804 INFO L231 Difference]: Finished difference. Result has 82 places, 108 transitions, 486 flow [2025-03-09 06:41:02,804 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=472, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=486, PETRI_PLACES=82, PETRI_TRANSITIONS=108} [2025-03-09 06:41:02,805 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 7 predicate places. [2025-03-09 06:41:02,806 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 108 transitions, 486 flow [2025-03-09 06:41:02,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:41:02,806 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:41:02,806 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:41:02,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 06:41:02,806 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-03-09 06:41:02,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:41:02,807 INFO L85 PathProgramCache]: Analyzing trace with hash -620322821, now seen corresponding path program 1 times [2025-03-09 06:41:02,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:41:02,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306305524] [2025-03-09 06:41:02,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:41:02,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:41:02,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 06:41:02,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 06:41:02,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:41:02,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:41:02,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:41:02,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:41:02,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306305524] [2025-03-09 06:41:02,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306305524] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:41:02,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:41:02,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:41:02,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54707045] [2025-03-09 06:41:02,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:41:02,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 06:41:02,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:41:02,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:41:02,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:41:02,863 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 87 [2025-03-09 06:41:02,864 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 108 transitions, 486 flow. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:41:02,864 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:41:02,864 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 87 [2025-03-09 06:41:02,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:41:04,066 INFO L124 PetriNetUnfolderBase]: 14063/20641 cut-off events. [2025-03-09 06:41:04,066 INFO L125 PetriNetUnfolderBase]: For 3137/3361 co-relation queries the response was YES. [2025-03-09 06:41:04,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43482 conditions, 20641 events. 14063/20641 cut-off events. For 3137/3361 co-relation queries the response was YES. Maximal size of possible extension queue 679. Compared 124236 event pairs, 6937 based on Foata normal form. 0/15999 useless extension candidates. Maximal degree in co-relation 43385. Up to 12185 conditions per place. [2025-03-09 06:41:04,179 INFO L140 encePairwiseOnDemand]: 82/87 looper letters, 111 selfloop transitions, 4 changer transitions 0/135 dead transitions. [2025-03-09 06:41:04,179 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 135 transitions, 786 flow [2025-03-09 06:41:04,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:41:04,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 06:41:04,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 153 transitions. [2025-03-09 06:41:04,180 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5862068965517241 [2025-03-09 06:41:04,183 INFO L175 Difference]: Start difference. First operand has 82 places, 108 transitions, 486 flow. Second operand 3 states and 153 transitions. [2025-03-09 06:41:04,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 135 transitions, 786 flow [2025-03-09 06:41:04,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 135 transitions, 784 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 06:41:04,189 INFO L231 Difference]: Finished difference. Result has 85 places, 108 transitions, 502 flow [2025-03-09 06:41:04,189 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=480, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=502, PETRI_PLACES=85, PETRI_TRANSITIONS=108} [2025-03-09 06:41:04,191 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 10 predicate places. [2025-03-09 06:41:04,192 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 108 transitions, 502 flow [2025-03-09 06:41:04,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:41:04,193 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:41:04,193 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:41:04,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 06:41:04,193 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-03-09 06:41:04,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:41:04,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1072264172, now seen corresponding path program 1 times [2025-03-09 06:41:04,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:41:04,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41566920] [2025-03-09 06:41:04,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:41:04,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:41:04,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 06:41:04,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 06:41:04,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:41:04,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:41:04,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:41:04,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:41:04,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41566920] [2025-03-09 06:41:04,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41566920] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:41:04,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:41:04,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:41:04,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994647046] [2025-03-09 06:41:04,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:41:04,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:41:04,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:41:04,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:41:04,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:41:04,316 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 87 [2025-03-09 06:41:04,316 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 108 transitions, 502 flow. Second operand has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:41:04,316 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:41:04,316 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 87 [2025-03-09 06:41:04,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:41:05,310 INFO L124 PetriNetUnfolderBase]: 12513/19149 cut-off events. [2025-03-09 06:41:05,310 INFO L125 PetriNetUnfolderBase]: For 6019/6411 co-relation queries the response was YES. [2025-03-09 06:41:05,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41684 conditions, 19149 events. 12513/19149 cut-off events. For 6019/6411 co-relation queries the response was YES. Maximal size of possible extension queue 628. Compared 120296 event pairs, 9361 based on Foata normal form. 112/14996 useless extension candidates. Maximal degree in co-relation 41529. Up to 15248 conditions per place. [2025-03-09 06:41:05,373 INFO L140 encePairwiseOnDemand]: 82/87 looper letters, 131 selfloop transitions, 3 changer transitions 2/160 dead transitions. [2025-03-09 06:41:05,374 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 160 transitions, 1013 flow [2025-03-09 06:41:05,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:41:05,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:41:05,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 191 transitions. [2025-03-09 06:41:05,375 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5488505747126436 [2025-03-09 06:41:05,375 INFO L175 Difference]: Start difference. First operand has 85 places, 108 transitions, 502 flow. Second operand 4 states and 191 transitions. [2025-03-09 06:41:05,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 160 transitions, 1013 flow [2025-03-09 06:41:05,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 160 transitions, 1005 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 06:41:05,382 INFO L231 Difference]: Finished difference. Result has 87 places, 108 transitions, 505 flow [2025-03-09 06:41:05,383 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=494, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=505, PETRI_PLACES=87, PETRI_TRANSITIONS=108} [2025-03-09 06:41:05,383 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 12 predicate places. [2025-03-09 06:41:05,383 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 108 transitions, 505 flow [2025-03-09 06:41:05,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:41:05,383 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:41:05,383 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:41:05,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 06:41:05,383 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread3Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-03-09 06:41:05,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:41:05,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1119547010, now seen corresponding path program 1 times [2025-03-09 06:41:05,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:41:05,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404845451] [2025-03-09 06:41:05,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:41:05,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:41:05,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 06:41:05,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 06:41:05,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:41:05,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:41:05,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:41:05,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:41:05,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404845451] [2025-03-09 06:41:05,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404845451] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:41:05,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:41:05,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:41:05,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787977135] [2025-03-09 06:41:05,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:41:05,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 06:41:05,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:41:05,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:41:05,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:41:05,430 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 87 [2025-03-09 06:41:05,431 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 108 transitions, 505 flow. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:41:05,431 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:41:05,431 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 87 [2025-03-09 06:41:05,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:41:07,141 INFO L124 PetriNetUnfolderBase]: 23803/34697 cut-off events. [2025-03-09 06:41:07,141 INFO L125 PetriNetUnfolderBase]: For 9699/10513 co-relation queries the response was YES. [2025-03-09 06:41:07,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76589 conditions, 34697 events. 23803/34697 cut-off events. For 9699/10513 co-relation queries the response was YES. Maximal size of possible extension queue 1113. Compared 216488 event pairs, 13589 based on Foata normal form. 0/26667 useless extension candidates. Maximal degree in co-relation 76433. Up to 16287 conditions per place. [2025-03-09 06:41:07,301 INFO L140 encePairwiseOnDemand]: 82/87 looper letters, 111 selfloop transitions, 5 changer transitions 0/137 dead transitions. [2025-03-09 06:41:07,301 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 137 transitions, 823 flow [2025-03-09 06:41:07,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:41:07,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 06:41:07,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 153 transitions. [2025-03-09 06:41:07,303 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5862068965517241 [2025-03-09 06:41:07,303 INFO L175 Difference]: Start difference. First operand has 87 places, 108 transitions, 505 flow. Second operand 3 states and 153 transitions. [2025-03-09 06:41:07,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 137 transitions, 823 flow [2025-03-09 06:41:07,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 137 transitions, 819 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-09 06:41:07,313 INFO L231 Difference]: Finished difference. Result has 90 places, 109 transitions, 527 flow [2025-03-09 06:41:07,313 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=501, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=527, PETRI_PLACES=90, PETRI_TRANSITIONS=109} [2025-03-09 06:41:07,314 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 15 predicate places. [2025-03-09 06:41:07,314 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 109 transitions, 527 flow [2025-03-09 06:41:07,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:41:07,314 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:41:07,314 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1] [2025-03-09 06:41:07,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 06:41:07,314 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-03-09 06:41:07,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:41:07,315 INFO L85 PathProgramCache]: Analyzing trace with hash 552011317, now seen corresponding path program 2 times [2025-03-09 06:41:07,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:41:07,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035832433] [2025-03-09 06:41:07,315 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:41:07,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:41:07,322 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-09 06:41:07,329 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 16 statements. [2025-03-09 06:41:07,329 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 06:41:07,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:41:07,362 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-09 06:41:07,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:41:07,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035832433] [2025-03-09 06:41:07,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035832433] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:41:07,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1563301716] [2025-03-09 06:41:07,362 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:41:07,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:41:07,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:41:07,365 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:41:07,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 06:41:07,413 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-09 06:41:07,423 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 16 statements. [2025-03-09 06:41:07,424 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 06:41:07,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:41:07,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 06:41:07,426 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:41:07,451 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-09 06:41:07,452 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:41:07,479 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-09 06:41:07,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1563301716] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:41:07,480 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:41:07,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 2 [2025-03-09 06:41:07,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570934695] [2025-03-09 06:41:07,480 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:41:07,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:41:07,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:41:07,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:41:07,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:41:07,489 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 87 [2025-03-09 06:41:07,490 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 109 transitions, 527 flow. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:41:07,490 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:41:07,490 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 87 [2025-03-09 06:41:07,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:41:09,605 INFO L124 PetriNetUnfolderBase]: 18815/28864 cut-off events. [2025-03-09 06:41:09,606 INFO L125 PetriNetUnfolderBase]: For 12408/13526 co-relation queries the response was YES. [2025-03-09 06:41:09,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65257 conditions, 28864 events. 18815/28864 cut-off events. For 12408/13526 co-relation queries the response was YES. Maximal size of possible extension queue 928. Compared 196409 event pairs, 15031 based on Foata normal form. 5/22941 useless extension candidates. Maximal degree in co-relation 65125. Up to 24910 conditions per place. [2025-03-09 06:41:09,710 INFO L140 encePairwiseOnDemand]: 76/87 looper letters, 47 selfloop transitions, 36 changer transitions 1/106 dead transitions. [2025-03-09 06:41:09,710 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 106 transitions, 665 flow [2025-03-09 06:41:09,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:41:09,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:41:09,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 137 transitions. [2025-03-09 06:41:09,712 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3936781609195402 [2025-03-09 06:41:09,712 INFO L175 Difference]: Start difference. First operand has 90 places, 109 transitions, 527 flow. Second operand 4 states and 137 transitions. [2025-03-09 06:41:09,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 106 transitions, 665 flow [2025-03-09 06:41:09,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 106 transitions, 625 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-03-09 06:41:09,720 INFO L231 Difference]: Finished difference. Result has 84 places, 105 transitions, 524 flow [2025-03-09 06:41:09,720 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=457, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=524, PETRI_PLACES=84, PETRI_TRANSITIONS=105} [2025-03-09 06:41:09,721 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 9 predicate places. [2025-03-09 06:41:09,721 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 105 transitions, 524 flow [2025-03-09 06:41:09,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:41:09,721 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:41:09,721 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:41:09,727 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-09 06:41:09,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:41:09,925 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-03-09 06:41:09,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:41:09,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1301027940, now seen corresponding path program 1 times [2025-03-09 06:41:09,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:41:09,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124994939] [2025-03-09 06:41:09,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:41:09,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:41:09,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 06:41:09,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 06:41:09,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:41:09,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:41:10,053 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:41:10,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:41:10,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124994939] [2025-03-09 06:41:10,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124994939] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:41:10,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1655602448] [2025-03-09 06:41:10,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:41:10,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:41:10,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:41:10,055 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:41:10,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 06:41:10,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 06:41:10,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 06:41:10,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:41:10,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:41:10,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 06:41:10,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:41:10,151 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 06:41:10,152 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 06:41:10,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1655602448] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:41:10,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 06:41:10,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [4] total 5 [2025-03-09 06:41:10,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535025360] [2025-03-09 06:41:10,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:41:10,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 06:41:10,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:41:10,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:41:10,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-09 06:41:10,154 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 87 [2025-03-09 06:41:10,154 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 105 transitions, 524 flow. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:41:10,154 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:41:10,154 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 87 [2025-03-09 06:41:10,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:41:11,190 INFO L124 PetriNetUnfolderBase]: 13824/21467 cut-off events. [2025-03-09 06:41:11,190 INFO L125 PetriNetUnfolderBase]: For 7734/8646 co-relation queries the response was YES. [2025-03-09 06:41:11,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46818 conditions, 21467 events. 13824/21467 cut-off events. For 7734/8646 co-relation queries the response was YES. Maximal size of possible extension queue 670. Compared 142979 event pairs, 10758 based on Foata normal form. 1221/18132 useless extension candidates. Maximal degree in co-relation 46580. Up to 18121 conditions per place. [2025-03-09 06:41:11,281 INFO L140 encePairwiseOnDemand]: 82/87 looper letters, 78 selfloop transitions, 1 changer transitions 0/101 dead transitions. [2025-03-09 06:41:11,281 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 101 transitions, 668 flow [2025-03-09 06:41:11,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:41:11,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 06:41:11,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 130 transitions. [2025-03-09 06:41:11,282 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49808429118773945 [2025-03-09 06:41:11,282 INFO L175 Difference]: Start difference. First operand has 84 places, 105 transitions, 524 flow. Second operand 3 states and 130 transitions. [2025-03-09 06:41:11,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 101 transitions, 668 flow [2025-03-09 06:41:11,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 101 transitions, 594 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-03-09 06:41:11,287 INFO L231 Difference]: Finished difference. Result has 77 places, 101 transitions, 438 flow [2025-03-09 06:41:11,288 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=436, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=438, PETRI_PLACES=77, PETRI_TRANSITIONS=101} [2025-03-09 06:41:11,288 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 2 predicate places. [2025-03-09 06:41:11,288 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 101 transitions, 438 flow [2025-03-09 06:41:11,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:41:11,288 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:41:11,288 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:41:11,295 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-09 06:41:11,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:41:11,489 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread3Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-03-09 06:41:11,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:41:11,489 INFO L85 PathProgramCache]: Analyzing trace with hash -161590400, now seen corresponding path program 1 times [2025-03-09 06:41:11,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:41:11,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517756437] [2025-03-09 06:41:11,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:41:11,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:41:11,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-09 06:41:11,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 06:41:11,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:41:11,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:41:11,545 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 06:41:11,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:41:11,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517756437] [2025-03-09 06:41:11,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517756437] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:41:11,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:41:11,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:41:11,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92881467] [2025-03-09 06:41:11,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:41:11,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 06:41:11,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:41:11,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:41:11,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:41:11,548 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 87 [2025-03-09 06:41:11,548 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 101 transitions, 438 flow. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:41:11,548 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:41:11,548 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 87 [2025-03-09 06:41:11,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:41:12,761 INFO L124 PetriNetUnfolderBase]: 18120/27225 cut-off events. [2025-03-09 06:41:12,761 INFO L125 PetriNetUnfolderBase]: For 10308/12126 co-relation queries the response was YES. [2025-03-09 06:41:12,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61146 conditions, 27225 events. 18120/27225 cut-off events. For 10308/12126 co-relation queries the response was YES. Maximal size of possible extension queue 705. Compared 171006 event pairs, 6045 based on Foata normal form. 566/22680 useless extension candidates. Maximal degree in co-relation 61126. Up to 17545 conditions per place. [2025-03-09 06:41:12,900 INFO L140 encePairwiseOnDemand]: 83/87 looper letters, 103 selfloop transitions, 2 changer transitions 0/127 dead transitions. [2025-03-09 06:41:12,900 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 127 transitions, 728 flow [2025-03-09 06:41:12,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:41:12,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 06:41:12,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 153 transitions. [2025-03-09 06:41:12,901 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5862068965517241 [2025-03-09 06:41:12,901 INFO L175 Difference]: Start difference. First operand has 77 places, 101 transitions, 438 flow. Second operand 3 states and 153 transitions. [2025-03-09 06:41:12,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 127 transitions, 728 flow [2025-03-09 06:41:12,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 127 transitions, 727 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 06:41:12,908 INFO L231 Difference]: Finished difference. Result has 79 places, 102 transitions, 453 flow [2025-03-09 06:41:12,909 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=437, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=453, PETRI_PLACES=79, PETRI_TRANSITIONS=102} [2025-03-09 06:41:12,909 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 4 predicate places. [2025-03-09 06:41:12,910 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 102 transitions, 453 flow [2025-03-09 06:41:12,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:41:12,911 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:41:12,911 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:41:12,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-09 06:41:12,911 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-03-09 06:41:12,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:41:12,911 INFO L85 PathProgramCache]: Analyzing trace with hash 294995368, now seen corresponding path program 1 times [2025-03-09 06:41:12,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:41:12,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73838816] [2025-03-09 06:41:12,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:41:12,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:41:12,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-09 06:41:12,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-09 06:41:12,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:41:12,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:41:13,003 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 06:41:13,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:41:13,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73838816] [2025-03-09 06:41:13,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73838816] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:41:13,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:41:13,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:41:13,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367392029] [2025-03-09 06:41:13,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:41:13,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:41:13,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:41:13,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:41:13,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:41:13,005 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 87 [2025-03-09 06:41:13,006 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 102 transitions, 453 flow. Second operand has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:41:13,006 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:41:13,006 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 87 [2025-03-09 06:41:13,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:41:15,272 INFO L124 PetriNetUnfolderBase]: 23693/36202 cut-off events. [2025-03-09 06:41:15,272 INFO L125 PetriNetUnfolderBase]: For 15425/17472 co-relation queries the response was YES. [2025-03-09 06:41:15,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82234 conditions, 36202 events. 23693/36202 cut-off events. For 15425/17472 co-relation queries the response was YES. Maximal size of possible extension queue 814. Compared 242331 event pairs, 18637 based on Foata normal form. 320/29484 useless extension candidates. Maximal degree in co-relation 82212. Up to 24052 conditions per place. [2025-03-09 06:41:15,492 INFO L140 encePairwiseOnDemand]: 78/87 looper letters, 95 selfloop transitions, 14 changer transitions 0/131 dead transitions. [2025-03-09 06:41:15,492 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 131 transitions, 764 flow [2025-03-09 06:41:15,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 06:41:15,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 06:41:15,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 219 transitions. [2025-03-09 06:41:15,493 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.503448275862069 [2025-03-09 06:41:15,493 INFO L175 Difference]: Start difference. First operand has 79 places, 102 transitions, 453 flow. Second operand 5 states and 219 transitions. [2025-03-09 06:41:15,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 131 transitions, 764 flow [2025-03-09 06:41:15,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 131 transitions, 761 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 06:41:15,503 INFO L231 Difference]: Finished difference. Result has 83 places, 102 transitions, 494 flow [2025-03-09 06:41:15,503 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=451, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=494, PETRI_PLACES=83, PETRI_TRANSITIONS=102} [2025-03-09 06:41:15,503 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 8 predicate places. [2025-03-09 06:41:15,503 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 102 transitions, 494 flow [2025-03-09 06:41:15,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:41:15,504 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:41:15,504 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:41:15,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-09 06:41:15,504 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-03-09 06:41:15,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:41:15,504 INFO L85 PathProgramCache]: Analyzing trace with hash 22770829, now seen corresponding path program 1 times [2025-03-09 06:41:15,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:41:15,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387938152] [2025-03-09 06:41:15,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:41:15,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:41:15,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-09 06:41:15,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 06:41:15,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:41:15,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:41:15,546 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 06:41:15,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:41:15,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387938152] [2025-03-09 06:41:15,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387938152] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:41:15,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:41:15,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:41:15,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626471575] [2025-03-09 06:41:15,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:41:15,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 06:41:15,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:41:15,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:41:15,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:41:15,554 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 87 [2025-03-09 06:41:15,555 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 102 transitions, 494 flow. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:41:15,555 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:41:15,555 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 87 [2025-03-09 06:41:15,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:41:18,149 INFO L124 PetriNetUnfolderBase]: 26991/38864 cut-off events. [2025-03-09 06:41:18,150 INFO L125 PetriNetUnfolderBase]: For 17207/19370 co-relation queries the response was YES. [2025-03-09 06:41:18,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91720 conditions, 38864 events. 26991/38864 cut-off events. For 17207/19370 co-relation queries the response was YES. Maximal size of possible extension queue 688. Compared 225872 event pairs, 14081 based on Foata normal form. 452/33490 useless extension candidates. Maximal degree in co-relation 91696. Up to 24066 conditions per place. [2025-03-09 06:41:18,445 INFO L140 encePairwiseOnDemand]: 82/87 looper letters, 103 selfloop transitions, 4 changer transitions 1/124 dead transitions. [2025-03-09 06:41:18,445 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 124 transitions, 776 flow [2025-03-09 06:41:18,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:41:18,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 06:41:18,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 140 transitions. [2025-03-09 06:41:18,446 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5363984674329502 [2025-03-09 06:41:18,446 INFO L175 Difference]: Start difference. First operand has 83 places, 102 transitions, 494 flow. Second operand 3 states and 140 transitions. [2025-03-09 06:41:18,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 124 transitions, 776 flow [2025-03-09 06:41:18,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 124 transitions, 759 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-09 06:41:18,456 INFO L231 Difference]: Finished difference. Result has 85 places, 102 transitions, 494 flow [2025-03-09 06:41:18,456 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=477, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=494, PETRI_PLACES=85, PETRI_TRANSITIONS=102} [2025-03-09 06:41:18,457 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 10 predicate places. [2025-03-09 06:41:18,457 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 102 transitions, 494 flow [2025-03-09 06:41:18,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:41:18,457 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:41:18,457 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:41:18,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-09 06:41:18,457 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-03-09 06:41:18,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:41:18,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1354226498, now seen corresponding path program 1 times [2025-03-09 06:41:18,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:41:18,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644238047] [2025-03-09 06:41:18,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:41:18,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:41:18,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-09 06:41:18,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-09 06:41:18,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:41:18,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:41:18,611 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 06:41:18,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:41:18,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644238047] [2025-03-09 06:41:18,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644238047] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:41:18,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [210984935] [2025-03-09 06:41:18,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:41:18,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:41:18,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:41:18,613 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:41:18,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-09 06:41:18,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-09 06:41:18,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-09 06:41:18,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:41:18,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:41:18,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 06:41:18,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:41:18,728 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 06:41:18,728 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 06:41:18,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [210984935] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:41:18,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 06:41:18,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-09 06:41:18,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088463541] [2025-03-09 06:41:18,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:41:18,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 06:41:18,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:41:18,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:41:18,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-09 06:41:18,731 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 87 [2025-03-09 06:41:18,731 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 102 transitions, 494 flow. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:41:18,731 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:41:18,731 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 87 [2025-03-09 06:41:18,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:41:19,910 INFO L124 PetriNetUnfolderBase]: 16299/24739 cut-off events. [2025-03-09 06:41:19,910 INFO L125 PetriNetUnfolderBase]: For 17408/19201 co-relation queries the response was YES. [2025-03-09 06:41:19,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58685 conditions, 24739 events. 16299/24739 cut-off events. For 17408/19201 co-relation queries the response was YES. Maximal size of possible extension queue 583. Compared 155001 event pairs, 12973 based on Foata normal form. 1360/21569 useless extension candidates. Maximal degree in co-relation 58661. Up to 21771 conditions per place. [2025-03-09 06:41:20,052 INFO L140 encePairwiseOnDemand]: 84/87 looper letters, 76 selfloop transitions, 1 changer transitions 0/100 dead transitions. [2025-03-09 06:41:20,052 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 100 transitions, 640 flow [2025-03-09 06:41:20,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:41:20,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 06:41:20,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2025-03-09 06:41:20,053 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4827586206896552 [2025-03-09 06:41:20,053 INFO L175 Difference]: Start difference. First operand has 85 places, 102 transitions, 494 flow. Second operand 3 states and 126 transitions. [2025-03-09 06:41:20,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 100 transitions, 640 flow [2025-03-09 06:41:20,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 100 transitions, 620 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-03-09 06:41:20,063 INFO L231 Difference]: Finished difference. Result has 82 places, 100 transitions, 468 flow [2025-03-09 06:41:20,063 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=466, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=468, PETRI_PLACES=82, PETRI_TRANSITIONS=100} [2025-03-09 06:41:20,064 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 7 predicate places. [2025-03-09 06:41:20,064 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 100 transitions, 468 flow [2025-03-09 06:41:20,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:41:20,068 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:41:20,068 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:41:20,074 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-09 06:41:20,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-09 06:41:20,268 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-03-09 06:41:20,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:41:20,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1264785369, now seen corresponding path program 1 times [2025-03-09 06:41:20,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:41:20,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214756461] [2025-03-09 06:41:20,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:41:20,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:41:20,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-09 06:41:20,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-09 06:41:20,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:41:20,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:41:20,307 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 06:41:20,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:41:20,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214756461] [2025-03-09 06:41:20,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214756461] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:41:20,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:41:20,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:41:20,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047040851] [2025-03-09 06:41:20,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:41:20,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 06:41:20,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:41:20,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:41:20,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:41:20,315 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 87 [2025-03-09 06:41:20,315 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 100 transitions, 468 flow. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:41:20,315 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:41:20,315 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 87 [2025-03-09 06:41:20,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:41:22,093 INFO L124 PetriNetUnfolderBase]: 25849/37649 cut-off events. [2025-03-09 06:41:22,093 INFO L125 PetriNetUnfolderBase]: For 19530/22318 co-relation queries the response was YES. [2025-03-09 06:41:22,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89734 conditions, 37649 events. 25849/37649 cut-off events. For 19530/22318 co-relation queries the response was YES. Maximal size of possible extension queue 558. Compared 221480 event pairs, 16025 based on Foata normal form. 640/32464 useless extension candidates. Maximal degree in co-relation 89710. Up to 27157 conditions per place. [2025-03-09 06:41:22,365 INFO L140 encePairwiseOnDemand]: 81/87 looper letters, 101 selfloop transitions, 4 changer transitions 0/121 dead transitions. [2025-03-09 06:41:22,365 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 121 transitions, 740 flow [2025-03-09 06:41:22,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:41:22,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 06:41:22,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2025-03-09 06:41:22,366 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5287356321839081 [2025-03-09 06:41:22,366 INFO L175 Difference]: Start difference. First operand has 82 places, 100 transitions, 468 flow. Second operand 3 states and 138 transitions. [2025-03-09 06:41:22,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 121 transitions, 740 flow [2025-03-09 06:41:22,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 121 transitions, 739 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 06:41:22,377 INFO L231 Difference]: Finished difference. Result has 85 places, 101 transitions, 493 flow [2025-03-09 06:41:22,377 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=467, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=493, PETRI_PLACES=85, PETRI_TRANSITIONS=101} [2025-03-09 06:41:22,378 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 10 predicate places. [2025-03-09 06:41:22,378 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 101 transitions, 493 flow [2025-03-09 06:41:22,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:41:22,378 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:41:22,378 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:41:22,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-09 06:41:22,379 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-03-09 06:41:22,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:41:22,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1859662156, now seen corresponding path program 1 times [2025-03-09 06:41:22,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:41:22,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030883782] [2025-03-09 06:41:22,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:41:22,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:41:22,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-09 06:41:22,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-09 06:41:22,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:41:22,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:41:22,497 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-09 06:41:22,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:41:22,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030883782] [2025-03-09 06:41:22,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030883782] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:41:22,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:41:22,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:41:22,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032764723] [2025-03-09 06:41:22,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:41:22,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:41:22,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:41:22,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:41:22,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:41:22,498 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 87 [2025-03-09 06:41:22,498 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 101 transitions, 493 flow. Second operand has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:41:22,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:41:22,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 87 [2025-03-09 06:41:22,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:41:24,754 INFO L124 PetriNetUnfolderBase]: 27356/42138 cut-off events. [2025-03-09 06:41:24,755 INFO L125 PetriNetUnfolderBase]: For 26581/29479 co-relation queries the response was YES. [2025-03-09 06:41:24,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99402 conditions, 42138 events. 27356/42138 cut-off events. For 26581/29479 co-relation queries the response was YES. Maximal size of possible extension queue 573. Compared 276460 event pairs, 22206 based on Foata normal form. 120/34615 useless extension candidates. Maximal degree in co-relation 99377. Up to 27867 conditions per place. [2025-03-09 06:41:24,994 INFO L140 encePairwiseOnDemand]: 79/87 looper letters, 69 selfloop transitions, 7 changer transitions 43/143 dead transitions. [2025-03-09 06:41:24,994 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 143 transitions, 915 flow [2025-03-09 06:41:24,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 06:41:24,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 06:41:24,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 218 transitions. [2025-03-09 06:41:24,996 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5011494252873563 [2025-03-09 06:41:24,996 INFO L175 Difference]: Start difference. First operand has 85 places, 101 transitions, 493 flow. Second operand 5 states and 218 transitions. [2025-03-09 06:41:24,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 143 transitions, 915 flow [2025-03-09 06:41:25,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 143 transitions, 901 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 06:41:25,013 INFO L231 Difference]: Finished difference. Result has 89 places, 100 transitions, 508 flow [2025-03-09 06:41:25,014 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=485, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=508, PETRI_PLACES=89, PETRI_TRANSITIONS=100} [2025-03-09 06:41:25,014 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 14 predicate places. [2025-03-09 06:41:25,014 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 100 transitions, 508 flow [2025-03-09 06:41:25,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:41:25,015 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:41:25,015 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:41:25,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-09 06:41:25,015 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-03-09 06:41:25,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:41:25,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1821719210, now seen corresponding path program 1 times [2025-03-09 06:41:25,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:41:25,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815685860] [2025-03-09 06:41:25,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:41:25,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:41:25,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-09 06:41:25,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-09 06:41:25,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:41:25,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:41:25,158 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-09 06:41:25,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:41:25,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815685860] [2025-03-09 06:41:25,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815685860] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:41:25,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [374821783] [2025-03-09 06:41:25,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:41:25,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:41:25,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:41:25,161 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:41:25,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-09 06:41:25,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-09 06:41:25,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-09 06:41:25,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:41:25,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:41:25,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 06:41:25,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:41:25,292 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-09 06:41:25,292 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:41:25,431 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-09 06:41:25,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [374821783] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:41:25,432 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:41:25,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 4] total 11 [2025-03-09 06:41:25,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504863860] [2025-03-09 06:41:25,432 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:41:25,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 06:41:25,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:41:25,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 06:41:25,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-09 06:41:25,471 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 87 [2025-03-09 06:41:25,471 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 100 transitions, 508 flow. Second operand has 11 states, 11 states have (on average 28.818181818181817) internal successors, (317), 11 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:41:25,471 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:41:25,471 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 87 [2025-03-09 06:41:25,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:41:34,927 INFO L124 PetriNetUnfolderBase]: 95901/148589 cut-off events. [2025-03-09 06:41:34,928 INFO L125 PetriNetUnfolderBase]: For 90972/103082 co-relation queries the response was YES. [2025-03-09 06:41:35,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 339799 conditions, 148589 events. 95901/148589 cut-off events. For 90972/103082 co-relation queries the response was YES. Maximal size of possible extension queue 1909. Compared 1146746 event pairs, 39746 based on Foata normal form. 3792/121265 useless extension candidates. Maximal degree in co-relation 339771. Up to 28453 conditions per place. [2025-03-09 06:41:35,932 INFO L140 encePairwiseOnDemand]: 71/87 looper letters, 103 selfloop transitions, 24 changer transitions 91/242 dead transitions. [2025-03-09 06:41:35,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 242 transitions, 1514 flow [2025-03-09 06:41:35,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-09 06:41:35,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-09 06:41:35,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 469 transitions. [2025-03-09 06:41:35,934 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4146772767462423 [2025-03-09 06:41:35,934 INFO L175 Difference]: Start difference. First operand has 89 places, 100 transitions, 508 flow. Second operand 13 states and 469 transitions. [2025-03-09 06:41:35,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 242 transitions, 1514 flow [2025-03-09 06:41:35,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 242 transitions, 1474 flow, removed 11 selfloop flow, removed 5 redundant places. [2025-03-09 06:41:35,990 INFO L231 Difference]: Finished difference. Result has 102 places, 105 transitions, 651 flow [2025-03-09 06:41:35,990 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=484, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=651, PETRI_PLACES=102, PETRI_TRANSITIONS=105} [2025-03-09 06:41:35,990 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 27 predicate places. [2025-03-09 06:41:35,990 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 105 transitions, 651 flow [2025-03-09 06:41:35,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 28.818181818181817) internal successors, (317), 11 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:41:35,991 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:41:35,991 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:41:35,997 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-09 06:41:36,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-09 06:41:36,191 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-03-09 06:41:36,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:41:36,192 INFO L85 PathProgramCache]: Analyzing trace with hash -25861166, now seen corresponding path program 2 times [2025-03-09 06:41:36,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:41:36,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573459838] [2025-03-09 06:41:36,192 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:41:36,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:41:36,204 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 51 statements into 2 equivalence classes. [2025-03-09 06:41:36,208 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 51 statements. [2025-03-09 06:41:36,208 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 06:41:36,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:41:36,240 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-09 06:41:36,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:41:36,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573459838] [2025-03-09 06:41:36,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573459838] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:41:36,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:41:36,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:41:36,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201920109] [2025-03-09 06:41:36,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:41:36,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 06:41:36,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:41:36,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:41:36,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:41:36,242 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 87 [2025-03-09 06:41:36,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 105 transitions, 651 flow. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:41:36,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:41:36,242 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 87 [2025-03-09 06:41:36,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:41:42,502 INFO L124 PetriNetUnfolderBase]: 53830/83486 cut-off events. [2025-03-09 06:41:42,502 INFO L125 PetriNetUnfolderBase]: For 130721/136984 co-relation queries the response was YES. [2025-03-09 06:41:42,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 207251 conditions, 83486 events. 53830/83486 cut-off events. For 130721/136984 co-relation queries the response was YES. Maximal size of possible extension queue 1192. Compared 608598 event pairs, 43918 based on Foata normal form. 1936/68470 useless extension candidates. Maximal degree in co-relation 207220. Up to 71074 conditions per place. [2025-03-09 06:41:42,855 INFO L140 encePairwiseOnDemand]: 84/87 looper letters, 0 selfloop transitions, 0 changer transitions 103/103 dead transitions. [2025-03-09 06:41:42,855 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 103 transitions, 791 flow [2025-03-09 06:41:42,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:41:42,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 06:41:42,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 124 transitions. [2025-03-09 06:41:42,856 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47509578544061304 [2025-03-09 06:41:42,856 INFO L175 Difference]: Start difference. First operand has 102 places, 105 transitions, 651 flow. Second operand 3 states and 124 transitions. [2025-03-09 06:41:42,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 103 transitions, 791 flow [2025-03-09 06:41:43,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 103 transitions, 736 flow, removed 17 selfloop flow, removed 6 redundant places. [2025-03-09 06:41:43,058 INFO L231 Difference]: Finished difference. Result has 94 places, 0 transitions, 0 flow [2025-03-09 06:41:43,058 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=578, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=94, PETRI_TRANSITIONS=0} [2025-03-09 06:41:43,058 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 19 predicate places. [2025-03-09 06:41:43,059 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 0 transitions, 0 flow [2025-03-09 06:41:43,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:41:43,060 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 41 remaining) [2025-03-09 06:41:43,061 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 41 remaining) [2025-03-09 06:41:43,061 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 41 remaining) [2025-03-09 06:41:43,061 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 41 remaining) [2025-03-09 06:41:43,061 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 41 remaining) [2025-03-09 06:41:43,061 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 41 remaining) [2025-03-09 06:41:43,061 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 41 remaining) [2025-03-09 06:41:43,061 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 41 remaining) [2025-03-09 06:41:43,061 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 41 remaining) [2025-03-09 06:41:43,061 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 41 remaining) [2025-03-09 06:41:43,061 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 41 remaining) [2025-03-09 06:41:43,061 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 41 remaining) [2025-03-09 06:41:43,061 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 41 remaining) [2025-03-09 06:41:43,061 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 41 remaining) [2025-03-09 06:41:43,061 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 41 remaining) [2025-03-09 06:41:43,061 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 41 remaining) [2025-03-09 06:41:43,061 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 41 remaining) [2025-03-09 06:41:43,061 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 41 remaining) [2025-03-09 06:41:43,061 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 41 remaining) [2025-03-09 06:41:43,061 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 41 remaining) [2025-03-09 06:41:43,061 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 41 remaining) [2025-03-09 06:41:43,061 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 41 remaining) [2025-03-09 06:41:43,061 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 41 remaining) [2025-03-09 06:41:43,061 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (17 of 41 remaining) [2025-03-09 06:41:43,061 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 41 remaining) [2025-03-09 06:41:43,062 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 41 remaining) [2025-03-09 06:41:43,062 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 41 remaining) [2025-03-09 06:41:43,062 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 41 remaining) [2025-03-09 06:41:43,062 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 41 remaining) [2025-03-09 06:41:43,062 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 41 remaining) [2025-03-09 06:41:43,062 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 41 remaining) [2025-03-09 06:41:43,062 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 41 remaining) [2025-03-09 06:41:43,062 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 41 remaining) [2025-03-09 06:41:43,062 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 41 remaining) [2025-03-09 06:41:43,062 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 41 remaining) [2025-03-09 06:41:43,062 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 41 remaining) [2025-03-09 06:41:43,062 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 41 remaining) [2025-03-09 06:41:43,062 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 41 remaining) [2025-03-09 06:41:43,062 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 41 remaining) [2025-03-09 06:41:43,062 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 41 remaining) [2025-03-09 06:41:43,062 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 41 remaining) [2025-03-09 06:41:43,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-09 06:41:43,062 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:41:43,066 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-09 06:41:43,066 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 06:41:43,069 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 06:41:43 BasicIcfg [2025-03-09 06:41:43,069 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 06:41:43,070 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 06:41:43,070 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 06:41:43,070 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 06:41:43,070 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:40:57" (3/4) ... [2025-03-09 06:41:43,071 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-09 06:41:43,073 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-09 06:41:43,073 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-09 06:41:43,073 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-03-09 06:41:43,077 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 135 nodes and edges [2025-03-09 06:41:43,078 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 54 nodes and edges [2025-03-09 06:41:43,078 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 35 nodes and edges [2025-03-09 06:41:43,078 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-09 06:41:43,283 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-09 06:41:43,283 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-09 06:41:43,283 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 06:41:43,284 INFO L158 Benchmark]: Toolchain (without parser) took 47386.95ms. Allocated memory was 142.6MB in the beginning and 10.8GB in the end (delta: 10.7GB). Free memory was 104.1MB in the beginning and 8.0GB in the end (delta: -7.9GB). Peak memory consumption was 2.8GB. Max. memory is 16.1GB. [2025-03-09 06:41:43,285 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 127.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 06:41:43,285 INFO L158 Benchmark]: CACSL2BoogieTranslator took 227.55ms. Allocated memory is still 142.6MB. Free memory was 103.2MB in the beginning and 90.3MB in the end (delta: 12.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-09 06:41:43,285 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.84ms. Allocated memory is still 142.6MB. Free memory was 90.3MB in the beginning and 88.3MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 06:41:43,285 INFO L158 Benchmark]: Boogie Preprocessor took 38.28ms. Allocated memory is still 142.6MB. Free memory was 88.3MB in the beginning and 85.4MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 06:41:43,286 INFO L158 Benchmark]: IcfgBuilder took 890.58ms. Allocated memory is still 142.6MB. Free memory was 85.4MB in the beginning and 56.1MB in the end (delta: 29.2MB). Peak memory consumption was 64.9MB. Max. memory is 16.1GB. [2025-03-09 06:41:43,286 INFO L158 Benchmark]: TraceAbstraction took 45964.77ms. Allocated memory was 142.6MB in the beginning and 10.8GB in the end (delta: 10.7GB). Free memory was 55.4MB in the beginning and 8.0GB in the end (delta: -7.9GB). Peak memory consumption was 3.1GB. Max. memory is 16.1GB. [2025-03-09 06:41:43,286 INFO L158 Benchmark]: Witness Printer took 213.66ms. Allocated memory is still 10.8GB. Free memory was 8.0GB in the beginning and 8.0GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 06:41:43,287 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 127.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 227.55ms. Allocated memory is still 142.6MB. Free memory was 103.2MB in the beginning and 90.3MB in the end (delta: 12.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.84ms. Allocated memory is still 142.6MB. Free memory was 90.3MB in the beginning and 88.3MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 38.28ms. Allocated memory is still 142.6MB. Free memory was 88.3MB in the beginning and 85.4MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 890.58ms. Allocated memory is still 142.6MB. Free memory was 85.4MB in the beginning and 56.1MB in the end (delta: 29.2MB). Peak memory consumption was 64.9MB. Max. memory is 16.1GB. * TraceAbstraction took 45964.77ms. Allocated memory was 142.6MB in the beginning and 10.8GB in the end (delta: 10.7GB). Free memory was 55.4MB in the beginning and 8.0GB in the end (delta: -7.9GB). Peak memory consumption was 3.1GB. Max. memory is 16.1GB. * Witness Printer took 213.66ms. Allocated memory is still 10.8GB. Free memory was 8.0GB in the beginning and 8.0GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 63]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 63]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 70]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 70]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 77]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 77]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 92]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 92]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 99]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 99]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 114]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 114]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 121]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 121]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 172]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 172]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 172]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 172]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 172]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 172]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 118 locations, 148 edges, 41 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 45.9s, OverallIterations: 19, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 41.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 829 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 733 mSDsluCounter, 324 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 261 mSDsCounter, 179 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2331 IncrementalHoareTripleChecker+Invalid, 2510 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 179 mSolverCounterUnsat, 63 mSDtfsCounter, 2331 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 250 GetRequests, 177 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=651occurred in iteration=18, InterpolantAutomatonStates: 84, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 506 NumberOfCodeBlocks, 447 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 545 ConstructedInterpolants, 0 QuantifiedInterpolants, 1705 SizeOfPredicates, 10 NumberOfNonLiveVariables, 1055 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 28 InterpolantComputations, 16 PerfectInterpolantSequences, 192/232 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 22 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-09 06:41:43,299 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE