./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/weaver/chl-collitem-symm.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8fc3dc66 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/chl-collitem-symm.wvr.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 631177edb7ca950f3594c5b6eaac98148a00ee69e6a0cd62c1c95947fa56259c --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 19:40:29,113 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 19:40:29,162 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-17 19:40:29,165 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 19:40:29,166 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 19:40:29,187 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 19:40:29,188 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 19:40:29,188 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 19:40:29,188 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 19:40:29,188 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 19:40:29,188 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 19:40:29,188 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 19:40:29,188 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 19:40:29,188 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 19:40:29,188 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 19:40:29,189 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 19:40:29,189 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 19:40:29,189 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 19:40:29,189 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 19:40:29,189 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 19:40:29,189 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 19:40:29,189 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 19:40:29,189 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 19:40:29,189 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 19:40:29,189 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 19:40:29,189 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 19:40:29,189 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 19:40:29,189 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 19:40:29,189 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 19:40:29,189 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 19:40:29,192 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 19:40:29,192 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 19:40:29,192 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 19:40:29,192 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 19:40:29,192 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 19:40:29,192 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 19:40:29,192 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 19:40:29,192 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 19:40:29,192 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 19:40:29,192 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 19:40:29,192 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 19:40:29,193 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 19:40:29,193 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 19:40:29,193 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 19:40:29,193 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 19:40:29,193 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 -> 631177edb7ca950f3594c5b6eaac98148a00ee69e6a0cd62c1c95947fa56259c [2025-03-17 19:40:29,410 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 19:40:29,419 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 19:40:29,421 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 19:40:29,422 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 19:40:29,422 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 19:40:29,424 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-collitem-symm.wvr.c [2025-03-17 19:40:30,577 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6be0f8292/8555f9e60e464ce0bec571c89f795125/FLAG57c757f1c [2025-03-17 19:40:30,796 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 19:40:30,800 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-collitem-symm.wvr.c [2025-03-17 19:40:30,807 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6be0f8292/8555f9e60e464ce0bec571c89f795125/FLAG57c757f1c [2025-03-17 19:40:30,827 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6be0f8292/8555f9e60e464ce0bec571c89f795125 [2025-03-17 19:40:30,829 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 19:40:30,830 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 19:40:30,831 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 19:40:30,831 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 19:40:30,835 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 19:40:30,836 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:40:30" (1/1) ... [2025-03-17 19:40:30,837 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ed5a2e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:40:30, skipping insertion in model container [2025-03-17 19:40:30,838 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:40:30" (1/1) ... [2025-03-17 19:40:30,851 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 19:40:30,987 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 19:40:30,998 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 19:40:31,014 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 19:40:31,025 INFO L204 MainTranslator]: Completed translation [2025-03-17 19:40:31,025 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:40:31 WrapperNode [2025-03-17 19:40:31,025 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 19:40:31,026 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 19:40:31,026 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 19:40:31,026 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 19:40:31,030 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:40:31" (1/1) ... [2025-03-17 19:40:31,038 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:40:31" (1/1) ... [2025-03-17 19:40:31,067 INFO L138 Inliner]: procedures = 21, calls = 26, calls flagged for inlining = 16, calls inlined = 30, statements flattened = 365 [2025-03-17 19:40:31,067 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 19:40:31,067 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 19:40:31,068 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 19:40:31,068 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 19:40:31,073 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:40:31" (1/1) ... [2025-03-17 19:40:31,073 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:40:31" (1/1) ... [2025-03-17 19:40:31,080 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:40:31" (1/1) ... [2025-03-17 19:40:31,093 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 19:40:31,094 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:40:31" (1/1) ... [2025-03-17 19:40:31,094 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:40:31" (1/1) ... [2025-03-17 19:40:31,099 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:40:31" (1/1) ... [2025-03-17 19:40:31,101 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:40:31" (1/1) ... [2025-03-17 19:40:31,102 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:40:31" (1/1) ... [2025-03-17 19:40:31,102 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:40:31" (1/1) ... [2025-03-17 19:40:31,109 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 19:40:31,109 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 19:40:31,109 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 19:40:31,109 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 19:40:31,110 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:40:31" (1/1) ... [2025-03-17 19:40:31,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 19:40:31,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:40:31,135 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-17 19:40:31,140 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-17 19:40:31,155 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 19:40:31,156 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-17 19:40:31,156 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-17 19:40:31,156 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-17 19:40:31,156 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-17 19:40:31,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 19:40:31,156 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-17 19:40:31,156 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-17 19:40:31,156 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 19:40:31,156 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 19:40:31,158 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 19:40:31,250 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 19:40:31,252 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 19:40:31,741 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 19:40:31,741 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 19:40:32,605 WARN L170 LargeBlockEncoding]: Complex 2:23 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-03-17 19:40:32,942 WARN L170 LargeBlockEncoding]: Complex 2:23 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-03-17 19:40:33,230 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 19:40:33,232 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 19:40:33,232 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:40:33 BoogieIcfgContainer [2025-03-17 19:40:33,233 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 19:40:33,235 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 19:40:33,235 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 19:40:33,238 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 19:40:33,238 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 07:40:30" (1/3) ... [2025-03-17 19:40:33,239 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@270ab1c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 07:40:33, skipping insertion in model container [2025-03-17 19:40:33,240 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:40:31" (2/3) ... [2025-03-17 19:40:33,240 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@270ab1c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 07:40:33, skipping insertion in model container [2025-03-17 19:40:33,240 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:40:33" (3/3) ... [2025-03-17 19:40:33,241 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-collitem-symm.wvr.c [2025-03-17 19:40:33,255 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 19:40:33,256 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-collitem-symm.wvr.c that has 3 procedures, 65 locations, 1 initial locations, 0 loop locations, and 48 error locations. [2025-03-17 19:40:33,257 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 19:40:34,143 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-17 19:40:34,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 110 transitions, 234 flow [2025-03-17 19:40:34,266 INFO L124 PetriNetUnfolderBase]: 46/108 cut-off events. [2025-03-17 19:40:34,268 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 19:40:34,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 108 events. 46/108 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 433 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 105. Up to 2 conditions per place. [2025-03-17 19:40:34,275 INFO L82 GeneralOperation]: Start removeDead. Operand has 71 places, 110 transitions, 234 flow [2025-03-17 19:40:34,281 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 67 places, 106 transitions, 221 flow [2025-03-17 19:40:34,289 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 19:40:34,300 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;@3fc79cc5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 19:40:34,301 INFO L334 AbstractCegarLoop]: Starting to check reachability of 98 error locations. [2025-03-17 19:40:34,305 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 19:40:34,305 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-03-17 19:40:34,305 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 19:40:34,305 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:40:34,306 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-17 19:40:34,306 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2025-03-17 19:40:34,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:40:34,313 INFO L85 PathProgramCache]: Analyzing trace with hash 43907634, now seen corresponding path program 1 times [2025-03-17 19:40:34,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:40:34,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219973786] [2025-03-17 19:40:34,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:40:34,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:40:34,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:40:34,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:40:34,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:40:34,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:40:34,573 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-17 19:40:34,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:40:34,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219973786] [2025-03-17 19:40:34,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219973786] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:40:34,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:40:34,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 19:40:34,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512981950] [2025-03-17 19:40:34,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:40:34,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 19:40:34,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:40:34,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 19:40:34,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 19:40:34,607 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 110 [2025-03-17 19:40:34,609 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 106 transitions, 221 flow. Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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-17 19:40:34,609 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:40:34,609 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 110 [2025-03-17 19:40:34,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:40:36,027 INFO L124 PetriNetUnfolderBase]: 2168/2967 cut-off events. [2025-03-17 19:40:36,027 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-03-17 19:40:36,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5978 conditions, 2967 events. 2168/2967 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 614. Compared 16033 event pairs, 1062 based on Foata normal form. 0/596 useless extension candidates. Maximal degree in co-relation 5847. Up to 2949 conditions per place. [2025-03-17 19:40:36,042 INFO L140 encePairwiseOnDemand]: 76/110 looper letters, 70 selfloop transitions, 0 changer transitions 0/72 dead transitions. [2025-03-17 19:40:36,043 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 72 transitions, 293 flow [2025-03-17 19:40:36,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 19:40:36,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-17 19:40:36,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 112 transitions. [2025-03-17 19:40:36,052 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.509090909090909 [2025-03-17 19:40:36,053 INFO L175 Difference]: Start difference. First operand has 67 places, 106 transitions, 221 flow. Second operand 2 states and 112 transitions. [2025-03-17 19:40:36,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 72 transitions, 293 flow [2025-03-17 19:40:36,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 72 transitions, 288 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-17 19:40:36,065 INFO L231 Difference]: Finished difference. Result has 49 places, 72 transitions, 148 flow [2025-03-17 19:40:36,067 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=148, PETRI_PLACES=49, PETRI_TRANSITIONS=72} [2025-03-17 19:40:36,071 INFO L279 CegarLoopForPetriNet]: 67 programPoint places, -18 predicate places. [2025-03-17 19:40:36,072 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 72 transitions, 148 flow [2025-03-17 19:40:36,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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-17 19:40:36,072 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:40:36,072 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-17 19:40:36,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 19:40:36,073 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2025-03-17 19:40:36,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:40:36,074 INFO L85 PathProgramCache]: Analyzing trace with hash 43907635, now seen corresponding path program 1 times [2025-03-17 19:40:36,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:40:36,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846180649] [2025-03-17 19:40:36,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:40:36,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:40:36,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:40:36,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:40:36,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:40:36,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:40:36,264 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-17 19:40:36,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:40:36,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846180649] [2025-03-17 19:40:36,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846180649] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:40:36,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:40:36,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 19:40:36,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118511156] [2025-03-17 19:40:36,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:40:36,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 19:40:36,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:40:36,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:40:36,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:40:36,266 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 110 [2025-03-17 19:40:36,267 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 72 transitions, 148 flow. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-17 19:40:36,267 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:40:36,267 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 110 [2025-03-17 19:40:36,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:40:37,336 INFO L124 PetriNetUnfolderBase]: 1927/2648 cut-off events. [2025-03-17 19:40:37,337 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 19:40:37,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5318 conditions, 2648 events. 1927/2648 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 546. Compared 14160 event pairs, 952 based on Foata normal form. 0/547 useless extension candidates. Maximal degree in co-relation 5315. Up to 2630 conditions per place. [2025-03-17 19:40:37,347 INFO L140 encePairwiseOnDemand]: 105/110 looper letters, 65 selfloop transitions, 1 changer transitions 0/68 dead transitions. [2025-03-17 19:40:37,347 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 68 transitions, 272 flow [2025-03-17 19:40:37,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:40:37,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 19:40:37,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2025-03-17 19:40:37,349 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.24848484848484848 [2025-03-17 19:40:37,349 INFO L175 Difference]: Start difference. First operand has 49 places, 72 transitions, 148 flow. Second operand 3 states and 82 transitions. [2025-03-17 19:40:37,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 68 transitions, 272 flow [2025-03-17 19:40:37,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 68 transitions, 272 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 19:40:37,351 INFO L231 Difference]: Finished difference. Result has 49 places, 68 transitions, 142 flow [2025-03-17 19:40:37,351 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=142, PETRI_PLACES=49, PETRI_TRANSITIONS=68} [2025-03-17 19:40:37,352 INFO L279 CegarLoopForPetriNet]: 67 programPoint places, -18 predicate places. [2025-03-17 19:40:37,352 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 68 transitions, 142 flow [2025-03-17 19:40:37,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-17 19:40:37,352 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:40:37,353 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-17 19:40:37,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 19:40:37,353 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2025-03-17 19:40:37,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:40:37,353 INFO L85 PathProgramCache]: Analyzing trace with hash 43907636, now seen corresponding path program 1 times [2025-03-17 19:40:37,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:40:37,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153960790] [2025-03-17 19:40:37,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:40:37,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:40:37,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:40:37,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:40:37,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:40:37,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:40:37,456 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-17 19:40:37,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:40:37,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153960790] [2025-03-17 19:40:37,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153960790] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:40:37,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:40:37,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 19:40:37,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516885044] [2025-03-17 19:40:37,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:40:37,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 19:40:37,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:40:37,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:40:37,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:40:37,458 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 110 [2025-03-17 19:40:37,459 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 68 transitions, 142 flow. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-17 19:40:37,459 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:40:37,459 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 110 [2025-03-17 19:40:37,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:40:38,167 INFO L124 PetriNetUnfolderBase]: 1700/2347 cut-off events. [2025-03-17 19:40:38,167 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 19:40:38,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4717 conditions, 2347 events. 1700/2347 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 482. Compared 12346 event pairs, 848 based on Foata normal form. 0/500 useless extension candidates. Maximal degree in co-relation 4713. Up to 2330 conditions per place. [2025-03-17 19:40:38,175 INFO L140 encePairwiseOnDemand]: 105/110 looper letters, 61 selfloop transitions, 1 changer transitions 0/64 dead transitions. [2025-03-17 19:40:38,175 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 64 transitions, 258 flow [2025-03-17 19:40:38,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:40:38,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 19:40:38,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2025-03-17 19:40:38,177 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.23636363636363636 [2025-03-17 19:40:38,177 INFO L175 Difference]: Start difference. First operand has 49 places, 68 transitions, 142 flow. Second operand 3 states and 78 transitions. [2025-03-17 19:40:38,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 64 transitions, 258 flow [2025-03-17 19:40:38,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 64 transitions, 257 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 19:40:38,178 INFO L231 Difference]: Finished difference. Result has 48 places, 64 transitions, 135 flow [2025-03-17 19:40:38,178 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=135, PETRI_PLACES=48, PETRI_TRANSITIONS=64} [2025-03-17 19:40:38,178 INFO L279 CegarLoopForPetriNet]: 67 programPoint places, -19 predicate places. [2025-03-17 19:40:38,178 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 64 transitions, 135 flow [2025-03-17 19:40:38,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-17 19:40:38,179 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:40:38,179 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-17 19:40:38,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 19:40:38,179 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2025-03-17 19:40:38,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:40:38,179 INFO L85 PathProgramCache]: Analyzing trace with hash 43907638, now seen corresponding path program 1 times [2025-03-17 19:40:38,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:40:38,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849498290] [2025-03-17 19:40:38,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:40:38,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:40:38,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:40:38,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:40:38,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:40:38,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:40:38,253 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-17 19:40:38,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:40:38,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849498290] [2025-03-17 19:40:38,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849498290] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:40:38,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:40:38,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 19:40:38,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952771943] [2025-03-17 19:40:38,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:40:38,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 19:40:38,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:40:38,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:40:38,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:40:38,254 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 110 [2025-03-17 19:40:38,254 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 64 transitions, 135 flow. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-17 19:40:38,254 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:40:38,255 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 110 [2025-03-17 19:40:38,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:40:38,920 INFO L124 PetriNetUnfolderBase]: 1487/2064 cut-off events. [2025-03-17 19:40:38,920 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 19:40:38,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4151 conditions, 2064 events. 1487/2064 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 422. Compared 10739 event pairs, 750 based on Foata normal form. 0/455 useless extension candidates. Maximal degree in co-relation 4147. Up to 2048 conditions per place. [2025-03-17 19:40:38,929 INFO L140 encePairwiseOnDemand]: 105/110 looper letters, 57 selfloop transitions, 1 changer transitions 0/60 dead transitions. [2025-03-17 19:40:38,930 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 60 transitions, 243 flow [2025-03-17 19:40:38,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:40:38,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 19:40:38,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2025-03-17 19:40:38,931 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.22424242424242424 [2025-03-17 19:40:38,932 INFO L175 Difference]: Start difference. First operand has 48 places, 64 transitions, 135 flow. Second operand 3 states and 74 transitions. [2025-03-17 19:40:38,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 60 transitions, 243 flow [2025-03-17 19:40:38,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 60 transitions, 242 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 19:40:38,934 INFO L231 Difference]: Finished difference. Result has 47 places, 60 transitions, 128 flow [2025-03-17 19:40:38,934 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=128, PETRI_PLACES=47, PETRI_TRANSITIONS=60} [2025-03-17 19:40:38,935 INFO L279 CegarLoopForPetriNet]: 67 programPoint places, -20 predicate places. [2025-03-17 19:40:38,935 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 60 transitions, 128 flow [2025-03-17 19:40:38,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-17 19:40:38,935 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:40:38,936 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-17 19:40:38,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 19:40:38,936 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2025-03-17 19:40:38,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:40:38,936 INFO L85 PathProgramCache]: Analyzing trace with hash 43907639, now seen corresponding path program 1 times [2025-03-17 19:40:38,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:40:38,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701256710] [2025-03-17 19:40:38,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:40:38,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:40:38,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:40:38,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:40:38,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:40:38,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:40:39,020 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-17 19:40:39,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:40:39,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701256710] [2025-03-17 19:40:39,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701256710] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:40:39,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:40:39,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 19:40:39,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988800460] [2025-03-17 19:40:39,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:40:39,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 19:40:39,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:40:39,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:40:39,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:40:39,022 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 110 [2025-03-17 19:40:39,022 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 60 transitions, 128 flow. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-17 19:40:39,022 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:40:39,022 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 110 [2025-03-17 19:40:39,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:40:39,601 INFO L124 PetriNetUnfolderBase]: 1288/1799 cut-off events. [2025-03-17 19:40:39,601 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 19:40:39,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3621 conditions, 1799 events. 1288/1799 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 366. Compared 9314 event pairs, 658 based on Foata normal form. 0/412 useless extension candidates. Maximal degree in co-relation 3617. Up to 1784 conditions per place. [2025-03-17 19:40:39,608 INFO L140 encePairwiseOnDemand]: 105/110 looper letters, 53 selfloop transitions, 1 changer transitions 0/56 dead transitions. [2025-03-17 19:40:39,608 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 56 transitions, 228 flow [2025-03-17 19:40:39,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:40:39,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 19:40:39,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2025-03-17 19:40:39,609 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.21212121212121213 [2025-03-17 19:40:39,609 INFO L175 Difference]: Start difference. First operand has 47 places, 60 transitions, 128 flow. Second operand 3 states and 70 transitions. [2025-03-17 19:40:39,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 56 transitions, 228 flow [2025-03-17 19:40:39,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 56 transitions, 227 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 19:40:39,610 INFO L231 Difference]: Finished difference. Result has 46 places, 56 transitions, 121 flow [2025-03-17 19:40:39,610 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=121, PETRI_PLACES=46, PETRI_TRANSITIONS=56} [2025-03-17 19:40:39,610 INFO L279 CegarLoopForPetriNet]: 67 programPoint places, -21 predicate places. [2025-03-17 19:40:39,610 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 56 transitions, 121 flow [2025-03-17 19:40:39,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-17 19:40:39,611 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:40:39,611 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-17 19:40:39,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 19:40:39,611 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2025-03-17 19:40:39,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:40:39,611 INFO L85 PathProgramCache]: Analyzing trace with hash 43907641, now seen corresponding path program 1 times [2025-03-17 19:40:39,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:40:39,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679339321] [2025-03-17 19:40:39,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:40:39,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:40:39,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:40:39,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:40:39,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:40:39,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:40:39,725 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-17 19:40:39,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:40:39,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679339321] [2025-03-17 19:40:39,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679339321] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:40:39,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:40:39,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 19:40:39,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342368009] [2025-03-17 19:40:39,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:40:39,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 19:40:39,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:40:39,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:40:39,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:40:39,727 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 110 [2025-03-17 19:40:39,727 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 56 transitions, 121 flow. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-17 19:40:39,727 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:40:39,727 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 110 [2025-03-17 19:40:39,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:40:40,082 INFO L124 PetriNetUnfolderBase]: 1103/1552 cut-off events. [2025-03-17 19:40:40,083 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 19:40:40,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3127 conditions, 1552 events. 1103/1552 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 314. Compared 7924 event pairs, 572 based on Foata normal form. 0/371 useless extension candidates. Maximal degree in co-relation 3123. Up to 1538 conditions per place. [2025-03-17 19:40:40,088 INFO L140 encePairwiseOnDemand]: 105/110 looper letters, 49 selfloop transitions, 1 changer transitions 0/52 dead transitions. [2025-03-17 19:40:40,088 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 52 transitions, 213 flow [2025-03-17 19:40:40,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:40:40,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 19:40:40,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2025-03-17 19:40:40,089 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2 [2025-03-17 19:40:40,089 INFO L175 Difference]: Start difference. First operand has 46 places, 56 transitions, 121 flow. Second operand 3 states and 66 transitions. [2025-03-17 19:40:40,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 52 transitions, 213 flow [2025-03-17 19:40:40,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 52 transitions, 212 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 19:40:40,090 INFO L231 Difference]: Finished difference. Result has 45 places, 52 transitions, 114 flow [2025-03-17 19:40:40,090 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=114, PETRI_PLACES=45, PETRI_TRANSITIONS=52} [2025-03-17 19:40:40,090 INFO L279 CegarLoopForPetriNet]: 67 programPoint places, -22 predicate places. [2025-03-17 19:40:40,090 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 52 transitions, 114 flow [2025-03-17 19:40:40,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-17 19:40:40,090 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:40:40,091 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-17 19:40:40,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 19:40:40,091 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2025-03-17 19:40:40,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:40:40,091 INFO L85 PathProgramCache]: Analyzing trace with hash 43907642, now seen corresponding path program 1 times [2025-03-17 19:40:40,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:40:40,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875577093] [2025-03-17 19:40:40,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:40:40,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:40:40,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:40:40,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:40:40,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:40:40,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:40:40,175 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-17 19:40:40,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:40:40,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875577093] [2025-03-17 19:40:40,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875577093] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:40:40,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:40:40,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 19:40:40,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554572248] [2025-03-17 19:40:40,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:40:40,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 19:40:40,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:40:40,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:40:40,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:40:40,177 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 110 [2025-03-17 19:40:40,177 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 52 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-17 19:40:40,177 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:40:40,177 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 110 [2025-03-17 19:40:40,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:40:40,496 INFO L124 PetriNetUnfolderBase]: 932/1323 cut-off events. [2025-03-17 19:40:40,497 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 19:40:40,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2669 conditions, 1323 events. 932/1323 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 6691 event pairs, 492 based on Foata normal form. 0/332 useless extension candidates. Maximal degree in co-relation 2665. Up to 1310 conditions per place. [2025-03-17 19:40:40,500 INFO L140 encePairwiseOnDemand]: 105/110 looper letters, 45 selfloop transitions, 1 changer transitions 0/48 dead transitions. [2025-03-17 19:40:40,500 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 48 transitions, 198 flow [2025-03-17 19:40:40,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:40:40,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 19:40:40,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2025-03-17 19:40:40,501 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.18787878787878787 [2025-03-17 19:40:40,501 INFO L175 Difference]: Start difference. First operand has 45 places, 52 transitions, 114 flow. Second operand 3 states and 62 transitions. [2025-03-17 19:40:40,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 48 transitions, 198 flow [2025-03-17 19:40:40,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 48 transitions, 197 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 19:40:40,502 INFO L231 Difference]: Finished difference. Result has 44 places, 48 transitions, 107 flow [2025-03-17 19:40:40,502 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=107, PETRI_PLACES=44, PETRI_TRANSITIONS=48} [2025-03-17 19:40:40,502 INFO L279 CegarLoopForPetriNet]: 67 programPoint places, -23 predicate places. [2025-03-17 19:40:40,502 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 48 transitions, 107 flow [2025-03-17 19:40:40,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-17 19:40:40,502 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:40:40,502 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-17 19:40:40,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 19:40:40,503 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err18ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2025-03-17 19:40:40,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:40:40,503 INFO L85 PathProgramCache]: Analyzing trace with hash 43907601, now seen corresponding path program 1 times [2025-03-17 19:40:40,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:40:40,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422130532] [2025-03-17 19:40:40,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:40:40,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:40:40,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:40:40,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:40:40,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:40:40,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:40:40,546 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-17 19:40:40,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:40:40,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422130532] [2025-03-17 19:40:40,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422130532] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:40:40,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:40:40,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 19:40:40,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091461201] [2025-03-17 19:40:40,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:40:40,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 19:40:40,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:40:40,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:40:40,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:40:40,549 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 110 [2025-03-17 19:40:40,549 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 48 transitions, 107 flow. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-17 19:40:40,549 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:40:40,549 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 110 [2025-03-17 19:40:40,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:40:40,795 INFO L124 PetriNetUnfolderBase]: 800/1137 cut-off events. [2025-03-17 19:40:40,795 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 19:40:40,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2297 conditions, 1137 events. 800/1137 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 5523 event pairs, 418 based on Foata normal form. 0/295 useless extension candidates. Maximal degree in co-relation 2293. Up to 1125 conditions per place. [2025-03-17 19:40:40,798 INFO L140 encePairwiseOnDemand]: 106/110 looper letters, 42 selfloop transitions, 1 changer transitions 0/45 dead transitions. [2025-03-17 19:40:40,798 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 45 transitions, 187 flow [2025-03-17 19:40:40,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:40:40,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 19:40:40,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2025-03-17 19:40:40,799 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.17575757575757575 [2025-03-17 19:40:40,799 INFO L175 Difference]: Start difference. First operand has 44 places, 48 transitions, 107 flow. Second operand 3 states and 58 transitions. [2025-03-17 19:40:40,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 45 transitions, 187 flow [2025-03-17 19:40:40,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 45 transitions, 186 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 19:40:40,800 INFO L231 Difference]: Finished difference. Result has 43 places, 45 transitions, 102 flow [2025-03-17 19:40:40,800 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=43, PETRI_TRANSITIONS=45} [2025-03-17 19:40:40,801 INFO L279 CegarLoopForPetriNet]: 67 programPoint places, -24 predicate places. [2025-03-17 19:40:40,801 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 45 transitions, 102 flow [2025-03-17 19:40:40,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-17 19:40:40,801 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:40:40,801 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-17 19:40:40,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 19:40:40,801 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err16ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2025-03-17 19:40:40,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:40:40,805 INFO L85 PathProgramCache]: Analyzing trace with hash 43907603, now seen corresponding path program 1 times [2025-03-17 19:40:40,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:40:40,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98383703] [2025-03-17 19:40:40,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:40:40,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:40:40,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:40:40,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:40:40,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:40:40,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:40:40,828 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-17 19:40:40,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:40:40,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98383703] [2025-03-17 19:40:40,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98383703] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:40:40,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:40:40,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 19:40:40,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300753278] [2025-03-17 19:40:40,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:40:40,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 19:40:40,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:40:40,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:40:40,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:40:40,830 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 110 [2025-03-17 19:40:40,830 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 45 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-17 19:40:40,830 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:40:40,830 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 110 [2025-03-17 19:40:40,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:40:41,065 INFO L124 PetriNetUnfolderBase]: 655/942 cut-off events. [2025-03-17 19:40:41,065 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 19:40:41,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1907 conditions, 942 events. 655/942 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 4569 event pairs, 350 based on Foata normal form. 0/260 useless extension candidates. Maximal degree in co-relation 1903. Up to 931 conditions per place. [2025-03-17 19:40:41,069 INFO L140 encePairwiseOnDemand]: 105/110 looper letters, 38 selfloop transitions, 1 changer transitions 0/41 dead transitions. [2025-03-17 19:40:41,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 41 transitions, 172 flow [2025-03-17 19:40:41,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:40:41,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 19:40:41,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2025-03-17 19:40:41,070 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.16666666666666666 [2025-03-17 19:40:41,070 INFO L175 Difference]: Start difference. First operand has 43 places, 45 transitions, 102 flow. Second operand 3 states and 55 transitions. [2025-03-17 19:40:41,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 41 transitions, 172 flow [2025-03-17 19:40:41,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 41 transitions, 171 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 19:40:41,072 INFO L231 Difference]: Finished difference. Result has 42 places, 41 transitions, 95 flow [2025-03-17 19:40:41,072 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=95, PETRI_PLACES=42, PETRI_TRANSITIONS=41} [2025-03-17 19:40:41,072 INFO L279 CegarLoopForPetriNet]: 67 programPoint places, -25 predicate places. [2025-03-17 19:40:41,072 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 41 transitions, 95 flow [2025-03-17 19:40:41,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-17 19:40:41,073 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:40:41,073 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-17 19:40:41,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 19:40:41,073 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err15ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2025-03-17 19:40:41,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:40:41,073 INFO L85 PathProgramCache]: Analyzing trace with hash 43907604, now seen corresponding path program 1 times [2025-03-17 19:40:41,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:40:41,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724401874] [2025-03-17 19:40:41,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:40:41,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:40:41,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:40:41,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:40:41,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:40:41,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:40:41,111 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-17 19:40:41,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:40:41,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724401874] [2025-03-17 19:40:41,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724401874] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:40:41,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:40:41,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 19:40:41,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58947020] [2025-03-17 19:40:41,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:40:41,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 19:40:41,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:40:41,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:40:41,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:40:41,113 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 110 [2025-03-17 19:40:41,113 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 41 transitions, 95 flow. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-17 19:40:41,113 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:40:41,113 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 110 [2025-03-17 19:40:41,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:40:41,305 INFO L124 PetriNetUnfolderBase]: 524/765 cut-off events. [2025-03-17 19:40:41,305 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 19:40:41,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1553 conditions, 765 events. 524/765 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 3650 event pairs, 288 based on Foata normal form. 0/227 useless extension candidates. Maximal degree in co-relation 1549. Up to 755 conditions per place. [2025-03-17 19:40:41,307 INFO L140 encePairwiseOnDemand]: 105/110 looper letters, 34 selfloop transitions, 1 changer transitions 0/37 dead transitions. [2025-03-17 19:40:41,307 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 37 transitions, 157 flow [2025-03-17 19:40:41,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:40:41,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 19:40:41,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2025-03-17 19:40:41,308 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.15454545454545454 [2025-03-17 19:40:41,308 INFO L175 Difference]: Start difference. First operand has 42 places, 41 transitions, 95 flow. Second operand 3 states and 51 transitions. [2025-03-17 19:40:41,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 37 transitions, 157 flow [2025-03-17 19:40:41,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 37 transitions, 156 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 19:40:41,308 INFO L231 Difference]: Finished difference. Result has 41 places, 37 transitions, 88 flow [2025-03-17 19:40:41,308 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=41, PETRI_TRANSITIONS=37} [2025-03-17 19:40:41,309 INFO L279 CegarLoopForPetriNet]: 67 programPoint places, -26 predicate places. [2025-03-17 19:40:41,309 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 37 transitions, 88 flow [2025-03-17 19:40:41,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-17 19:40:41,309 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:40:41,309 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-17 19:40:41,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 19:40:41,309 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2025-03-17 19:40:41,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:40:41,309 INFO L85 PathProgramCache]: Analyzing trace with hash 43907606, now seen corresponding path program 1 times [2025-03-17 19:40:41,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:40:41,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291940316] [2025-03-17 19:40:41,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:40:41,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:40:41,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:40:41,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:40:41,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:40:41,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:40:41,356 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-17 19:40:41,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:40:41,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291940316] [2025-03-17 19:40:41,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291940316] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:40:41,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:40:41,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 19:40:41,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844178251] [2025-03-17 19:40:41,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:40:41,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 19:40:41,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:40:41,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:40:41,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:40:41,358 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 110 [2025-03-17 19:40:41,358 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 37 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-17 19:40:41,358 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:40:41,358 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 110 [2025-03-17 19:40:41,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:40:41,546 INFO L124 PetriNetUnfolderBase]: 407/606 cut-off events. [2025-03-17 19:40:41,547 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 19:40:41,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1235 conditions, 606 events. 407/606 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 2812 event pairs, 232 based on Foata normal form. 0/196 useless extension candidates. Maximal degree in co-relation 1231. Up to 597 conditions per place. [2025-03-17 19:40:41,549 INFO L140 encePairwiseOnDemand]: 105/110 looper letters, 30 selfloop transitions, 1 changer transitions 0/33 dead transitions. [2025-03-17 19:40:41,549 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 33 transitions, 142 flow [2025-03-17 19:40:41,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:40:41,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 19:40:41,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2025-03-17 19:40:41,550 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.14242424242424243 [2025-03-17 19:40:41,550 INFO L175 Difference]: Start difference. First operand has 41 places, 37 transitions, 88 flow. Second operand 3 states and 47 transitions. [2025-03-17 19:40:41,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 33 transitions, 142 flow [2025-03-17 19:40:41,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 33 transitions, 141 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 19:40:41,551 INFO L231 Difference]: Finished difference. Result has 40 places, 33 transitions, 81 flow [2025-03-17 19:40:41,551 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=81, PETRI_PLACES=40, PETRI_TRANSITIONS=33} [2025-03-17 19:40:41,551 INFO L279 CegarLoopForPetriNet]: 67 programPoint places, -27 predicate places. [2025-03-17 19:40:41,551 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 33 transitions, 81 flow [2025-03-17 19:40:41,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-17 19:40:41,552 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:40:41,552 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-17 19:40:41,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 19:40:41,552 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2025-03-17 19:40:41,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:40:41,552 INFO L85 PathProgramCache]: Analyzing trace with hash 43907607, now seen corresponding path program 1 times [2025-03-17 19:40:41,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:40:41,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322444667] [2025-03-17 19:40:41,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:40:41,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:40:41,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:40:41,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:40:41,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:40:41,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:40:41,597 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-17 19:40:41,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:40:41,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322444667] [2025-03-17 19:40:41,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322444667] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:40:41,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:40:41,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 19:40:41,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946877923] [2025-03-17 19:40:41,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:40:41,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 19:40:41,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:40:41,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:40:41,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:40:41,599 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 110 [2025-03-17 19:40:41,599 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 33 transitions, 81 flow. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-17 19:40:41,599 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:40:41,599 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 110 [2025-03-17 19:40:41,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:40:41,736 INFO L124 PetriNetUnfolderBase]: 304/465 cut-off events. [2025-03-17 19:40:41,736 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 19:40:41,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 953 conditions, 465 events. 304/465 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 2109 event pairs, 182 based on Foata normal form. 0/167 useless extension candidates. Maximal degree in co-relation 949. Up to 457 conditions per place. [2025-03-17 19:40:41,738 INFO L140 encePairwiseOnDemand]: 105/110 looper letters, 26 selfloop transitions, 1 changer transitions 0/29 dead transitions. [2025-03-17 19:40:41,738 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 29 transitions, 127 flow [2025-03-17 19:40:41,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:40:41,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 19:40:41,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2025-03-17 19:40:41,739 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.1303030303030303 [2025-03-17 19:40:41,739 INFO L175 Difference]: Start difference. First operand has 40 places, 33 transitions, 81 flow. Second operand 3 states and 43 transitions. [2025-03-17 19:40:41,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 29 transitions, 127 flow [2025-03-17 19:40:41,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 29 transitions, 126 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 19:40:41,739 INFO L231 Difference]: Finished difference. Result has 39 places, 29 transitions, 74 flow [2025-03-17 19:40:41,739 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=39, PETRI_TRANSITIONS=29} [2025-03-17 19:40:41,740 INFO L279 CegarLoopForPetriNet]: 67 programPoint places, -28 predicate places. [2025-03-17 19:40:41,740 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 29 transitions, 74 flow [2025-03-17 19:40:41,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-17 19:40:41,740 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:40:41,740 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-17 19:40:41,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 19:40:41,740 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2025-03-17 19:40:41,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:40:41,740 INFO L85 PathProgramCache]: Analyzing trace with hash 43907609, now seen corresponding path program 1 times [2025-03-17 19:40:41,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:40:41,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883195437] [2025-03-17 19:40:41,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:40:41,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:40:41,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:40:41,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:40:41,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:40:41,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:40:41,768 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-17 19:40:41,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:40:41,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883195437] [2025-03-17 19:40:41,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883195437] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:40:41,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:40:41,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 19:40:41,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959738139] [2025-03-17 19:40:41,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:40:41,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 19:40:41,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:40:41,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:40:41,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:40:41,770 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 110 [2025-03-17 19:40:41,770 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 29 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-17 19:40:41,770 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:40:41,770 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 110 [2025-03-17 19:40:41,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:40:41,892 INFO L124 PetriNetUnfolderBase]: 215/342 cut-off events. [2025-03-17 19:40:41,892 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 19:40:41,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 707 conditions, 342 events. 215/342 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 1500 event pairs, 138 based on Foata normal form. 0/140 useless extension candidates. Maximal degree in co-relation 703. Up to 335 conditions per place. [2025-03-17 19:40:41,893 INFO L140 encePairwiseOnDemand]: 105/110 looper letters, 22 selfloop transitions, 1 changer transitions 0/25 dead transitions. [2025-03-17 19:40:41,893 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 25 transitions, 112 flow [2025-03-17 19:40:41,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:40:41,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 19:40:41,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2025-03-17 19:40:41,894 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.11818181818181818 [2025-03-17 19:40:41,894 INFO L175 Difference]: Start difference. First operand has 39 places, 29 transitions, 74 flow. Second operand 3 states and 39 transitions. [2025-03-17 19:40:41,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 25 transitions, 112 flow [2025-03-17 19:40:41,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 25 transitions, 111 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 19:40:41,895 INFO L231 Difference]: Finished difference. Result has 38 places, 25 transitions, 67 flow [2025-03-17 19:40:41,895 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=65, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=67, PETRI_PLACES=38, PETRI_TRANSITIONS=25} [2025-03-17 19:40:41,895 INFO L279 CegarLoopForPetriNet]: 67 programPoint places, -29 predicate places. [2025-03-17 19:40:41,895 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 25 transitions, 67 flow [2025-03-17 19:40:41,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-17 19:40:41,895 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:40:41,896 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-17 19:40:41,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 19:40:41,896 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2025-03-17 19:40:41,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:40:41,896 INFO L85 PathProgramCache]: Analyzing trace with hash 43907610, now seen corresponding path program 1 times [2025-03-17 19:40:41,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:40:41,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956958933] [2025-03-17 19:40:41,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:40:41,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:40:41,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:40:41,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:40:41,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:40:41,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:40:41,927 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-17 19:40:41,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:40:41,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956958933] [2025-03-17 19:40:41,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956958933] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:40:41,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:40:41,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 19:40:41,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453772404] [2025-03-17 19:40:41,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:40:41,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 19:40:41,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:40:41,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:40:41,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:40:41,929 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 110 [2025-03-17 19:40:41,929 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 25 transitions, 67 flow. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-17 19:40:41,929 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:40:41,929 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 110 [2025-03-17 19:40:41,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:40:42,007 INFO L124 PetriNetUnfolderBase]: 140/237 cut-off events. [2025-03-17 19:40:42,007 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 19:40:42,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 497 conditions, 237 events. 140/237 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 1020 event pairs, 100 based on Foata normal form. 0/115 useless extension candidates. Maximal degree in co-relation 493. Up to 231 conditions per place. [2025-03-17 19:40:42,008 INFO L140 encePairwiseOnDemand]: 105/110 looper letters, 18 selfloop transitions, 1 changer transitions 0/21 dead transitions. [2025-03-17 19:40:42,008 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 21 transitions, 97 flow [2025-03-17 19:40:42,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:40:42,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 19:40:42,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2025-03-17 19:40:42,009 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.10606060606060606 [2025-03-17 19:40:42,009 INFO L175 Difference]: Start difference. First operand has 38 places, 25 transitions, 67 flow. Second operand 3 states and 35 transitions. [2025-03-17 19:40:42,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 21 transitions, 97 flow [2025-03-17 19:40:42,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 21 transitions, 96 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 19:40:42,010 INFO L231 Difference]: Finished difference. Result has 37 places, 21 transitions, 60 flow [2025-03-17 19:40:42,010 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=37, PETRI_TRANSITIONS=21} [2025-03-17 19:40:42,010 INFO L279 CegarLoopForPetriNet]: 67 programPoint places, -30 predicate places. [2025-03-17 19:40:42,010 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 21 transitions, 60 flow [2025-03-17 19:40:42,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-17 19:40:42,010 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:40:42,010 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-17 19:40:42,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 19:40:42,010 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2025-03-17 19:40:42,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:40:42,011 INFO L85 PathProgramCache]: Analyzing trace with hash 43907597, now seen corresponding path program 1 times [2025-03-17 19:40:42,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:40:42,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142507434] [2025-03-17 19:40:42,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:40:42,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:40:42,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:40:42,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:40:42,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:40:42,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:40:42,035 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-17 19:40:42,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:40:42,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142507434] [2025-03-17 19:40:42,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142507434] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:40:42,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:40:42,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 19:40:42,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937749921] [2025-03-17 19:40:42,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:40:42,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 19:40:42,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:40:42,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:40:42,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:40:42,036 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 110 [2025-03-17 19:40:42,036 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 21 transitions, 60 flow. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-17 19:40:42,036 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:40:42,036 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 110 [2025-03-17 19:40:42,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:40:42,097 INFO L124 PetriNetUnfolderBase]: 91/162 cut-off events. [2025-03-17 19:40:42,098 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 19:40:42,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 347 conditions, 162 events. 91/162 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 645 event pairs, 68 based on Foata normal form. 0/92 useless extension candidates. Maximal degree in co-relation 343. Up to 157 conditions per place. [2025-03-17 19:40:42,098 INFO L140 encePairwiseOnDemand]: 106/110 looper letters, 15 selfloop transitions, 1 changer transitions 0/18 dead transitions. [2025-03-17 19:40:42,098 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 18 transitions, 86 flow [2025-03-17 19:40:42,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:40:42,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 19:40:42,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 31 transitions. [2025-03-17 19:40:42,099 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.09393939393939393 [2025-03-17 19:40:42,099 INFO L175 Difference]: Start difference. First operand has 37 places, 21 transitions, 60 flow. Second operand 3 states and 31 transitions. [2025-03-17 19:40:42,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 18 transitions, 86 flow [2025-03-17 19:40:42,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 18 transitions, 85 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 19:40:42,100 INFO L231 Difference]: Finished difference. Result has 36 places, 18 transitions, 55 flow [2025-03-17 19:40:42,100 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=53, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=55, PETRI_PLACES=36, PETRI_TRANSITIONS=18} [2025-03-17 19:40:42,100 INFO L279 CegarLoopForPetriNet]: 67 programPoint places, -31 predicate places. [2025-03-17 19:40:42,100 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 18 transitions, 55 flow [2025-03-17 19:40:42,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-17 19:40:42,100 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:40:42,100 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-17 19:40:42,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 19:40:42,100 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2025-03-17 19:40:42,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:40:42,101 INFO L85 PathProgramCache]: Analyzing trace with hash 43907598, now seen corresponding path program 1 times [2025-03-17 19:40:42,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:40:42,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589733701] [2025-03-17 19:40:42,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:40:42,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:40:42,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:40:42,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:40:42,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:40:42,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:40:42,129 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-17 19:40:42,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:40:42,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589733701] [2025-03-17 19:40:42,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589733701] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:40:42,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:40:42,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 19:40:42,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833551405] [2025-03-17 19:40:42,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:40:42,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 19:40:42,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:40:42,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:40:42,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:40:42,131 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 110 [2025-03-17 19:40:42,131 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 18 transitions, 55 flow. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-17 19:40:42,131 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:40:42,131 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 110 [2025-03-17 19:40:42,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:40:42,182 INFO L124 PetriNetUnfolderBase]: 61/110 cut-off events. [2025-03-17 19:40:42,182 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 19:40:42,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 243 conditions, 110 events. 61/110 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 354 event pairs, 42 based on Foata normal form. 0/71 useless extension candidates. Maximal degree in co-relation 239. Up to 106 conditions per place. [2025-03-17 19:40:42,183 INFO L140 encePairwiseOnDemand]: 107/110 looper letters, 13 selfloop transitions, 1 changer transitions 0/16 dead transitions. [2025-03-17 19:40:42,183 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 16 transitions, 79 flow [2025-03-17 19:40:42,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:40:42,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 19:40:42,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2025-03-17 19:40:42,184 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.08484848484848485 [2025-03-17 19:40:42,184 INFO L175 Difference]: Start difference. First operand has 36 places, 18 transitions, 55 flow. Second operand 3 states and 28 transitions. [2025-03-17 19:40:42,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 16 transitions, 79 flow [2025-03-17 19:40:42,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 16 transitions, 78 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 19:40:42,184 INFO L231 Difference]: Finished difference. Result has 35 places, 16 transitions, 52 flow [2025-03-17 19:40:42,184 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=35, PETRI_TRANSITIONS=16} [2025-03-17 19:40:42,185 INFO L279 CegarLoopForPetriNet]: 67 programPoint places, -32 predicate places. [2025-03-17 19:40:42,185 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 16 transitions, 52 flow [2025-03-17 19:40:42,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-17 19:40:42,185 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:40:42,185 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-17 19:40:42,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 19:40:42,185 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err19ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2025-03-17 19:40:42,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:40:42,185 INFO L85 PathProgramCache]: Analyzing trace with hash 43907600, now seen corresponding path program 1 times [2025-03-17 19:40:42,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:40:42,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917228400] [2025-03-17 19:40:42,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:40:42,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:40:42,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:40:42,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:40:42,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:40:42,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:40:42,225 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-17 19:40:42,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:40:42,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917228400] [2025-03-17 19:40:42,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917228400] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:40:42,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:40:42,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 19:40:42,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322486362] [2025-03-17 19:40:42,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:40:42,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 19:40:42,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:40:42,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:40:42,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:40:42,226 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 110 [2025-03-17 19:40:42,227 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 16 transitions, 52 flow. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-17 19:40:42,227 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:40:42,227 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 110 [2025-03-17 19:40:42,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:40:42,275 INFO L124 PetriNetUnfolderBase]: 37/68 cut-off events. [2025-03-17 19:40:42,275 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 19:40:42,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 68 events. 37/68 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 151 event pairs, 22 based on Foata normal form. 0/52 useless extension candidates. Maximal degree in co-relation 155. Up to 65 conditions per place. [2025-03-17 19:40:42,275 INFO L140 encePairwiseOnDemand]: 107/110 looper letters, 0 selfloop transitions, 0 changer transitions 14/14 dead transitions. [2025-03-17 19:40:42,275 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 14 transitions, 72 flow [2025-03-17 19:40:42,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:40:42,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 19:40:42,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2025-03-17 19:40:42,276 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.07878787878787878 [2025-03-17 19:40:42,276 INFO L175 Difference]: Start difference. First operand has 35 places, 16 transitions, 52 flow. Second operand 3 states and 26 transitions. [2025-03-17 19:40:42,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 14 transitions, 72 flow [2025-03-17 19:40:42,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 14 transitions, 71 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 19:40:42,276 INFO L231 Difference]: Finished difference. Result has 34 places, 0 transitions, 0 flow [2025-03-17 19:40:42,277 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=47, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=34, PETRI_TRANSITIONS=0} [2025-03-17 19:40:42,277 INFO L279 CegarLoopForPetriNet]: 67 programPoint places, -33 predicate places. [2025-03-17 19:40:42,277 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 0 transitions, 0 flow [2025-03-17 19:40:42,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-17 19:40:42,279 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW (97 of 98 remaining) [2025-03-17 19:40:42,280 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW (96 of 98 remaining) [2025-03-17 19:40:42,280 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (95 of 98 remaining) [2025-03-17 19:40:42,280 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW (94 of 98 remaining) [2025-03-17 19:40:42,280 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONINTEGER_OVERFLOW (93 of 98 remaining) [2025-03-17 19:40:42,280 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONINTEGER_OVERFLOW (92 of 98 remaining) [2025-03-17 19:40:42,280 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONINTEGER_OVERFLOW (91 of 98 remaining) [2025-03-17 19:40:42,280 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONINTEGER_OVERFLOW (90 of 98 remaining) [2025-03-17 19:40:42,280 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONINTEGER_OVERFLOW (89 of 98 remaining) [2025-03-17 19:40:42,280 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONINTEGER_OVERFLOW (88 of 98 remaining) [2025-03-17 19:40:42,280 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW (87 of 98 remaining) [2025-03-17 19:40:42,280 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW (86 of 98 remaining) [2025-03-17 19:40:42,280 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (85 of 98 remaining) [2025-03-17 19:40:42,280 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW (84 of 98 remaining) [2025-03-17 19:40:42,280 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (83 of 98 remaining) [2025-03-17 19:40:42,280 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (82 of 98 remaining) [2025-03-17 19:40:42,280 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (81 of 98 remaining) [2025-03-17 19:40:42,280 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (80 of 98 remaining) [2025-03-17 19:40:42,280 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (79 of 98 remaining) [2025-03-17 19:40:42,280 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (78 of 98 remaining) [2025-03-17 19:40:42,280 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (77 of 98 remaining) [2025-03-17 19:40:42,280 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (76 of 98 remaining) [2025-03-17 19:40:42,280 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (75 of 98 remaining) [2025-03-17 19:40:42,281 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (74 of 98 remaining) [2025-03-17 19:40:42,281 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONINTEGER_OVERFLOW (73 of 98 remaining) [2025-03-17 19:40:42,281 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONINTEGER_OVERFLOW (72 of 98 remaining) [2025-03-17 19:40:42,281 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (71 of 98 remaining) [2025-03-17 19:40:42,281 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONINTEGER_OVERFLOW (70 of 98 remaining) [2025-03-17 19:40:42,281 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONINTEGER_OVERFLOW (69 of 98 remaining) [2025-03-17 19:40:42,281 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONINTEGER_OVERFLOW (68 of 98 remaining) [2025-03-17 19:40:42,281 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONINTEGER_OVERFLOW (67 of 98 remaining) [2025-03-17 19:40:42,281 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONINTEGER_OVERFLOW (66 of 98 remaining) [2025-03-17 19:40:42,281 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONINTEGER_OVERFLOW (65 of 98 remaining) [2025-03-17 19:40:42,281 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONINTEGER_OVERFLOW (64 of 98 remaining) [2025-03-17 19:40:42,281 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONINTEGER_OVERFLOW (63 of 98 remaining) [2025-03-17 19:40:42,281 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONINTEGER_OVERFLOW (62 of 98 remaining) [2025-03-17 19:40:42,281 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (61 of 98 remaining) [2025-03-17 19:40:42,281 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONINTEGER_OVERFLOW (60 of 98 remaining) [2025-03-17 19:40:42,281 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (59 of 98 remaining) [2025-03-17 19:40:42,281 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (58 of 98 remaining) [2025-03-17 19:40:42,281 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (57 of 98 remaining) [2025-03-17 19:40:42,281 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (56 of 98 remaining) [2025-03-17 19:40:42,281 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (55 of 98 remaining) [2025-03-17 19:40:42,281 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (54 of 98 remaining) [2025-03-17 19:40:42,282 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (53 of 98 remaining) [2025-03-17 19:40:42,282 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (52 of 98 remaining) [2025-03-17 19:40:42,282 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (51 of 98 remaining) [2025-03-17 19:40:42,282 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (50 of 98 remaining) [2025-03-17 19:40:42,282 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (49 of 98 remaining) [2025-03-17 19:40:42,282 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (48 of 98 remaining) [2025-03-17 19:40:42,282 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW (47 of 98 remaining) [2025-03-17 19:40:42,282 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW (46 of 98 remaining) [2025-03-17 19:40:42,282 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 98 remaining) [2025-03-17 19:40:42,282 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 98 remaining) [2025-03-17 19:40:42,282 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 98 remaining) [2025-03-17 19:40:42,282 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 98 remaining) [2025-03-17 19:40:42,282 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 98 remaining) [2025-03-17 19:40:42,282 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 98 remaining) [2025-03-17 19:40:42,282 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 98 remaining) [2025-03-17 19:40:42,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 98 remaining) [2025-03-17 19:40:42,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 98 remaining) [2025-03-17 19:40:42,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 98 remaining) [2025-03-17 19:40:42,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 98 remaining) [2025-03-17 19:40:42,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 98 remaining) [2025-03-17 19:40:42,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 98 remaining) [2025-03-17 19:40:42,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 98 remaining) [2025-03-17 19:40:42,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 98 remaining) [2025-03-17 19:40:42,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 98 remaining) [2025-03-17 19:40:42,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 98 remaining) [2025-03-17 19:40:42,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 98 remaining) [2025-03-17 19:40:42,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 98 remaining) [2025-03-17 19:40:42,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 98 remaining) [2025-03-17 19:40:42,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 98 remaining) [2025-03-17 19:40:42,284 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 98 remaining) [2025-03-17 19:40:42,284 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 98 remaining) [2025-03-17 19:40:42,284 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 98 remaining) [2025-03-17 19:40:42,284 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 98 remaining) [2025-03-17 19:40:42,284 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 98 remaining) [2025-03-17 19:40:42,284 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 98 remaining) [2025-03-17 19:40:42,284 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 98 remaining) [2025-03-17 19:40:42,284 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 98 remaining) [2025-03-17 19:40:42,284 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 98 remaining) [2025-03-17 19:40:42,284 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 98 remaining) [2025-03-17 19:40:42,284 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 98 remaining) [2025-03-17 19:40:42,284 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 98 remaining) [2025-03-17 19:40:42,284 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 98 remaining) [2025-03-17 19:40:42,284 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 98 remaining) [2025-03-17 19:40:42,284 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 98 remaining) [2025-03-17 19:40:42,284 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 98 remaining) [2025-03-17 19:40:42,284 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 98 remaining) [2025-03-17 19:40:42,284 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 98 remaining) [2025-03-17 19:40:42,284 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 98 remaining) [2025-03-17 19:40:42,284 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 98 remaining) [2025-03-17 19:40:42,284 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 98 remaining) [2025-03-17 19:40:42,284 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 98 remaining) [2025-03-17 19:40:42,284 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 98 remaining) [2025-03-17 19:40:42,284 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 98 remaining) [2025-03-17 19:40:42,284 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 98 remaining) [2025-03-17 19:40:42,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 19:40:42,285 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:40:42,290 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-17 19:40:42,290 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 19:40:42,295 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 07:40:42 BasicIcfg [2025-03-17 19:40:42,295 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 19:40:42,296 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 19:40:42,296 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 19:40:42,296 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 19:40:42,296 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:40:33" (3/4) ... [2025-03-17 19:40:42,297 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 19:40:42,299 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-17 19:40:42,299 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-17 19:40:42,303 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 66 nodes and edges [2025-03-17 19:40:42,303 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 29 nodes and edges [2025-03-17 19:40:42,303 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2025-03-17 19:40:42,303 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-17 19:40:42,361 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 19:40:42,361 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 19:40:42,361 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 19:40:42,362 INFO L158 Benchmark]: Toolchain (without parser) took 11531.60ms. Allocated memory was 142.6MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 112.8MB in the beginning and 1.0GB in the end (delta: -934.4MB). Peak memory consumption was 457.2MB. Max. memory is 16.1GB. [2025-03-17 19:40:42,362 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory was 124.3MB in the beginning and 124.0MB in the end (delta: 293.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 19:40:42,362 INFO L158 Benchmark]: CACSL2BoogieTranslator took 194.72ms. Allocated memory is still 142.6MB. Free memory was 112.8MB in the beginning and 100.8MB in the end (delta: 11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 19:40:42,362 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.93ms. Allocated memory is still 142.6MB. Free memory was 100.8MB in the beginning and 98.5MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 19:40:42,362 INFO L158 Benchmark]: Boogie Preprocessor took 41.27ms. Allocated memory is still 142.6MB. Free memory was 98.5MB in the beginning and 96.2MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 19:40:42,363 INFO L158 Benchmark]: IcfgBuilder took 2123.40ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 96.2MB in the beginning and 334.0MB in the end (delta: -237.7MB). Peak memory consumption was 248.1MB. Max. memory is 16.1GB. [2025-03-17 19:40:42,364 INFO L158 Benchmark]: TraceAbstraction took 9060.40ms. Allocated memory was 427.8MB in the beginning and 1.5GB in the end (delta: 1.1GB). Free memory was 330.1MB in the beginning and 1.1GB in the end (delta: -725.5MB). Peak memory consumption was 385.3MB. Max. memory is 16.1GB. [2025-03-17 19:40:42,364 INFO L158 Benchmark]: Witness Printer took 65.38ms. Allocated memory is still 1.5GB. Free memory was 1.1GB in the beginning and 1.0GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 19:40:42,365 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 was 124.3MB in the beginning and 124.0MB in the end (delta: 293.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 194.72ms. Allocated memory is still 142.6MB. Free memory was 112.8MB in the beginning and 100.8MB in the end (delta: 11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.93ms. Allocated memory is still 142.6MB. Free memory was 100.8MB in the beginning and 98.5MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.27ms. Allocated memory is still 142.6MB. Free memory was 98.5MB in the beginning and 96.2MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 2123.40ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 96.2MB in the beginning and 334.0MB in the end (delta: -237.7MB). Peak memory consumption was 248.1MB. Max. memory is 16.1GB. * TraceAbstraction took 9060.40ms. Allocated memory was 427.8MB in the beginning and 1.5GB in the end (delta: 1.1GB). Free memory was 330.1MB in the beginning and 1.1GB in the end (delta: -725.5MB). Peak memory consumption was 385.3MB. Max. memory is 16.1GB. * Witness Printer took 65.38ms. Allocated memory is still 1.5GB. Free memory was 1.1GB in the beginning and 1.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: 93]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 93]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 94]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 94]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 95]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 95]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 93]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 93]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 94]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 94]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 95]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 95]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 93]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 93]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 94]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 94]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 95]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 95]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 93]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 93]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 94]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 94]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 95]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 95]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 93]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 93]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 94]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 94]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 95]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 95]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 93]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 93]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 94]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 94]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 95]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 95]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 93]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 93]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 94]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 94]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 95]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 95]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 93]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 93]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 94]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 94]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 95]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 95]: 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 5 procedures, 123 locations, 214 edges, 98 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: 8.1s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 563 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 563 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 75 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 665 IncrementalHoareTripleChecker+Invalid, 740 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 75 mSolverCounterUnsat, 0 mSDtfsCounter, 665 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=221occurred in iteration=0, InterpolantAutomatonStates: 50, 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.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 68 NumberOfCodeBlocks, 68 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 51 ConstructedInterpolants, 0 QuantifiedInterpolants, 195 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 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 48 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-17 19:40:42,389 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE